Shortest Consistent Superstrings Computable in Polynomial Time.

Tao Jiang Vadim G. Timkovsky

Published in: Theor. Comput. Sci. (1995)

Keyphrases

finite sets
special case
turing machine
finite automata
approximation algorithms
data sets
computational complexity
e learning
image sequences
worst case
piecewise linear
globally optimal