Longest common subsequence problem for unoriented and cyclic strings.

François Nicolas Eric Rivals

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

Keyphrases

beam search
search algorithm
heuristic search
branch and bound
string matching
search methods
edit distance
finite alphabet
search problems
approximate string matching
shortest common supersequence
computational complexity
np hard
dynamic programming
domain independent