A scalable and efficient systolic algorithm for the longest common subsequence problem

Journal of Information Science and Engineering

Volumn 18, Issue 4, 2002, Pages 519-532

  Lin, Yen Chun ^a   Yeh, Jih Wei ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Longest common subsequence; Multicomputers; Parallel algorithms; Scalable algorithms; Systolic arrays

Indexed keywords

MULTIPROCESSING PROGRAMS; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SEQUENTIAL MACHINES; TIME SHARING SYSTEMS;

LONGEST COMMON SUBSEQUENCE PROBLEM; MULTICOMPUTERS; SCALABLE ALGORITHMS; SYSTOLIC ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 0036645959     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. SP2 system architecture
2. Bounds on the complexity of the longest common subsequence problem
3. Fast linear-space computations of longest common subsequences
4. A linear space algorithm for computing maximal common subsequences
5. Algorithms for the longest common subsequence problem
6. A linear-space algorithm for the LCS problem
7. Why systolic architectures?
8. A faster linear systolic algorithm for recovering a longest common subsequence
9. New systolic arrays for the longest common subsequence problem
10. An efficient systolic algorithm for the longest common subsequence problem
11. Another efficient systolic algorithm for the longest common subsequence problem
12. Deriving a systolic algorithm for the LCS problem
13. Parallel algorithms for the longest common subsequence problem
14. An efficient linear systolic algorithm for recovering longest common subsequences
15. Systolic-based parallel architecture for the longest common subsequences problem
16. A longest common subsequence algorithm suitable for similar text strings
17. Partitioning: An essential step in mapping algorithms into systolic array processors
18. A systolic array for the longest common subsequence problem
19. The string to string correction problem