scientific article; zbMATH DE number 2185636

zbMATH Open1063.68617MaRDI QIDQ3024802FDOQ3024802

Authors: Daniel S. Hirschberg 

Publication date: 4 July 2005

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (10)

• 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
• Title not available (Why is that?)
• 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
• Near-optimal algorithm to count occurrences of subsequences of a given length

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)