A coarse-grained multicomputer algorithm for the longest common subsequence problem

Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003

Volumn , Issue , 2003, Pages 349-356

  Garcia, T ^a   Myoupo, J F ^a   Seme D ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Algorithm design and analysis; Computational modeling; Computer architecture; Data compression; Error correction; Genetic engineering; Parallel processing; Pattern recognition; Phase change random access memory; User generated content

Indexed keywords

COMPUTER ARCHITECTURE; DATA COMPRESSION; ERROR CORRECTION; GENETIC ENGINEERING; PATTERN RECOGNITION; PHASE CHANGE MEMORY; RANDOM ACCESS STORAGE;

ALGORITHM DESIGN AND ANALYSIS; COMPUTATIONAL MODEL; PARALLEL PROCESSING; PHASE CHANGE RANDOM ACCESS MEMORY; USER-GENERATED CONTENT;

ALGORITHMS;

EID: 33745956950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2003.1183610     Document Type: Conference Paper

References (26)

1. A. Aho, D. Hirschberg, and J.D. Ullman, Bounds on the Complexity ofthe Longest Common Subsequence Problem, Journal of the ACM. 23,1 (1976),1-12.
2. A. Apostolico, M. Attalah, L. Larmore and S. Mcfaddin, Efficient Parallel Algorithms for String Editing and Related Problems, SIAM Journal on Computing (1990) 19:968-988.
3. A. Apostolico, S. Brown and C. Guerra, Fast linear-Space computations of Longest Common Subsequences, Theoretical Computer Science 92 (1992),3-17.
4. P. Bose, A. Chan, F. Dehne and M. Latzel, Coarse Grained Parallel Maximum Matching in Convex Bipartite Graph, Proc. 13th International Parallel Processing Symposium (IPPS'99), (1999) 125-129.
5. A. Chan and F. Dehne, A Note on Coarse Grained Parallel Integer Sorting, Parallel Processing Letters, (1999) 9(4):533-538.
6. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian and T. Von Eicken, LogP:Towards a Realistic Model of Parallel Computation, 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming (1996) 1-12.
7. F. Dehne, A. Fabri and A. Rau-Chaplin, Scalable Parallel Computational Geometry for Coarse Grained Multicomputers, International Journal on Computational Geometry (1996) 6(3):379-400.
8. F. Dehne, X. Deng, P. Dymond, A. Fabri and A. Khokhar, A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, (1995) 27-33.
9. M. Diallo, A. Ferreira, A. Rau-Chaplin and S. Ubeda, Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers, Journal of Parallel and Distributed Computing, (1999) 56(1):47-70.
10. M. Du and W. Hsu, New Algorithms for the Longest Common Subsequence Problem, Journal of Computer and System Sciences 29 (1984),133-152.
11. V. Dančík and M.S. Paterson, Longest Common Subsequences, In E.W. Mayr, P. Enjalbert and K.W. Wagner, editors, Proc. 11th Annual Symp. on Theoretical Aspects of Computer Science, Caen, France, number 775 in Lecture Notes in Computer Science, Berlin, Springer-Verlag, Academic Press. (1994),127-142.
12. A. Ferreira and N. Schabanel, A Randomized BSP/CGM Algorithm for the Maximal Independant Set Problem, Parallel Processing Letters, (1999) 9(3):411-422.
13. T. Garcia, J.F. Myoupo and D. Semé A Work-Optimal CGM Algorithm for the Longest Increasing Subsequence Problem, International Conference n Parallel and Distributed Processing Techniques and Applications (PDPTA'01), (2001)
14. M. Goudreau, K. Lang, S. Rao, T. Suel and T. Tsantilas, Towards Efficiency and Portability: Programming with the BSP Model, 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA'96) (1996) 1-12.
15. D.S. Hirschberg, Algorithms for the Longest Common Subsequence Problem, Journal of the ACM (1977) 24(4):664-675.
16. J.W. Hunt and T.G. Szymanski, A Fast Algorithm for Computing Longest Common Subsequences, Communications of the ACM (1977) 20:350-353.
17. Y. Kayambayashi, N. Nakatsu and S. Yajima, A Longest Algorithm Suitable for Similar Text String, Acta Informatica (1982) 18:171-179.
18. S.R. Kim and K. Park, Fully Scalable Fault-Tolerant Simulations for BSP and CGM, Journal of Parallel and Distributed Computing, (2000) 60:1531-1560.
19. T. Lecroq, G. Luce and J.F. Myoupo, A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence, Information Processing Letters 61,3 (1997),129-136.
20. M. Lu and H. Lin, Parallel Algorithms for the Longest Common Subsequence Problem, IEEE Transactions on Computers 5,8 (1994),835-848.
21. G. Luce and J.F. Myoupo, Application-Specific Array Processors For The Longest Common Subsequence Problem of Three Sequences, Parallel Algorithms and Applications 13 (1998),27-52.
22. W.J. Masek and M.S. Paterson, A Faster Algorithm for Computing String Edit Distances, Journal of Computer and System Sciences (1980) 20:18-31.
23. Y. Robert and M. Tchuente, A Systolic Array for the Longest Common Subsequence Problem, Information Processing Letters 21 (1985),191-198.
24. D. Semé, Algorithmique Parallèle pour des Problèmes de Reconnaissance de Formes et de Motifs sur les Modèles Systolique et BSR, Thèse de l'Université Picardie Jules Verne - Amiens (1999)
25. M.S. Waterman, Sequence Alignments, In: Mathematical Methods for DNA Sequence Ch 3 (1985),53-92.
26. L.G. Valiant, A Bridging Model for Parallel Computation, Communications of the ACM (1990) 33(8):103-111.