Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
Jonathan F. BussMartin TompaPublished in: Inf. Comput. (1995)
Keyphrases
- lower bound
- upper bound
- fixed length
- finite alphabet
- arbitrary length
- hidden markov models
- branch and bound algorithm
- variable length
- data structure
- sequential patterns
- branch and bound
- lower and upper bounds
- np hard
- quadratic assignment problem
- objective function
- lower bounding
- long sequences
- optimal solution
- image registration
- sequence alignment
- online algorithms
- optimal cost
- randomly generated problems