Strings with maximally many distinct subsequences and substrings

MaRDI QIDQ1422149zbMATH OpenFDO

Authors Aram W. Harrow, Gregory B. Sorkin, Abraham D. Flaxman

Publication date 5 February 2004

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123417, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r8.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

extremal combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Combinatorics on words (68R15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• scientific article; zbMATH DE number 2185636
• Algorithms for subsequence combinatorics
• Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
• Two-pattern strings. II: Frequency of occurrence and substring complexity
• scientific article; zbMATH DE number 1992419

Cited in

(14)

• Upper bounds on distinct maximal (sub-)repetitions in compressed strings
• Maximal state complexity and generalized de Bruijn words
• Maximal Words in Sequence Comparisons Based on Subword Composition
• scientific article; zbMATH DE number 2185636 (Why is no real title available?)
• Finding binary words with a given number of subsequences
• Combined super-/substring and super-/subsequence problems
• Algorithms for subsequence combinatorics
• On extending de Bruijn sequences
• Test sequence construction using minimum information on the tested system
• On average sequence complexity
• Subsequence frequency in binary words
• Diagonal Asymptotics for Products of Combinatorial Classes
• Counting distinct strings
• On the Number of Subsequences When Deleting Symbols From a String

This page was built for publication: Strings with maximally many distinct subsequences and substrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422149)