Parametric and ensemble sequence alignment algorithms.

Recently algorithms for parametric alignment (Waterman et al., 1992, Natl Acad. Sci. USA 89, 6090-6093; Gusfield et al., 1992, Proceedings of the Third Annual ACM-SIAM Discrete Algorithms) find optimal scores for all penalty parameters, both for global and local sequence alignment. This paper reviews those techniques. Then in the main part of this paper dynamic programming methods are used to compute ensemble alignment, finding all alignment scores for all parameters. Both global and local ensemble alignments are studied, and parametric alignment is used to compute near optimal ensemble alignments.

[1]  T G Marr,et al.  Alignment of molecular sequences seen as random path analysis. , 1995, Journal of theoretical biology.

[2]  P. Argos,et al.  Determination of reliable regions in protein sequence alignments. , 1990, Protein engineering.

[3]  A V Finkelstein,et al.  Computation of biopolymers: a general approach to different problems. , 1993, Bio Systems.

[4]  Michael S. Waterman,et al.  COMPUTATION OF GENERATING FUNCTIONS FOR BIOLOGICAL MOLECULES , 1980 .

[5]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[6]  Robert M. Miura,et al.  Some mathematical questions in biology : DNA sequence analysis , 1986 .

[7]  J. McCaskill.  The equilibrium partition function and base pair binding probabilities for RNA secondary structure , 1990, Biopolymers.

[8]  E. Lander,et al.  Parametric sequence comparisons. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[9]  M S Waterman,et al.  Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. , 1983, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Michael S. Waterman,et al.  General methods of sequence comparison , 1984 .

[11]  M S Waterman,et al.  Rapid and accurate estimates of statistical significance for sequence data base searches. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Dalit Naor,et al.  On Suboptimal Alignments of Biological Sequences , 1993, CPM.

[13]  David Fernández-Baca,et al.  Constructing the minimization diagram of a two-parameter problem , 1991, Oper. Res. Lett..

[14]  Michael S. Waterman,et al.  Technical Note - Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming , 1984, Oper. Res..