Progressive multiple sequence alignments from triplets

Background: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step cannot be removed at later aggregation steps. Adjacent insertions and deletions necessarily appear in arbitrary order in pairwise alignments and hence form an unavoidable source of errors. Research: Here we present a modified variant of progressive sequence alignments that addresses both issues. Instead of pairwise alignments we use exact dynamic programming to align sequence or profile triples. This avoids a large fractions of the ambiguities arising in pairwise alignments. In the subsequent aggregation steps we follow the logic of the Neighbor- Net algorithm, which constructs a phylogenetic network by step- wisely replacing triples by pairs instead of combining pairs to singletons. To this end the three- way alignments are subdivided into two partial alignments, at which stage all- gap columns are naturally removed. This alleviates the '' once a gap, always a gap '' problem of progressive alignment procedures. Conclusion: The three- way Neighbor- Net based alignment program aln3nn is shown to compare favorably on both protein sequences and nucleic acids sequences to other progressive alignment tools. In the latter case one easily can include scoring terms that consider secondary structure features. Overall, the quality of resulting alignments in general exceeds that of clustalw or other multiple alignments tools even though our software does not included heuristics for context dependent ( mis) match scores.