Sparse Dynamic Programming for Longest Common Subsequence from Fragments.

Brenda S. Baker Raffaele Giancarlo

Published in: J. Algorithms (2002)

Keyphrases

longest common subsequence
dynamic programming
edit distance
dynamic time warping
biological sequences
similarity measure
approximation algorithms
finite automata
similarity function
subsequence matching
high dimensional
coarse to fine
pattern recognition
object recognition
kernel function