Universal Traversal Sequences of Length n^O(log n) for Cliques.

Howard J. Karloff Ramamohan Paturi Janos Simon

Published in: Inf. Process. Lett. (1988)

Keyphrases

fixed length
arbitrary length
finite alphabet
hidden markov models
alphabet size
variable length
worst case
tree structure
longest common subsequence
data structure
database
sequential data
sequence alignment
optimal solution
bayesian networks
learning algorithm
data sets