Efficient algorithms for the longest common subsequence in k-length substrings.

Sebastian Deorowicz Szymon Grabowski

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

Keyphrases

longest common subsequence
edit distance
dynamic time warping
similarity measure
finite automata
approximation algorithms
similarity function
biological sequences
graph matching
distance function
distance measure
dynamic programming
sequence matching
subsequence matching
regular expressions
suffix tree
np hard