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.
Waterman
M S
MS
Department of Mathematics, University of Southern California, Los Angeles 90089-1113.
D000465:Algorithms; D001483:Base Sequence; D004247:DNA / Q000737:chemistry* / Q000235:genetics; D008969:Molecular Sequence Data; D012689:Sequence Homology, Nucleic Acid
D004247:DNA