New processor architectures for the longest common subsequence problem

Journal of Supercomputing

Volumn 32, Issue 1, 2005, Pages 51-69

  Michailidis, Panagiotis D ^a   Margaritis, Konstantinos G ^a  

^a Parallel Distributed Proc Lab U   (Greece)

Author keywords

Linear processor arrays; Longest common subsequence problem; Parallel algorithms; Parallel architectures; VLSI

Indexed keywords

ALGORITHMS; ARRAYS; BIT ERROR RATE; COMPUTER ARCHITECTURE; DYNAMIC PROGRAMMING; ESTIMATION; PROBLEM SOLVING; VLSI CIRCUITS;

BIT-LEVEL DYNAMIC PROGRAMMING; LINEAR PROCESSOR ARRAYS; LONGEST COMMON SUBSEQUENCE PROBLEM; PARALLEL ARCHITECTURE;

PROGRAM PROCESSORS;

EID: 17444402130     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11227-005-0158-6     Document Type: Article

References (30)

1. A. V. Aho, D. S. Hirschberg, and J. D. Ullman. Bounds on the complexity of the longest common subsequence problem. Journal of Association Computing Machineny, 23:1-12, 1976.
2. A. Apostolico, M. Attalah, L. Larmore, and S. Mcfaddin. Efficient parallel algorithms for string editing and related problems. SIAM Journal on Computing, 19:968-988, 1990.
3. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In 7th International Symposium on String Processing and Information Retrieval, pp. 39-48, 2000.
4. M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, and J. R. Reid. A fast and practical bit-vector algorithm for the longest common subsequence problem. In 11th Australasian Workshop on Combinatorial Algorithms, pp. 75-86, 2000.
5. M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, and J. R. Reid. A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters, 80:279-285, 2001.
6. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, England, 1997.
7. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18:341-343, 1975.
8. D. S. Hirschberg. An information theoretic lower bound for the longest common subsequence problem. Information Processing Letters, 7:40-41, 1978.
9. R. Hughey. Parallel hardware for sequence comparison and alignment CABIOS, 12:473-479, 1996.
10. S. Y. Kung. VLSI Array Processors. Prentice-Hall, 1988.
11. T. Lecroq, G. Luce, and J. F. Myoupo. A faster linear systolic algorithm for recovering a longest common subsequence. Information Processing Letters, 61:129-136, 1997.
12. T. Lecroq, J. F. Myoupo, and D. Seme. A one-phase parallel algorithm for the sequence alignment problem. Parallel Processing Letters, 8:515-526, 1998.
13. Y.-C. Lin. New systolic arrays for the longest common subsequence problem. Parallel Computing, 20:1323-1334, 1994.
14. Y.-C. Lin and J.-C. Chen. An efficient systolic algorithm for the longest common subsequence problem. The Journal of Supercomputing, 12:373-385, 1998.
15. Y.-C. Lin and J.-C. Chen. Another efficient systolic algorithm for the longest common subsequence problem. Journal of the Chinese Institute of Engineers, 23:607-613, 2000.
16. Y.-C. Lin and J.-W. Yeh. A scalable and efficient systolic algorithm for the longest common subsequence problem. Journal of Information Science and Engineering, 18:519-532, 2002.
17. Y.-C. Lin and J.-W. Yeh. Deriving a systolic algorithm for the LCS problem. International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1890-1897, 1998.
18. Y.-C. Lin and J.-W. Yeh. Deriving a fast systolic algorithm for the longest common subsequence problem. Parallel Algorithms and Applications, 17:1-18, 2002.
19. G. Luce and J. F. Myoupo. Systolic-based parallel architecture for the longest common subsequences problem. Integration, the VLSI Journal, 25:53-70, 1998.
20. M. Lu and H. Lin. Parallel algorithms for the longest common subsequence problem. IEEE Transactions on Parallel and Distributed Systems, 5:835-848, 1994.
21. K. G. Margaritis and D. J. Evans. A VLSI processor array for flexible string matching. Parallel Algorithms and Applications, 11:45-60, 1997.
22. W. J. Masek and M. S. Paterson. A faster algorithm computing string edit distances. Journal of Computer System Sciences, 20:18-31, 1980.
23. J. H. Moreno and T. Lang. Matrix Computations on Systolic-Type Arrays. Kluwer Academic Publishers, 1992.
24. N. Petkov. Systolic Parallel Processing. Elsevier Science Publishers, 1993.
25. N. Ranganathan and R. Sastry. VLSI architectures for pattern matching. International Journal of Pattern Recognition and Artificial Intelligence, 8:815-843, 1994.
26. Y. Robert and M. Tchuente. A systolic array for the longest common subsequence problem. Information Processing Letters, 21:191-198, 1985.
27. D. Sankoff and J.B. Kruskal. Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.
28. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS, Boston, MA, 1997.
29. M. Snir, S. Otto, S. Huss-Lederman, D. W. Walker and J. Dongarra. MPI: The Complete Reference. The MIT Press, Cambridge, Massachusetts, 1996.
30. C.-B. Yang and R. C. T. Lee. Systolic algorithms for the longest common subsequence problem. Journal of the Chinese Institute of Engineers, 10:691-699, 1987.