Sequence alignment and penalty choice. Review of concepts, case studies and implications.
Alignment algorithms to compare DNA or amino acid sequences are widely used tools in molecular biology. The algorithms depend on the setting of various parameters, most notably gap penalties. The effect that such parameters have on the resulting alignments is still poorly understood. This paper begins by reviewing two recent advances in algorithms and probability that enable us to take a new approach to this question. The first tool we introduce is a newly developed method to delineate efficiently all optimal alignments arising under all choices of parameters. The second tool comprises insights into the statistical behavior of optimal alignment scores. From this we gain a better understanding of the dependence of alignments on parameters in general. We propose novel criteria to detect biologically good alignments and highlight some specific features about the interaction between similarity matrices and gap penalties. To illustrate our analysis we present a detailed study of the comparison of two immunoglobulin sequences.
Vingron
M
M
Department of Mathematics, University of Southern California, Los Angeles 90089-1113.
Waterman
M S
MS
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D001483:Base Sequence; D004247:DNA / Q000737:chemistry*; D006801:Humans; D007143:Immunoglobulin Heavy Chains / Q000737:chemistry; D007147:Immunoglobulin Light Chains / Q000737:chemistry; D007135:Immunoglobulin Variable Region / Q000737:chemistry; D008433:Mathematics; D008967:Molecular Biology / Q000379:methods*; D008969:Molecular Sequence Data; D011506:Proteins / Q000737:chemistry*; D013223:Statistics as Topic
D007143:Immunoglobulin Heavy Chains; D007147:Immunoglobulin Light Chains; D007135:Immunoglobulin Variable Region; D011506:Proteins; D004247:DNA