A versatile divide and conquer technique for optimal string alignment

Information Processing Letters

Volumn 70, Issue 3, 1999, Pages 127-139

  Powell, David R ^a   Allison, Lloyd ^a   Dix, Trevor I ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Algorithms; Dynamic programming; Edit distance; Sequence alignment

Indexed keywords

ALGORITHMS; FUNCTIONS;

DYNAMIC PROGRAMMING ALGORITHMS (DPA); OPTIMAL STRING ALIGNMENT;

DYNAMIC PROGRAMMING;

EID: 0033121505     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00053-8     Document Type: Article

References (20)

1. L. Allison, A fast algorithm for the optimal alignment of three strings, J. Theoret. Biol. 164 (1993) 261-269.
2. L. Allison, Normalization of affine gap costs used in optimal sequence alignment, J. Theoret. Biol. 161 (1993) 263-269.
3. S. Altschul, B. Erickson, Optimal sequence alignments using affine gap costs, Bull. Math. Biol. 48 (1986) 606-616.
4. O. Gotoh, An improved algorithm for matching biological sequences, J. Molecular Biol. 162 (1982).
5. O. Gotoh, Alignment of three biological sequences with an efficient traceback procedure, J. Theoret. Biol. 121 (1986) 327-337.
6. O. Gotoh, Pattern matching of biological sequences with limited storage, CABIOS 3 (1987) 17-20.
7. J. Grice, R. Hughey, D. Speck, Reduced space sequence alignment, CABIOS 13 (1) (1997) 45-53.
8. D. Hirschberg, A linear space algorithm for computing maximal common subsequences, Comm. ACM 18 (6) (1975) 341-343.
9. D. Hirschberg, Serial computations of Levenshtein distances, in: A. Apostolico, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, 1997, pp. 123-141.
10. V.I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Phys. Dokl. 10 (8) (1966) 707-710.
11. W. Miller, E.W. Myers, Sequence comparison with concave weighting functions, Bull. Math. Biol. 50 (2) (1988) 97-120.
12. E.W. Myers, An O(nd) difference algorithm and its variations, Algorithmica 1 (1986) 251-266.
13. E.W. Myers, W. Miller, Optimal alignments in linear space, CABIOS 4 (1) (1988) 11-17.
14. S.B. Needleman, C.D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Molecular Biol. 48 (1970) 443-453.
15. P.H. Sellers, On the theory and computation of evolutionary distances, SIAM J. Appl. Math. 26 (4) (1974) 787-793.
16. P. Taylor, A fast homology program for aligning biological sequences, Nucleic Acids Res. 12 (1984) 447-455.
17. W.R. Taylor, C.A. Orengo, Protein structure alignment, J. Theoret. Biol. 208 (1989) 1-22.
18. E. Ukkonen, On approximate string matching, Found. Comput. Theory 158 (1983) 487-495.
19. K. Watanabe, Y. Urano, T. Tamaoki, Optimal alignments of biological sequences on a microcomputer, CABIOS 1 (1985) 83-87.
20. C.N. Yee, L. Allison, Fast string alignment with linear indel costs, Technical Report 92/165, Monash University, Department of Computer Science, Clayton, Vic., Australia, 1992.