Strings with Maximally Many Distinct Subsequences and Substrings.
Abraham FlaxmanAram W. HarrowGregory B. SorkinPublished in: Electron. J. Comb. (2004)
Keyphrases
- edit distance
- longest common subsequence
- hamming distance
- variable length
- dynamic time warping
- long strings
- closely related
- information retrieval
- approximate string matching
- finite automata
- suffix tree
- distance measure
- similarity measure
- information systems
- pattern matching
- np hard
- multiscale
- biological sequences
- string kernels
- genetic algorithm
- databases
- shortest common supersequence