A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

Algorithmica (New York)

Volumn 45, Issue 3, 2006, Pages 301-335

  Alves, Carlos E R ^a   Caceres, Edson N ^b   Song, Siang Wun ^c  

^a SÃO JUDAS TADEU UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

All substrings LCS; BSP; CGM; LCS; Longest common subsequence; Parallel algorithm

Indexed keywords

COMMUNICATION; PROBLEM SOLVING; PROGRAM PROCESSORS;

ALL-SUBSTRINGS LCS; BSP; COARSE GRAINED MULTICOMPUTER (CGM); LONGEST COMMON SUBSEQUENCE (LCS);

PARALLEL ALGORITHMS;

EID: 33745034074     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1216-z     Document Type: Article

References (24)

1. A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195-208, 1987.
2. C. E. R. Alves, E. N. Cáceres, F. Dehne, and S. W. Song. Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures - SPAA 2002, pages 275-281. ACM Press, New York, 2002.
3. C. E. R. Alves, E. N. Cáceres, and S. W. Song. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. In Proceedings of the 17th IEEE International Parallel and Distributed Processing Symposium - IPDPS 2003, pages 22-26. IEEE Computer Society Press, Los Alamitos, CA, April 2003.
4. C. E. R. Alves, E. N. Cáceres, and S. W. Song. Sequential and parallel algorithms for the all-substrings longest common subsequence problem. Technical Report RT-MAC-2003-03, Instituto de Matemática e Estatística, USP, April 2003.
5. C. E. R. Alves, E. N. Cáceres, and S. W. Song. An all-substrings common subsequence algorithm - 2nd Brazilian symposium on graphs, algorithms and combinatorics. Electronics Notes in Discrete Mathematics, 19:133-139, 2005.
6. A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315-336, 1987.
7. F. Dehne (editor). Coarse grained parallel algorithms. Algorithmica, 24(3/4):173-176, 1999.
8. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In Proceedings of the 9th ACM Symposium on Computational Geometry, pages 298-307, 1993.
9. A. J. F. Griffiths, J. H. Miller, D. T. Suzuki, R. C. Lewontin, and W. M. Gelbart. An Introduction to Genetic Analysis, sixth edition, Freeman, San Francisco, CA, 1996.
10. D. Gusfield. Algorithms in Strings, Trees and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997.
11. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18:341-343, 1975.
12. J. W. Hunt and T. G. Szymansky. A fast algorithm for computing longest common subsequences. Communications of the ACM, 20(5):350-353, May 1977.
13. G. M. Landau and M. Ziv-Ukelson. On the common substring alignment problem. Journal of Algorithms, 41:338-359, 2001.
14. M. Lu. Parallel computation of longest-common-subsequences. In International Conference on Computing and Information, pages 385-394. Lecture Notes in Computer Science, Volume 468. Springer-Verlag, Berlin, 1990.
15. M. Lu and H. Lin. Parallel algorithms for the longest common subsequence problem. IEEE Transactions on Parallel and Distributed Systems, 5(8):835-848, 1994.
16. M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73-78, 1990.
17. W. J. Masek and M. S. Paterson. A faster algorithm for computing string edit distances. Journal of Computer and System Sciences, 20:18-31, 1980.
18. W. J. Masek and M. S. Paterson. How to compute string-edit distances quickly. In D. Sankoff and J. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pages 337-349. Addison-Wesley, Reading, MA, 1983.
19. P. A. Pevzner. Computational Molecular Biology - An Algorithmic Approach. The MIT Press, Cambridge, MA, 2000.
20. C. Rick. New algorithms for the longest common subsequence problem. Technical Report 85123-CS, Institut für Informatik, Universität Bonn, 1994.
21. J. Schmidt. All highest scoring paths in weighted graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing, 27(4):972-992, 1998.
22. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS, Boston, MA, 1997.
23. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
24. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 943-972. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.