Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
Vlado DancíkMike PatersonPublished in: STACS (1994)
Keyphrases
- longest common subsequence
- upper bound
- biological sequences
- dynamic time warping
- lower bound
- edit distance
- similarity function
- approximation algorithms
- sequence matching
- finite automata
- similarity measure
- worst case
- lower and upper bounds
- duplicate detection
- subsequence matching
- np hard
- shape similarity
- hidden markov models
- data structure