String Processing and Information Retrieval, International Symposium on (1999)

Cancun, Mexico

Sept. 21, 1999 to Sept. 24, 1999

ISBN: 0-7695-0268-7

pp: 105

Chantal Korostensky , Swiss Federal Institute of Technology

Gaston Gonnet , Swiss Federal Institute of Technology

ABSTRACT

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 Sales-man Problem (TSP) algorithm. Our algorithm can calculate a near optimal MSA and has a performance guarantee of \mathopt (where opt is the optimal score of the MSA). The algorithm runs in \mathtime, where k is the length of the longest input sequence. From there we improve the alignment further. Experimental results are shown at the end.

INDEX TERMS

CITATION

C. Korostensky and G. Gonnet, "Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach,"

*String Processing and Information Retrieval, International Symposium on(SPIRE)*, Cancun, Mexico, 1999, pp. 105.

doi:10.1109/SPIRE.1999.796584

CITATIONS