Login / Signup
Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem.
Qingguo Wang
Dmitry Korkin
Yi Shang
Published in:
IJCAI (2009)
Keyphrases
</>
longest common subsequence
biological sequences
computationally efficient
edit distance
data structure
pattern recognition
finite automata
similarity measure
lower bound
dynamic time warping