Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints.
Xiaodong WangDaxin ZhuPublished in: SmartCom (2016)
Keyphrases
- efficient computation
- longest common subsequence
- dynamic time warping
- finite automata
- biological sequences
- edit distance
- computational efficiency
- approximation algorithms
- similarity measure
- data sets
- sequence matching
- similarity function
- special case
- feature selection
- database
- pattern matching
- np hard
- feature vectors
- data structure
- subsequence matching