Computing steiner minimum trees in Hamming metric

Computing Steiner minimum trees in Hamming metric is a well studied problem that has applications in several fields of science such as computational linguistics and computational biology. Among all methods for finding such trees, algorithms using variations of a branch and bound method developed by Penny and Hendy have been the fastest for more than 20 years. In this paper we describe a new pruning approach that is superior to previous methods and its implementation.

[1]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[2]  Edward C Holmes,et al.  Phylogenetic analysis reveals a low rate of homologous recombination in negative-sense RNA viruses. , 2003, The Journal of general virology.

[3]  O. Gascuel,et al.  Quartet-based phylogenetic inference: improvements and limits. , 2001, Molecular biology and evolution.

[4]  M. P. Cummings,et al.  PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .

[5]  Stefan Hougardy,et al.  A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..

[6]  D Penny,et al.  The MinMax Squeeze: guaranteeing a minimal tree for population data. , 2004, Molecular biology and evolution.

[7]  Sudhir Kumar,et al.  MEGA3: Integrated software for Molecular Evolutionary Genetics Analysis and sequence alignment , 2004, Briefings Bioinform..

[8]  M. Nei,et al.  MEGA: Integrated software for molecular evolutionary genetics analysis and sequence alignment briefings in bioinformatics. , 2004 .

[9]  Tobias Polzin,et al.  Algorithms for the Steiner problem in networks , 2003 .

[10]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[11]  A. Oskooi.  Molecular Evolution and Phylogenetics , 2008 .

[12]  Andrew Rambaut,et al.  Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees , 1997, Comput. Appl. Biosci..

[13]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[14]  D. Swofford.  PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10 , 2002 .

[15]  Mike Steel,et al.  Should phylogenetic models be trying to "fit an elephant"? , 2005, Trends in genetics : TIG.

[16]  D. Penny,et al.  Branch and bound algorithms to determine minimal evolutionary trees , 1982 .

[17]  David M. Warme,et al.  Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[18]  Paul Walton Purdom,et al.  Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees , 2000, Bioinform..