Title :
Parallel algorithms for the longest common subsequence problem
Author :
Babu, K. Nandan ; Saxena, Sanjeev
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
Abstract :
The longest common subsequence problem is to find a substring that is common to two given strings and is at least as long as any other such string. If m and n are the lengths of the two strings (m<2), we obtain O(log m) time parallel algorithm with mn processors and an O(log 2 n) time optimal parallel algorithm. Serial complexity on the decision tree model is Θ(mn)
Keywords :
computational complexity; graph theory; parallel algorithms; string matching; CRCW model; decision tree model; grid directed acyclic graph; longest common subsequence problem; parallel algorithms; serial complexity; substring; time optimal parallel algorithm; Computer science; Costs; Data compression; Data engineering; Decision trees; Parallel algorithms; Pattern recognition;
Conference_Titel :
High-Performance Computing, 1997. Proceedings. Fourth International Conference on
Conference_Location :
Bangalore
Print_ISBN :
0-8186-8067-9
DOI :
10.1109/HIPC.1997.634481
