Parallel Algorithms for the Longest Common Subsequence Problem

Authors:
K. Nandan Babu;Sanjeev Saxena
Affiliations:
-;-
Venue:
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Year:
1997

Citing 0
Cited 3

A parallel LCS algorithm for biosequences alignment

Proceedings of the 2nd international conference on Scalable information systems
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Fast parallel algorithms for the longest common subsequence problem using an optical bus

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

The longest common subsequence problem is to finda substring that is common to two given strings and isatleast as long as any other such string. If m and nare the lengths of the two strings (m \le n), we obtainO(log m) time parallel algorithm with mn processorsand an O(log2n) time optimal parallel algorithm. Serial complexity on decision tree model is \theta(mn).