Progressive multiple alignment using sequence triplet optimizations and three-residue exchange costs.
In this paper we demonstrate a practical approach to construct progressive multiple alignments using sequence triplet optimizations rather than a conventional pairwise approach. Using the sequence triplet alignments progressively provides a scope for the synthesis of a three-residue exchange amino acid substitution matrix. We develop such a 20 x 20 x 20 matrix for the first time and demonstrate how its use in optimal sequence triplet alignments increases the sensitivity of building multiple alignments. Various comparisons were made between alignments generated using the progressive triplet methods and the conventional progressive pairwise procedure. The assessment of these data reveal that, in general, the triplet based approaches generate more accurate sequence alignments than the traditional pairwise based procedures, especially between more divergent sets of sequences.
Konagurthu
Arun Siddharth
AS
Department of Computer Science and Software Engineering, The University of Melbourne, Parkville Campus, Melbourne, Victoria 3010, Australia. arun@cs.mu.oz.au
Whisstock
James
J
Stuckey
Peter J
PJ
D000465:Algorithms; D000595:Amino Acid Sequence; D000596:Amino Acids / Q000032:analysis / Q000737:chemistry; D008956:Models, Chemical; D008958:Models, Molecular; D015233:Models, Statistical; D008969:Molecular Sequence Data; D011487:Protein Conformation; D011506:Proteins / Q000032:analysis / Q000737:chemistry* / Q000145:classification*; D016415:Sequence Alignment / Q000379:methods*; D020539:Sequence Analysis, Protein / Q000379:methods*
D000596:Amino Acids; D011506:Proteins