The early introduction of dynamic programming into computational biology

Bioinformatics

Volumn 16, Issue 1, 2000, Pages 41-47

  Sankoff, David ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; BIOLOGY; COMPUTER PROGRAM; NUCLEOTIDE SEQUENCE; PHYLOGENY; PRIORITY JOURNAL; REVIEW; SEQUENCE HOMOLOGY;

EID: 0034114220     PISSN: 13674803     EISSN: None     Source Type: Journal    
DOI: 10.1093/bioinformatics/16.1.41     Document Type: Review

References (43)

1. Apostolico, A. and Giancarlo, R. (1998) Sequence alignment in molecular biology. J. Comput. Biol., 5, 173-196.
2. Chvátal, V. and Sankoff, D. (1975) Longest common subsequences of two random sequences. J. Appl. Probability, 12, 306-315.
3. Chvátal, V., Klarner, D.A. and Knuth, D.E. (1972) Selected combinatorial research problems. Stanford University Computer Science Technical Report. 26, pp. 72-292.
4. Dayhoff, M.O. (1969) Computer analysis of protein evolution. Sci. Am., 221, 86-95.
5. Farris, J.S. (1970) Methods for computing Wagner trees. Syst. Zool., 19, 83-92.
6. Feigenbaum, M. (1982) Reflections of the Polish masters - an interview with Stanislaw Ulam and Mark Kac. Los Alamos Science, 3, 54-65.
7. Ferretti, V. and Sankoff, D. (1989) A continuous analog for RNA folding. Bull. Math. Biol., 51, 167-171.
8. Fitch, W.M. (1971) Towards defining the course of evolution: minimum change for a specific tree topology. Syst. Zool., 20, 406-416.
9. Goad, W. (1989) Sequence analysis - contributions by Ulam to molecular genetics. In Cooper, N.G. (ed.), From Cardinals to Chaos. Reflections on the Life and Legacy of Stanislaw Ulam Cambridge University Press, Cambridge, pp. 288-291.
10. Graham, R.L. (1989) A similarity measure for graphs - reflections on a theme of Ulam. In Cooper, N.G. (ed.), From Cardinals to Chaos. Reflections on the Life and Legacy of Stanislaw Ulam Cambridge University Press, Cambridge, pp. 114-121.
11. Griggs, J.R. (1977) Symmetric chain orders, Sperner theorems, and loop matchings, PhD thesis, Massachusetts Institute of Technology.
12. Hartigan, J.A. (1973) Minimal mutation fits to a given tree. Biometrics, 29, 53-65.
13. Kruskal, J.B. (1983) An overview of sequence comparison. In Sankoff, D. and Kruskal, J.B. (eds), Time Warps, String Edits and Macromolecules. The Theory and Practice of Sequence Comparison Addison-Wesley, Reading, Massachusetts, pp. 1-33.
14. Levenshtein, V.I. (1965) Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk USSR, 163, 845-848 (Russian); English Translation: (1966). Cybernetics and Control Theory, 10, 707-710.
15. Levenshtein, V.I. (1965) Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk USSR, 163, 845-848 (Russian); English Translation: (1966). Cybernetics and Control Theory, 10, 707-710.
16. Needleman, S.B. and Wunsch, C.D. (1970) A special method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
17. Nussinov, R., Pieczenik, G., Griggs, J.R. and Kleitman, D.J. (1978) Algorithms for loop matchings. SIAM J. Appl. Math., 35, 68-82.
18. Pipas, J.M. and McMahon, J.E. (1975) Method for predicting RNA secondary structure. Proc. Natl. Acad. ad. Sci. USA, 72, 2017-2021.
19. Rota, G.-C. (1989) The lost café. In Cooper, N.G. (ed.), From Cardinals to Chaos. Reflections on the Life and Legacy of Stanislaw Ulam Cambridge University Press, Cambridge, pp. 23-32.
20. Sankoff, D. (1972) Matching sequences under deletion/insertion constraints. Proc. Natl. Acad. Sci. USA, 69, 4-6.
21. Sankoff, D. (1975) Minimal mutation trees of sequences. SIAM J. Appl. Math., 28, 35-42.
22. Sankoff, D. (1985) Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM J. Appl. Math., 45, 810-825.
23. Sankoff, D. and Kruskal, J.B. (eds) (1983) Time Warps, String Edits and Macromolecules. The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA. Reprinted CSLI publications and CUP, 1999.
24. Sankoff, D. and Rousseau, P. (1975) Locating the vertices of a Steiner tree in an arbitrary metric space. Math. Programming, 9, 240-246.
25. Sankoff, D. and Sellers, P.H. (1973) Shortcuts, diversions and maximal chains in partially ordered sets. Discrete Math., 4, 287-293.
26. Sankoff, D., Morel, C. and Cedergren, R.J. (1973) Evolution of 5S RNA and the non-randomness of base replacement. Nature New Biol., 245, 232-234.
27. Sankoff, D., Morin, A.-M. and Cedergren, R.J. (1978) The evolution of 5S RNA secondary structures. Can. J. Biochem., 56, 440-443.
28. Sankoff, D., Cedergren, R.J., Kruskal, J.B. and Mainville, S. (1983) Fast algorithms to predict RNA secondary structures containing multiple loops. In Sankoff, D. and Kruskal, J.B. (eds), Time Warps, String Edits and Macromolecules. The Theory and Practice of Sequence Comparison Addison-Wesley, Reading, MA, pp. 93-120.
29. Sellers, P.H. (1974a) An algorithm for the distance between two finite sequences. J. Combin. Theory Ser. A, 16, 253-258.
30. Sellers, P.H. (1974b) On the theory and computation of evolutionary distance. SIAM J. Appl. Math., 26, 787-793.
31. Sellers, P.H. (1980) The theory and computation of evolutionary distances: pattern recognition. J. Algorithms, 1, 359-373.
32. Smith, T.F. and Waterman, M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
33. Tinoco, I., Borer, P.N., Dengler, B., Levine, M.D., Uhlenbeck, O.C., Crothers, D.M. and Gralla, J. (1973) Improved estimation of secondary structure in ribonucleic acids. Nature New Biol., 246, 40-41.
34. Ulam, S.M. (1972) Some combinatorial problems studied experimentally on computing machines. In Zaremba, S.K. (ed.), Applications of Number Theory to Numerical Analysis Academic Press, New York, pp. 1-10.
35. Vintsyuk, T.K. (1968) Speech discrimination by dynamic programming. Kybernetika, 4, 81-88. (Russian); English Translation. Cybernetics, 4, 52-57.
36. Vintsyuk, T.K. (1968) Speech discrimination by dynamic programming. Kybernetika, 4, 81-88. (Russian); English Translation. Cybernetics, 4, 52-57.
37. Wagner, R.A. and Fischer, M.J. (1974) The string-to-string correction problem. J. Assoc. Comput. Mach., 21, 168-173.
38. Waterman, M.S. (1978) Secondary structure of single-stranded nucleic acids. Studies in Foundations and Combinatorics, Adv. Math. Suppl., 1, 167-212.
39. Waterman, M.S. (1995) Introduction to Computational Biology. Chapman and Hall, London, p. xiv.
40. Waterman, M.S. and Smith, T.F. (1978) RNA secondary structure: a complete mathematical analysis. Math. Biosci., 42, 257-266.
41. Zaremba, S.K. (ed.) (1972) Applications of Number Theory to Numerical Analysis. Academic Press, New York.
42. Zuker, M. and Sankoff, D. (1984) RNA secondary structures and their prediction. Bull. Math. Biol., 46, 591-621.
43. Zuker, M. and Stiegler, P. (1981) Optimal folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res., 9, 133-148.