An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem.

Dmitry Korkin Qingguo Wang Yi Shang

Published in: ICPP (2008)

Keyphrases

parallel algorithm
longest common subsequence
parallel computation
dynamic time warping
biological sequences
similarity measure
approximation algorithms
edit distance
parallel version
computationally efficient
data streams
computational complexity
data points