Login / Signup

A Fast Multiple Longest Common Subsequence (MLCS) Algorithm.

Qingguo WangDmitry KorkinYi Shang
Published in: IEEE Trans. Knowl. Data Eng. (2011)
Keyphrases
  • longest common subsequence
  • dynamic programming
  • computational complexity
  • matching algorithm
  • np hard
  • high dimensional
  • k means
  • edit distance
  • similarity measure
  • optimal solution
  • feature vectors
  • worst case