Longest Common Subsequence from Fragments via Sparse Dynamic Programming.
Brenda S. BakerRaffaele GiancarloPublished in: ESA (1998)
Keyphrases
- dynamic programming
- longest common subsequence
- edit distance
- dynamic time warping
- approximation algorithms
- high dimensional
- finite automata
- biological sequences
- similarity measure
- similarity function
- reinforcement learning
- coarse to fine
- subsequence matching
- sequence matching
- computational complexity
- shape similarity