title: The tree alignment problem.
abstract: BACKGROUND
  The inference of homologies among DNA sequences, that is, positions in multiple genomes that share a common evolutionary origin, is a crucial, yet difficult task facing biologists. Its computational counterpart is known as the multiple sequence alignment problem. There are various criteria and methods available to perform multiple sequence alignments, and among these, the minimization of the overall cost of the alignment on a phylogenetic tree is known in combinatorial optimization as the Tree Alignment Problem. This problem typically occurs as a subproblem of the Generalized Tree Alignment Problem, which looks for the tree with the lowest alignment cost among all possible trees. This is equivalent to the Maximum Parsimony problem when the input sequences are not aligned, that is, when phylogeny and alignments are simultaneously inferred.
  
  
  RESULTS
  For large data sets, a popular heuristic is Direct Optimization (DO). DO provides a good tradeoff between speed, scalability, and competitive scores, and is implemented in the computer program POY. All other (competitive) algorithms have greater time complexities compared to DO. Here, we introduce and present experiments a new algorithm Affine-DO to accommodate the indel (alignment gap) models commonly used in phylogenetic analysis of molecular sequence data. Affine-DO has the same time complexity as DO, but is correctly suited for the affine gap edit distance. We demonstrate its performance with more than 330,000 experimental tests. These experiments show that the solutions of Affine-DO are close to the lower bound inferred from a linear programming solution. Moreover, iterating over a solution produced using Affine-DO shows little improvement.
  
  
  CONCLUSIONS
  Our results show that Affine-DO is likely producing near-optimal solutions, with approximations within 10% for sequences with small divergence, and within 30% for random sequences, for which Affine-DO produced the worst solutions. The Affine-DO algorithm has the necessary scalability and optimality to be a significant improvement in the real-world phylogenetic analysis of sequence data.
authors.affiliation: Division of Invertebrate Zoology, American Museum of Natural History, New York, NY 10024, USA.
authors.forename: Andrés
authors.initials: A
authors.lastname: Varón
authors.forename: Ward C
authors.initials: WC
authors.lastname: Wheeler
mesh_terms: D000465:Algorithms; D019143:Evolution, Molecular; D016678:Genome; D008969:Molecular Sequence Data; D010802:Phylogeny; D011382:Programming, Linear; D016415:Sequence Alignment / Q000379:methods* / Q000592:standards; D017422:Sequence Analysis, DNA / Q000379:methods* / Q000592:standards; D012984:Software