Efficient parallel algorithms
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
Parallel computation of longest-common-subsequence
ICCI'90 Proceedings of the international conference on Advances in computing and information
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Selected combinatorial research problems.
Selected combinatorial research problems.
Parallel Parsing Algorithms for Static Dictionary Compression
IEEE Transactions on Parallel and Distributed Systems
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
Parallel algorithms for the static dictionary compression
DCC '95 Proceedings of the Conference on Data Compression
New Processor Array Architectures for the Longest Common Subsequence Problem
The Journal of Supercomputing
An all-substrings common subsequence algorithm
Discrete Applied Mathematics
A parallel LCS algorithm for biosequences alignment
Proceedings of the 2nd international conference on Scalable information systems
A PGAS-Based Algorithm for the Longest Common Subsequence Problem
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Efficient representations of row-sorted 1-variant matrices for parallel string applications
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Fast scalable algorithm on LARPBS for sequence alignment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
A subsequence of a given string is any string obtained by deleting none or some symbolsfrom the given string. A longest common subsequence (LCS) of two strings is a commonsubsequence of both that is as long as any other common subsequences. The problem isto find the LCS of two given strings. The bound on the complexity of this problem underthe decision tree model is known to be mn if the number of distinct symbols that canappear in strings is infinite, where m and n are the lengths of the two strings,respectively, and m/spl les/n. In this paper, we propose two parallel algorithms far thisproblem on the CREW-PRAM model. One takes O(log/sup 2/m + log n) time with mn/log m processors, which is faster than all the existing algorithms on the same model. The other takes O(log/sup 2/m log log m) time with mn/(log/sup 2/m log log m) processors when log/sup 2/m log log m