previous section previous page next page next section
CMB

Online Lectures on Bioinformatics

navigation


Suboptimal Alignments


References


[BoM84] Boswell, D.R. and McLachlan, A.D. (1984) Sequence comparison by exponentially-damped alignment. Nucl. Acids Res., 12, 457-464.

[ByW84] Byers, Th.H. and Waterman, M.S. (1984) Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. Operations Research, 32, 1381-1384.

[DBH83] Dayhoff,M.O., Barker,W.C. and Hunt,L.T. (1983) Establishing Homologies in Protein Sequences. Methods Enzymol., 91, 524-545.

[RVA89] Rechid, R., Vingron, M. and Argos, P. (1989) A new interactive protein sequence alignment program and comparison of its results with widely used algorithms. Computer Applications in the Biosciences (CABIOS), 5, 107-113.

[Sel79] Sellers, P.H. (1979) Pattern recognition in genetic sequences. Proc. Natl. Acad. Sci. USA, 76, 3041.

[Sel80] Sellers, P.H. (1980) The Theory and Computation of Evolutionary Distances: Pattern Recognition. J. of Algorithms, 1, 359-373.

[ViA90] Vingron, M. and Argos, P. (1990) Determination of reliable regions in protein sequence alignments. Protein Engineering, 3, 565-569.

[Wat83] Waterman, M.S. (1983) Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. Proc. Natl. Acad. Sci. USA, 80, 3123-3124.


Comments are very welcome.
luz@molgen.mpg.de