Efficient algorithms for the longest common subsequence in $k$-length substrings.
Sebastian DeorowiczSzymon GrabowskiPublished in: CoRR (2013)
Keyphrases
- longest common subsequence
- edit distance
- dynamic time warping
- similarity measure
- finite automata
- biological sequences
- similarity function
- sequence matching
- approximation algorithms
- distance measure
- subsequence matching
- graph matching
- duplicate detection
- suffix tree
- grammatical inference
- sequence data
- euclidean distance