C. E. R. Alves, E. N. Caceres  Home/Search
Context
Related
| dct.ufms.br/~edson/artigos...similar.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dct.ufms.br/~edson/publica (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n, which requires time, on a distributed memory parallel computer of p processors each with O(nm=p) memory. The algorithm is based on a compromise between the workload of each processor and the number of communication rounds required, expressed by a new parameter called . The proposed algorithm is expressed in terms of this parameter. We implemented very promising experimental results obtained... (Update)
Similar documents (at the sentence level): More
35.7%: A CGM/BSP Parallel Similarity Algorithm - Alves, Cáceres, Dehne, Song (2002) (Correct)
34.9%: A Parallel Wavefront Algorithm for Efficient.. - Alves.. (2003) (Correct)
34.9%: A Parallel Wavefront Algorithm for Ecient - Biological Sequence Comparison (Correct)
Active bibliography (related documents): More All
0.3: Parallel Dynamic Programming for Solving the String.. - Alves, Cáceres (2002) (Correct)
0.1: Sequence Comparison: Some Theory and Some Practice - Simon (1988) (Correct)
0.1: Sequential and Parallel Algorithms for the All-Substrings.. - Alves, Caceres, Song (Correct)
Similar documents based on text: More All
1.1: A Parallel Algorithm for Transitive Closure - Caceres, Song (Correct)
0.9: Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (1997) (Correct)
0.8: Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (Correct)
BibTeX entry: (Update)
@misc{ alves-parameterized,
author = "C. E. R. Alves and E. N. Caceres",
title = "A Parameterized Parallel Algorithm for Efficient Biological Sequence Comparison",
url = "citeseer.ist.psu.edu/579365.html" }
Citations (may not include all citations):735 A bridging model for parallel computation (context) - Valiant - 1990
247 A general method applicable to the search for similarities i.. (context) - Needleman, Wunsch - 1970
240 Identification of common molecular subsequences - Smith, Waterman - 1981
196 Fast text searching allowing errors (context) - Wu, Manber - 1992
148 The theory and computation of evolutionary distances: Patter.. (context) - Sellers - 1980
109 Scalable parallel geometric algorithms for coarse grained mu.. - Dehne, Fabri et al. - 1993
83 Approximate string matching (context) - Hall, Dowling - 1980
81 Introduction to Computational Molecular Biology (context) - Setubal, Meidanis - 1997
24 Efficient parallel algorithms for string editing and related.. (context) - Apostolico, Atallah et al. - 1990
14 Dynamic programming with convexity (context) - Galil, Park - 1992
11 Parallel dynamic programming - Galil, Park - 1991
8 Parallel dynamic programming solving string editing problem .. - Dehne, dynamic et al. - 2002
8 An algorithm for differential file comparison (context) - Hunt, Szymansky - 1977
7 An introduction to parallel dynamic programming (context) - Gengler - 1996
1 Coarse grained parallel algorithms (context) - Editor - 1999
1 cgmbsp parallel similarity algorithm - Dehne, bsp et al. - 2002
Documents on the same site (http://www.dct.ufms.br/~edson/publica.html):
A Parallel Algorithm For Transitive Closure - Cáceres, Song (Correct)
A CGM/BSP Parallel Similarity Algorithm - Alves, Caceres, Dehne, Song (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC