Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
Vlado DancíkMike PatersonPublished in: Random Struct. Algorithms (1995)
Keyphrases
- longest common subsequence
- upper bound
- biological sequences
- dynamic time warping
- lower bound
- edit distance
- sequence matching
- similarity measure
- approximation algorithms
- similarity function
- finite automata
- worst case
- subsequence matching
- branch and bound algorithm
- lower and upper bounds
- protein sequences
- molecular biology
- duplicate detection
- np hard