Online Lectures on Bioinformatics
|
Algorithms for the comparison of two sequencesReferences[DBH83] Dayhoff,M.O., Barker,W.C. and Hunt,L.T. (1983) Establishing Homologies in Protein Sequences. Methods Enzymol., 91, 524-545. [Got82] Gotoh, O. (1982) An Improved Algorithm for Matching Biological Sequences. J. Mol. Biol., 162, 705-708. [Kru83] Kruskal, J.B. (1983) An overview of sequence comparison. In: [SaK83], 1-44. [NeW70] Needleman, S.B. and Wunsch, Ch.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443-453. [San72] Sankoff, D. (1972) Matching Sequences under Deletion/Insertion Constraints. Proc. Natl. Acad. Sci. USA, 69, 4-6. [Sel74] Sellers, P.H. (1974) On the Theory and Computation of Evolutionary Distances. SIAM J. Appl. Math. 26, 787-793. [SmW81] Smith, T.F. and Waterman, M.S. (1981) Comparison of Biosequences. Adv. appl. Math., 2, 482-489. [Ula72] Ulam, S.: Some combinatorial problems studied experimentally on computing machines. In: Applications of number theory to numerical analysis, ed. Zaremba, S.K.. Academic Press, New York and London, 1972. [Wat84a] Waterman, M.S. (1984) Efficient Sequence Alignment Algorithms. J. theor. Biol., 108, 333-337. [Wat84b] Waterman, M.S. (1984) General methods of sequence comparison. Bull. Math. Biol. 46, 473-500. [WSB76] Waterman, M.S., Smith, T.F. and Beyer, W.A. (1976) Some biological sequence metrics. Advances in Mathematics, 20, 367-387. Comments are very welcome. luz@molgen.mpg.de |