Lower Bounds on the Length of Universal Traversal Sequences.
Allan BorodinWalter L. RuzzoMartin TompaPublished in: J. Comput. Syst. Sci. (1992)
Keyphrases
- lower bound
- fixed length
- upper bound
- branch and bound algorithm
- arbitrary length
- hidden markov models
- finite alphabet
- variable length
- branch and bound
- optimal solution
- lower and upper bounds
- worst case
- np hard
- quadratic assignment problem
- sequence matching
- data structure
- vc dimension
- long sequences
- longest common subsequence
- sequential patterns
- constraint satisfaction problems
- sample complexity
- video sequences
- randomly generated problems
- genetic algorithm
- set of randomly generated instances