A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences.
Daniel J. KleitmanDavid Joseph KwiatkowskiPublished in: J. Comb. Theory, Ser. A (1976)
Keyphrases
- lower bound
- longest common subsequence
- fixed length
- upper bound
- variable length
- branch and bound
- optimal solution
- dynamic time warping
- np hard
- branch and bound algorithm
- lower bounding
- edit distance
- edit operations
- objective function
- biological sequences
- lower and upper bounds
- polynomial approximation
- arbitrary length
- sufficiently accurate
- approximation algorithms
- worst case
- sequence databases
- maximum number
- online algorithms
- probability distribution
- special case
- genetic algorithm
- data sets