Sequence alignment in molecular biology

Journal of Computational Biology

Volumn 5, Issue 2, 1998, Pages 173-196

  Apostolico, Alberto ^a,b   Giancarlo, Raffaele ^c  

^a Purdue University ^*  (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF PALERMO   (Italy)

Author keywords

Computational molecular biology; Design and analysis of algorithms; Dynamic programming; Edit distances; Evolutionary tree; Philogeny; Sequence alignment; Sequence data banks

Indexed keywords

ALGORITHM; CALCULATION; DATA BASE; DNA SEQUENCE; EVOLUTION; GENE SEQUENCE; MATHEMATICAL ANALYSIS; MOLECULAR BIOLOGY; PHYLOGENY; PRIORITY JOURNAL; REVIEW; RNA SEQUENCE;

EID: 0031903739     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.173     Document Type: Review

References (158)

1. Ahuja, R., and Magnanti, T., and Orlin, J. 1993. Network Flows: Theory, Algorithms and Applications, Prentice Hall.
2. Altschul, S.F. 1991. Amino acid substitution matrices from an information theoretic perspective. J. Mol. Bio., 219:555-565.
3. Altschul, S.F. 1993. A protein alignment scoring system sensitive to all evolutionary distances. J. Mol. Evol., 36:290-300.
4. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., and Lipman, D.J. 1990. Basic local alignment search tool. J. Mol. Bio., 215:403-410.
5. Altschul, S.F., and Lipman, D.J. 1989. Trees, stars, and multiple biological sequence alignment. SIAM J. Appl. Math, 49(1):197-209.
6. Apostolico, A., Atallah, M.J., and Hambrusch, S. 1992. New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics, 37:1-24.
7. Apostolico, A., Atallah, M.J., Larmore, L.L., and McFaddin, S. 1990. Efficient parallel algorithms for string editing and related problems. Siam J. on Computing, 19:968-988.
8. Apostolico, A., Browne, S., and Guerra, C. 1992. Fast linear space computations of longest common subsequences. Theoretical Computer Science, 92:3-17.
9. Apostolico, A., and Guerra, C. 1985. A fast linear space algorithm for computing longest common subsequences. In Proceedings of the 23rd Allerton Conference, Monticello, Ill.
10. Apostolico, A., and Guerra, C. 1987. The longest common subsequence problem revisited. Algorithmica, 2:315-336.
11. Apostolico, A., and Preparata, F.P. 1983. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297-315.
12. Argos, P., Vingron, M., and Vogt, G. 1991. Protein sequence comparison: Methods and significance. Protein Engineering, 4:375-383.
13. Arratia, R., Gordon, L., and Waterman, M.S. 1986. An extreme value theory for sequence matching. Ann. Stat., 14:971-993.
14. Arratia, R., and Waterman, M.S. 1994. A phase transition for the score of matching random sequences allowing deletions. Ann. Appl. Prob. 4:200-225.
15. Arratia, R., and Waterman, M.S. 1989. The Erdos-Renyi strong law for pattern matching with a given proportion of mismatches. Ann. Prob., 17:1152-1169.
16. Bafna, V., Lancia, G., and Ravi, R. 1996. A polynomial-time approximation scheme for tree driven SP alignment problem. manuscript.
17. Bafna, V., Lawler, E., and Pevzner, P.A. 1994. Approximation algorithms for multiple sequence alignment. In M. Crochemore and D. Gusfield, editors, Proc. Combinatorial Pattern Matching 94 (Lecture Notes in Computer Science, Vol. 807), 43-53, Berlin, Springer-Verlag.
18. Bafna, V., and Pevzner, P. 1996. Genome rearrangments and sorting by reversals. Siam J. on Computing, 25(2):272-289.
19. Bafna, V., and Pevzner, P. 1993. Approximate methods for sequence alignment. manuscript.
20. Bafna, V., Pevzner, P. 1995. Sorting permutations by transpositions. In Proc. 6th Symposium on Discrete Algorithms, 614-621. ACM-SIAM.
21. Benson, G., and Waterman, M.S. 1994. A method for fast database searches for all k-nucleotide repeats. Nucleic Acids Research, 22:4828-4836.
22. Bodlaender, H.L., and Fellows, M.R., and Hallett, M.T. 1994. Beyond NP-completeness for problems of bounded width: Hardness for the w hierarchy (extended abstract). ACM Sympos. Theroy Comput., 26:449-458.
23. Carrillo, H., and Lipman, D. 1988. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48(5):1073-1082.
24. Carrol, L. 1879. A new puzzle. Vanity Fair.
25. Carpara, A. 1997. Sorting by Reversals is Difficult. RECOMB 97: Proceedings of the First Annual International Conference on Computational Molecular Biology, pages 75-83.
26. Chan, S.C., Wong, A.K.C., and Chui, D.K.Y. 1992. A survey of multiple sequence comparison methods. Bull. Math. Biol., 54:563-598.
27. Chao, K.M., Hardison, R.C., and Miller, W. 1993. Locating well-conserved regions within a pairwise alignment CABIOS, 4:387-396.
28. Chao, K.M. 1994. Computing all suboptimal alignments in linear space. In M. Crochemore and D. Gusfield, editors, Proc. Combinatorial Pattern Matching 94 (Lecture Notes in Computer Science, Vol. 807), 1-14, Berlin, Springer-Verlag.
29. Chvatal, V., and Sankoff, D. 1975. Longest common subsequence of two random sequences. J. of Appl. Probab., 12:306-315.
30. Collins, J.F., and Coulson, A.F.W. 1987. Molecular sequence comparison and alignment. In M.J. Bishop and C.J. Rawlings, editors, Nucleic Acid and Protein Sequence Analysis: A Practical Approach, 323-358. IRL Press, Oxford.
31. Crochemore, M., and Rytter, W. 1994. Text Algorithms. Oxford University Press.
32. Dayhoff, M.O., and Eck, R.V. 1968. Atlas of Protein Sequences and Structures. National Biomedical Res. Foundation.
33. Dayhoff, M.O., Schwartz, R.M., and Orcutt, B.C. 1978. A model of evolutionary change in proteins. In M.O. Dayhoff, editor, Atlas of Protein Sequence and Structure, 345-352. Nat. Biomed. Res. Found., 5, supp. 3.
34. Dobzhanski, T., and Sturtvant, A.H. 1938. Inversions in the chromosomes of drosophila pseudoscura. Genetics, 23:28-64.
35. Doolittle, R.F. 1981. Similar amino acid sequences: Chance or common ancestry? Science, 214:149-159.
36. Eisner, M., and Severance, D. 1976. Mathematical techniques for efficient record segmentation in large shared databases. J. of ACM, 23:619-635.
37. Feng, D., and Doolittle, R. 1987. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of Molecular Evolution, 25:351-360.
38. Feng, D.F., Johnson, M.S., and Doolittle, R.F. 1985. Aligning amino acid sequences: Comparison of commonly used methods. J. Mol. Evol., 21:112-125.
39. Fischetti, V., Landau, G., Schmidt, J., and Sellers, P. 1992. Identifying periodic occurrences of a template with applications to protein structure. In Third Annual Symposium, CPM 92, Tucson, Arizona, April 29-May 1, 1992. Proceedings. (Lecture Notes in Computer Science, Vol. 644), 111-120.
40. Fitch, W.M., and Margoliash, E. 1967. Construction of phylogenetic trees. Science, 155:279-284.
41. Fitch, W., and Smith, T.F. 1983. Optimal sequence alignment. Proc Nat Acad Sci USA, 80:1382-1386.
42. Gallager, R.G. 1968. Information Theory and Reliable Communication, John Wiley and Sons.
43. Gatlin, L.L. 1966. The information content of DNA. J. Theor. Biol., 10:281-300.
44. Giancarlo, R. 1997. Dynamic programming-special cases. In A. Apostolico and Z. Galil, editors, Pattern Matching Algorithms, Oxford University Press, NY, 201-236.
45. Goad, W.M. 1989. Sequence analysis- contributions by Ulam to molecular genetics. in: From Cardinals to Chaos. Reflections on the life and legacy of Stanislaw Ulam N.G. Cooper, editor, Cambridge University Press, 288-291.
46. Goldstein, L., and Waterman, M.S. 1994. Approximations to profile score distributions. J. Comp. Biol., 1:93-104.
47. Gotoh, O. 1982. An improved algorithm for matching of biological sequences. Journal of Molecular Biology, 162:705-708.
48. Griffin, A.M., and Boursnell, M.E.G. 1990. Analysis of the nucleotide sequence of DNA from the region of the thymidine kinage gene of infectious laryngotracheitis virus; potential evolutionary relationships between the herpes virus subfamilies. J. Gen. Virol., 71:841-850.
49. Grumbach, S., and Tahi, F. 1993. Compression of DNA sequences. Data Compression Conference, IEEE Computer Society Press, 340-350.
50. Gusfield, D. 1983. Parametric combinatorial computing and a problem of program module decomposition. J. of ACM, 30:551-563.
51. Gusfield, D. 1993. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55(1):141-154.
52. Gusfield, D., Balasubramanian, K., and Naor, D. 1994. Parametric optimization of sequence alignment. Algorithmica, 12:312-326.
53. Gusfield, D., and Stelling, P. 1996. Parametric and inverse-parametric sequence alignment with xparal. In R. Doolittle, editor, Methods in Enzymology vol. 266. Computer Methods for Macromolecular Sequence Analysis, pages 481-494. Academic Press.
54. Hamming, R.W. 1950. Error detecting and error correcting codes. Bell System Tech. J., 29:147-160.
55. Hannenhalli, S., and Pevzner, P. Towards a computational theory of genome rearrangement. In I. van Leeuwen, editor, Computer Science Today.
56. Hannenhalli, S., Chappey, C., Koonin, E., and Pevzner, P. 1994. Algorithms for genome rearrangements: Herpesvirus evolution as a test case. In 3rd Int. Conference on Bioinformatics and Complex Genome Analysis.
57. Hannenhalli, S., and Pevzner, P. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. 27th Symposium on Theory of Computing, 178-187. ACM.
58. Henikoff, S., and Henikoff, J. 1992. Amino acid substitution matrices from protein blocks. Proc. Nat. Acad. of Sci., USA, 89:10915-10919.
59. Henikoff, S., and Henikoff, J. 1993. Performance evaluation of amino acid substitution matrices. Proteins: Structure, Function and Genetics, 17:49-61.
60. Hirschberg, D.S. 1997. Algorithms for the longest common subsequence problem. JACM, 24, 4:664-675.
61. Hirschberg, D.S. 1985. A linear space algorithm for computing maximal common subsequences. CACM, 18/6:341-343.
62. Hsu, W.J., and Du, M.W. 1984. Computing a longest common subsequence for a set of strings. BIT, 24:45-59.
63. Hunt, J.W., and Szymanski, T.G. 1977. A fast algorithm for computing longest common subsequences. CACM, 20,5:350-353.
64. Irving, R.W., and Fraser, C.B. 1992. Two algorithms for the longest common subsequence of three (or more) strings. In Third Annual Symposium, CPM 92, Tucson, Arizona, April 29-May 1, 1992. Proceedings. (Lecture Notes in Computer Science, Vol. 644), 214-229.
65. Itoga, S.J. 1981. The string merging problem. BIT, 21:20-30.
66. Jacobson, G., and Vo, K.P. 1992. Heaviest increasing/common subsequence problems. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 92 (Lecture Notes in Computer Science, Vol. 644), 52-66, Berlin. Springer-Verlag.
67. Jiang, T., Lawler, E.L., and Wang, L. 1994. Aligning sequences via an evolutionary tree: Complexity and approximation. ACM Sympos. Theory Comput., 26:760-760.
68. Jiang, T., and Li, M. 1993. Optimization problems in molecular biology. In D.Z. Du and J. Sun, editors, Advances in Optimization and Approximation.
69. Johnson, D.S., Lenstra, J.K., and Rinnooy Kan, A.H.E. 1978. The complexity of the Network Design Problem. Networks, 8:279-285.
70. Kanehisa, M.I., and Goad, W.B. 1982. Pattern recognition in nucleic acid sequences I: A general method for finding local homologies and simmetries. Nucl. Acid Res., 10:247-264.
71. Kannan, S.K., and Myers, E.W. 1993. An algorithm for locating non-overlapping regions of maximum alignment score. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 93 (Lecture Notes in Computer Science, Vol. 684), 74-86, Berlin, Springer-Verlag.
72. Kaplan, H., and Shamir, R., and Tarjan, R.E. 1997. Faster and Simpler Algorithm for Sorting Permutatios by Reversals. RECOMB 97: Proceedings of the First Annual International Conference on Computational Molecular Biology, 163.
73. Karlin, S., and Altschul, S.F. 1990. Methods for assessing the statistical significance of molecular sequence features by using general scoring systems. In Proc. Nat. Acad. of Sci., U.S.A., volume 87, 2264-2268.
74. Karlin, S., Dembo, A., and Kawabata, T. 1990. Statistical significance of high scoring segments from molecular sequences. Ann. Stat. 18:571-581.
75. Karlin, S., Glandour, G., Ost, F., Tavare, S., and Korn, L.J. 1983. New approaches for computer analysis of nucleic acid sequences. Proc Nat Acad Sci USA, 80:5660-5664.
76. Karlin, S., Mocarski, E.S., and Schachtel, G.A. 1994. Molecular evolution of herpesviruses: genomic and protein sequence comparison. J. Virol., 68:1886-1902.
77. Karlin, S., and Ost, F. 1988. Maximum length of common words among random letter sequences. Ann. Prob., 16:535-563.
78. Edmonds, J., and Karp, R.M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. of ACM, 19:248-264.
79. Kececioglu, J. 1993. The maximum weight trace problem in multiple sequence alignment. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 93 (Lecture Notes in Computer Science, Vol. 684), 106-119, Berlin, Springer-Verlag.
80. Kececioglu, J., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 94 (Lecture Notes in Computer Science, Vol. 807), 307-325, Berlin, Springer-Verlag.
81. Kececioglu, J., and Sankoff, D. 1995. Exact and approximation algorithms for sorting by reversal. Algorithmica, 13(1/2): 180-210.
82. Kececioglu, J.D., and Ravi, R., Of Mice and Men: Algorithms for evolutionary distances between genomes with translocation. In Proc. 6th Symposium on Discrete Algorithms, 604-613. ACM-SIAM.
83. Kolmogorov, A.N. 1965. Three approaches to the quantitative definition of information. Problemi Pederachi Inf., 1.
84. Landau, G.M. 1995. Myers, G., and Schmidt, J.P. Incremental string comparison. manuscript.
85. Landau, G.M., and Schmidt, J.P. 1993. An algorithm for locating tandem repeats. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 93 (Lecture Notes in Computer Science, Vol. 684), 120-133, Berlin, Springer-Verlag.
86. Lander, E., Mesirov, J.P., and Taylor, W. 1989. Study of protein sequence comparison metrics on the Connection Machine CM-2. J. Supercomputing, 3:255-269.
87. Lawler, E.L. 1976. Combinatorial Optimization, Networks and Matroids. Holt, Rinehart and Winston.
88. Lempel, A., and Ziv, J. 1976. On the complexity of finite sequences. IEEE Trans. on Information Theory, 22:75-81.
89. Lesk, A.M., Levitt, M., and Chothia, C. 1986. Alignment of amino acid sequences of distantly related proteins using variable gap penalties. Protein Engineering, 1:77-78.
90. Levenshtein, V.I. 1966. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl., 6:707-710.
91. Lipman, D.J., Altschul, S.F., and Kececioglu, J.D. 1989. A tool for multiple sequence alignment. Proc. Nat. Acad. Sci. (USA), 86:4412-4415.
92. Lipman, D.J., and Pearson, W.L. 1985. Rapid and sensitive protein similarity searches. Science, 2:1435-1441.
93. Maier, D. 1978. The complexity of some problems on subsequences and supersequences. J. Assoc. Comput. Mach., 25(2):322-336.
94. Martin-Löf, P. 1966. The definition of random sequences. Information and Control, 9.
95. McLachlan, A.D. 1971. Tests for comparing related amino acid sequences, cytochrome c and cytochrome c551. J. Mol. Biol., 61:409-424.
96. Meggiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res., 4:414-424.
97. Mevissen, H.T., and Vingron, M. 1997. Quantifying the local reliability of a sequence alignment. Protein Engin., 9:127-132.
98. Miller, W. 1992. An algorithm for locating a repeated region. manuscript.
99. Milosavljevic, A., and Jurka, J. 1993. Discovering simple DNA sequences by the algorithmic significance method. CABIOS, 9:407-411.
100. Myers, E.W. 1986. Incremental alignment algorithms and their applications. Technical Report, U. Az.:1-23.
101. Myers, E.W. 1986. An O(ND) difference algorithm and its variations. Algorithmica, 1:251-266.
102. Myers, E.W., and Miller, W. 1988. Optimal alignment in linear space. Comput. Appl. Biosci., 4:11-17.
103. Kambayashi, Y., Nakatsu, N., and Yajima, S. 1982. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18:171-179.
104. Naor, D., and Brutlag, D. 1993. On suboptimal alignments of biological sequences. In Fourth Annual Symposium, CPM 93, Padova, Italy. Proceedings. (Lecture Notes in Computer Science, Vol. 684), 179-196.
105. Needleman, S.B., and Wunsch, C.D. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48:433-443.
106. Palmer, J., and Herbon, L. 1988. Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Mol. Evol., 27:87-97.
107. Pascarella, S., and Argos, P. 1992. Analysis of insertion/deletion in proteins. J. Mol. Biol., 224:461-471.
108. Pearson, W.L. 1991. Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics, 11:635-650.
109. Pearson, W.L., and Lipman, W.R. 1988. Improved tools for biological sequence comparison. Proc. Nat. Acad. Sci., USA, 85:2444-2448.
110. Pevzner, P. 1992. Multiple alignment, communication cost, and graph matching. Siam J. on Applied Math., 52:1763-1779.
111. Pevzner, P., and Vingron, M. 1995. Multiple sequence comparison and consistency on multipartite graphs. Adv. Appl. Math., 16:1-22.
112. Popper, K.R. 1959. The Logic of Scientific Discovery. Hutchinson, London.
113. Mohana Rao, J.K. 1987. New scoring matrix for amino acid residue exchanges based on residue characteristic physical parameters. Int. J. Pept. Protein Res., 29:276-281.
114. Risler, J.L., Delorme, M.O., Delacroix, H., and Henaut, A. 1988. Amino acid substitutions in structurally related proteins: A pattern recognition approach. Determination of a new and efficient scoring matrix. J. Mol. Biol., 204:1019-1029.
115. Rivals, E., Delgrande, O., Delahaye, J.-P., and Dauchet, M. 1995. A first step towards chromosome analysis by compression algorithms. In N.G. Bourbakis, editor, First International IEEE Symposium on Intelligence in Neural and Biological Systems (IEEE Computer Society Press), 233-239.
116. Sankoff, D. 1972. Matching sequences under deletion/insertion constraints. In Proc. Nat. Acad. of Sci., U.S.A., vol. 69, 4-6.
117. Sankoff, D. 1975. Minimal mutation trees of sequences. SIAM J. Appl. Math., 28(1):35-42.
118. Sankoff, D. 1992. Edit distance for genome comparison based on non-local operations. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. Combinatorial Pattern Matching 92 (Lecture Notes in Computer Science, Vol. 644), 121-135, Berlin, Springer-Verlag.
119. Sankoff, D. 1996. The early introduction of dynamic programming into Computational Biology. manuscript.
120. Sankoff, D., and Kruskal, J.B., editors. 1983. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA, U.S.A.
121. Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., and Cedergren, R. 1992. Gene order comparison for phylogenetic inference: evolution of the mitochondrial genome. Proc. Nat. Acad. Sci., USA, 89:6575-6579.
122. Schmidt, J.P. 1995. All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings. In Proc. Third Israel Symposium on Theory of Computing and Systems, 67-77, New York, IEEE Computer Society Press.
123. Schuler, G.D., Altschul, S.F., and Lipman, D.J. 1992. A workbench for multiple sequence alignment. In Protein: Structure, Function and Genetics.
124. Sellers, P.H. 1974. On the theory and computation of evolutionary distance. SIAM J. Appl. Math., 26:787-793.
125. Sellers, P.H. 1980. The theory and computation of evolutionary distances: Pattern recognition. J. of Alg., 1:359-373.
126. Sellers, P.H. 1984. Pattern recognition in genetic sequences by mismatch density. Bull. Math. Biol., 46:501-514.
127. Smith, R.F. and Smith, T.F. 1990. Automatic generation of primary sequence patterns from set of related protein sequences. Proc. Nat. Acad. of Sci., USA, 87:118-122.
128. Smith, T., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol., 147:195-197.
129. Smith, T., Waterman, M.S., and Burks. 1985. The statistical distribution of nucleic acid similarities. Nucleic Acid Research, 13:645-656.
130. States, D.J., Gish, W., and Altschul, S.F. 1991. Improved sensitivity of nucleic acid databases searches using application specific scoring matrices. METHODS: A companion to Method. in Enzim., 3:66-70.
131. Storer, J. 1988. Data Compression: Methods and Theory. Computer Science Press, Rockville, MD.
132. Taylor, W.R. 1986. The classification of amino acid conservation. J. of Theor. Biol., 119:205-218.
133. Timkovskii, V.G. 1990. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25(5):565-580.
134. Ulam, S.M. 1972a. Some combinatorial problems studied experimentally on computing machines. in: Applications of Number Theory to Numerical Analysis S.K. Zaremba, editor, Academic Press, 1-10.
135. Ulam, S.M. 1972b. Some ideas and prospects in biomathematics. Annual Review of Biophysics and Bioengineering, 1:277-291.
136. Vingron, M., and Argos, P. 1990. Determination of reliable regions in protein sequence alignment. Protein Engin., 7:565-569.
137. Vingron, M., and Argos, P. 1991. Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol., 218:33-43.
138. von Mises, R. 1939. Probability, Statistics and Truth. MacMillan, New York.
139. Wagner, R.A., Fischer, M.J. 1974. The string to string correction problem. J. Assoc. Comput. Mach., 21:168-173.
140. Wang, L., and Gusfield, D. 1996. Improved approximation algorithms for tree alignment. In D. Hirschberg and G. Myers, editors, Proc. Combinatorial Pattern Matching 96 (Lecture Notes in Computer Science), Berlin, Springer-Verlag.
141. Wang, L., and Jiang, T. 1994. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1:337-348.
142. Watanabe, S. 1969. Knowing and Guessing. Wiley, New York.
143. Waterman, M.S. 1994. Parametric and ensemble sequence alignment. Bull. Math. Biol., 56:743-767.
144. Waterman, M.S. 1995. Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman Hall.
145. Waterman, M.S., and Byers, T.H. 1985. A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Math. Biosci., 77:179-188.
146. Waterman, M.S., and Eggert, M. 1987. A new algorithm for best subsequence alignments with applications to tRNA-rRNA comparisons. J. Mol. Biol., 197:723-728.
147. Waterman, M.S., Eggert, M., and Lander, E. 1992. Parametric sequence comparisons. Proceedings of the National Academy of Sciences of the USA, 89:6090-6093.
148. Waterman, M.S. 1989. Sequence alignments. In M.S. Waterman, editor, Mathematical Analysis of DNA Sequences, 53-92. CRC.
149. Waterman, M.S. 1994. Estimating of statistical significance of sequence alignments. Phil. Trans. R. Soc. London (B), 344:383-390.
150. Waterman, M.S., Gordan, L., and Arratia, R. 1987. Phase transition in sequence matches and nucleic acid structure. Proc. Natl. Acad. Sci., USA, 84:1239-1243.
151. Waterman, M.S., and Vingron, M. 1994. Sequence comparison significance and Poisson approximation. Statistical Sciences, 9:367-381.
152. Vingron, M., and Waterman, M.S. 1994. Sequence Alignment and Penalty Choice. Review of Concepts, Case Studies and Implications J. Mol. Biol., 235:1-12.
153. Watterson, G.A., Ewens, W.J., Hall, T.E., and Morgan, A. 1982. The chromosome inversion problem. J. of Theor. Biol., 99:1-7.
154. Wilbur, W. J., and Lipman, D.J. 1984. The context dependent comparison of biological sequences. SIAM J. Appl. Math., 44:557-567.
155. Wilbur, W.J., and Lipman, D.J. 1983. Rapid similarity searches of nucleic acid and protein data banks. In Proc. Nat. Acad. Sci. USA 80, 726-730.
156. Zimmer, R., and Lengauer, T. 1997. Fast and Numerically Stable Parametric Alignment of Biosequences. RECOMB 97: Proceedings of the First Annual International Conference on Computational Molecular Biology, 344-353.
157. Ziv, J., and Lempel, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. on Information Theory, 23:337-343.
158. Zuker, M. 1991. Suboptimal sequence alignment in Molecular Biology, alignment with error analysis. J. Mol. Biol., 221:403-420.