Another efficient systolic algorithm for the longest common subsequence problem

Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an

Volumn 23, Issue 5, 2000, Pages 607-613

  Lin, Yen Chun ^a   Chen, Jyh Chian ^a  

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

Author keywords

Longest common subsequence; Multicomputer; Parallel algorithm; Systolic array

Indexed keywords

COMPUTATION THEORY; PARALLEL ALGORITHMS;

LONGEST COMMON SUBSEQUENCE (LCS); MULTICOMPUTERS;

SYSTOLIC ARRAYS;

EID: 0034264695     PISSN: 02533839     EISSN: 21587299     Source Type: Journal    
DOI: 10.1080/02533839.2000.9670581     Document Type: Article

References (21)

1. Agerwala, T., Martin, J. L., Mirza, J. H., Sadler, D. C., Dias, D. M., and Snir, M., 1995. “SP2 System Architecture,”. IBM Systems Journal, 34 (2):152–184.
2. Aho, A., Hirschberg, D., and Ullman, J., 1976. “Bounds on the Complexity of the Longest Common Subsequence Problem,”. Journal of the Association for Computing Machinery, 23 (1):1–12.
3. Apostolico, A., Browne, S., and Guerra, C., 1992. “Fast Linear-space Computations of Longest Common Subsequences,”. Theoretical Computer Science, 92:3–17.
4. Feldman, Y., and Shapiro, E., 1992. “Spatial Machines:A More Realistic Approach to Parallel Computation,”. Communications of the ACM, 35 (10):61–73.
5. Gusfield, D., 1997. Algorithms on Strings, Trees, and Sequences:Computer Science and Computational Biology, Cambridge, England:Cambridge University Press.
6. Hirschberg, D. S., 1975. “A Linear Space Algorithm for Computing Maximal Common Subsequences,”. Communications of the ACM, 18 (6):341–343.
7. Hirschberg, D. S., 1977. “Algorithms for the Longest Common Subsequence Problem,”. Journal of the Association for Computing Machinery, 24 (4):664–675.
8. Kumar, S. K., and Rangan, C. P., 1987. “A Linear-space Algorithm for the LCS Problem,”. Acta Informatica, 24:353–362.
9. Kung, H. T., 1982. “Why Systolic Architectures?”. IEEE Computer, 15 (1):37–46.
10. Lecroq, T., Luce, G., and Myoupo, J. F., 1997. “A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence,”. Information Processing Letters, 61 (3):129–136.
11. Lin, Y.-C., 1994. “New Systolic Arrays for the Longest Common Subsequence Problem,”. Parallel Computing, 20 (9):1323–1334.
12. Lin, Y.-C, and Chen, J. C., 1998. “An Efficient Systolic Algorithm for the Longest Common Subsequence Problem,”. The Journal of Super computing, 12 (4):373–385.
13. Lu, M., and Lin, H., 1994. “Parallel Algorithms for the Longest Common Subsequence Problem,”. IEEE Transactions on Parallel and Distributed Systems, 5 (8):835–848.
14. Luce, G., and Myoupo, J. F., “An Efficient Linear Systolic Algorithm for Recovering Longest Common Subsequences,”. Proc. IEEE Int. Conf. on Algorithms and Architectures for Parallel Processing. Brisbane, Australia. pp. 20–29.
15. Nakatsu, N., Kambayashi, Y., and Yajima, S., 1982. “A Longest Common Subsequence Algorithm Suitable for Similar Text Strings,”. Acta Informatica, 18:171–179.
16. Quinton, P., and Robert, Y., 1991. Systolic Algorithms & Architectures, Hertfordshire, UK:Prentice Hall International.
17. Robert, Y., and Tchuente, M., 1985. “A Systolic Array for the Longest Common Subsequence Problem,”. Information Processing Letters, 21 (4):191–198.
18. Sankoff, D., and Kruskal, J. B., 1983. Time Warps, String Edits and Macromolecules:The Theory and Practice of Sequence Comparison, Reading, MA:Addison-Wesley.
19. Setubal, J., and Meidanis, J., 1997. Introduction to Computational Molecular Biology, Boston, MA:PWS.
20. Wagner, R. A., and Fischer, M. J., 1974. “The String to String Correction Problem,”. Journal of the Association for Computing Machinery, 21:168–173.
21. Xu, Z., and Hwang, K., 1996. “Modeling Communication Overhead:MPI and MPL Performance on the IBM SP2,”. IEEE Parallel & Distributed Technology, 4 (1):9–23.