Near optimal multiple sequence alignments using a traveling salesman problem approach

We present a new method for the calculation of multiple sequence alignments (MSAs). The input to our problem are n protein sequences. We assume that the sequences are related with each other and that there exists some unknown evolutionary tree that corresponds to the MSA. One advantage of our method is that the scoring can be done with reference to this phylogenetic tree, even though the tree structure itself may remain unknown. Instead of computing an evolutionary tree, we only need to compute a circular tour of the tree which is determined via a traveling salesman problem (TSP) algorithm. Our algorithm can calculate a near optimal MSA and has a performance guarantee of n-1/n.opt (where opt is the optimal score of the MSA). The algorithm runs in O(k/sup 2/n/sup 2/) time, where k is the length of the longest input sequence. From there, we improve the alignment further. Experimental results are shown at the end.