A BSP/CGM algorithm for the all-substrings longest common subsequence problem

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Alves, C E R ^a,c   Caceres E N ^b   Song, S W ^a  

^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

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

COARSE-GRAINED; COMMUNICATION ROUNDS; LONGEST COMMON SUBSEQUENCE PROBLEM; LONGEST COMMON SUBSEQUENCES; MULTICOMPUTERS; SEQUENTIAL ALGORITHM; SUB-STRINGS; SUBSTRING;

ALGORITHMS;

EID: 84947225579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213150     Document Type: Conference Paper

References (10)

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 Symposium on Parallel Algorithms and Architectures (SPAA), pages 275-281. ACM Press, 2002.
3. 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, Dept. of Computer Science, University of São Paulo, November 2002.
4. A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315-336, 1987.
5. F. Dehne. Coarse grained parallel algorithms. Special Issue of Algorithmica, 24(3/4):173-176, 1999.
6. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In Proc. 9th Annual ACM Symp. Comput. Geom. , pages 298-307, 1993.
7. 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.
8. C. Rick. New algorithms for the longest common subsequence problem. Technical Report 85123-CS, Institut fr Informatik, Universitt Bonn, 1994.
9. J. Schmidt. All highest scoring paths in weighted graphs and their application to finding all approximate repeats in strings. SIAM J. Computing, 27(4):972-992, 1998.
10. L. G. Valiant. A bridging model for parallel computation. Communication of the ACM, 33(8):103-111, 1990.