scientific article; zbMATH DE number 2185636

MaRDI QIDQ3024802zbMATH OpenFDO

Authors Daniel S. Hirschberg

Publication date 4 July 2005

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the Number of Subsequences When Deleting Symbols From a String
• Strings with maximally many distinct subsequences and substrings
• Algorithms for subsequence combinatorics
• The size of subsequence automaton.
• The size of subsequence automaton

Cited in

(10)

• Near-optimal algorithm to count occurrences of subsequences of a given length
• Upper bounds on distinct maximal (sub-)repetitions in compressed strings
• Efficient reconstruction of sequences from their subsequences of supersequences
• Combined super-/substring and super-/subsequence problems
• Algorithms for subsequence combinatorics
• Strings with maximally many distinct subsequences and substrings
• scientific article; zbMATH DE number 5790350 (Why is no real title available?)
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• Tight bounds on the maximum number of shortest unique substrings
• On the Number of Subsequences When Deleting Symbols From a String

This page was built for publication:

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