Issue No. 03 - July-September (2008 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.26
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue to make effective use of the rapidly growing stores of variation data now being gathered. In this paper, we present two integer linear programming (ILP) formulations to find the most parsimonious phylogenetic tree from a set of binary variation data. One method uses a flow-based formulation that can produce exponential numbers of variables and constraints in the worst case. The method has, however, proven extremely efficient in practice on datasets that are well beyond the reach of the available provably efficient methods, solving several large mtDNA and Y-chromosome instances within a few seconds and giving provably optimal results in times competitive with fast heuristics than cannot guarantee optimality. An alternative formulation establishes that the problem can be solved with a polynomial-sized ILP. We further present a web server developed based on the exponential-sized ILP that performs fast maximum parsimony inferences and serves as a front end to a database of precomputed phylogenies spanning the human genome.
Computational Biology, Algorithms, Integer Linear Programming, Steiner tree problem, Phylogenetic tree reconstruction, Maximum parsimony
R. Ravi, Guy E. Blelloch, Russell Schwartz, Srinath Sridhar, Fumei Lam, "Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. , pp. 323-331, July-September 2008, doi:10.1109/TCBB.2008.26