Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.
Guillaume BlinLaurent BulteauMinghui JiangPedro J. TejadaStéphane VialettePublished in: CPM (2012)
Keyphrases
- longest common subsequence
- biological sequences
- dynamic time warping
- approximation algorithms
- edit distance
- sequence matching
- similarity measure
- finite automata
- similarity function
- np hard
- subsequence matching
- worst case
- computational complexity
- sequence data
- protein sequences
- distance measure
- query processing
- data analysis