Efficient parallel string comparison

Advances in Parallel Computing

Volumn 15, Issue , 2008, Pages 193-200

  Krusche, Peter ^a   Tiskin, Alexander ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906502934     PISSN: 09275452     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. 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: Proc. of 14th ACM SPAA, pp. 275-281, (2002).
2. C. E. R. Alves, E. N. Cáceres, F. Dehne and S. W. Song, A parallel wavefront algorithm for efficient biological sequence comparison, in: Proc. ICCSA, vol. 2668 of LNCS, (2003).
3. C. E. R. Alves, E. N. Cáceres and S. W. Song, A BSP/CGM algorithm for the allsubstrings longest common subsequence problem, in: Proc. 17th IEEE/ACM IPDPS, pp 1-8, (2003).
4. C. E. R. Alves, E. N. Cáceres and S.W. Song, A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem, Algorithmica, 45, 301-335, (2006).
5. J. L. Bentley, Multidimensional divide-and-conquer, Comm. ACM, 23, 214-229, (1980).
6. R. H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, (Oxford University Press, 2004).
7. T. Garcia and D. Semé, A load balancing technique for some coarse-grained multicomputer algorithms, in: SCA 21st International Conference on Computers and Their Applications (CATA '06), pp. 301-306, (2006).
8. J. Jájá, C. Mortensen and Q. Shi, Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting, in: Proc. 15th ISAAC, vol. 3341 of LNCS, (2004).
9. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl., 6, 707-710, (1966).
10. W. F. McColl, Scalable Computing, in: Computer Science Today: Recent Trends and Developments, vol. 1000 of LNCS, pp. 46-61, (Springer-Verlag, 1995).
11. J. P. Schmidt, All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings, SIAM Journal on Computing, 27, 972-992, (1998).
12. A. Tiskin, Semi-local string comparison: Algorithmic techniques and applications, Mathematics in Computer Science, arXiv:0707.3619 [cs.DS], (2007, in press).
13. A. Tiskin. Efficient representation and parallel computation of string-substring longest common subsequences, in: Proc. ParCo05, vol. 33 of NIC Series, pp. 827-834, (John von Neumann Institute for Computing, 2005).
14. A. Tiskin, All semi-local longest common subsequences in subquadratic time, Journal of Discrete Algorithms, (2008, in press).
15. L. G. Valiant, A bridging model for parallel computation, Comm. ACM, 33, 103-111, (1990).
16. R. A.Wagner and M. J. Fischer, The string-to-string correction problem, J. ACM, 21, 168-173, (1974).