CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008 vol.5 Issue No.03 - July-September

Subscribe

Issue No.03 - July-September (2008 vol.5)

pp: 323-331

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.26

ABSTRACT

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.

INDEX TERMS

Computational Biology, Algorithms, Integer Linear Programming, Steiner tree problem, Phylogenetic tree reconstruction, Maximum parsimony

CITATION

Fumei Lam, Guy E. Blelloch, Srinath Sridhar, Russell Schwartz, "Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.5, no. 3, pp. 323-331, July-September 2008, doi:10.1109/TCBB.2008.26REFERENCES

- [1] M.R. Garey and D.S. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1979.- [2] Int'l HapMap Consortium, “The International HapMap Project,”
Nature, vol. 426, pp. 789-796, , 2005.- [5] K. Linblad-Toh, E. Winchester, M.J. Daly, D.G. Wang, J.N. Hirschhorn, J.P. Laviolette, K. Ardlie, D.E. Reich, E. Robinson, P. Sklar, N. Shah, D. Thomas, J.B. Fan, T. Gingeras, J. Warrington, N. Patil, T.J. Hudson, and E.S. Lander, “Large-Scale Discovery and Genotyping of Single-Nucleotide Polymorphisms in the Mouse,”
Nature Genetics, vol. 24, no. 4, pp. 381-386, 2000.- [8] R. Agarwala and D. Fernandez-Baca, “A Polynomial-Time Algorithm for the Perfect Phylogeny Problem When the Number of Character States Is Fixed,”
SIAM J. Computing, vol. 23, pp. 1216-1224, 1994.- [11] H.J. Bandelt, P. Forster, B.C. Sykes, and M.B. Richards, “Mitochondrial Portraits of Human Populations Using Median Networks,”
Genetics, vol. 141, pp. 743-753, 1989.- [12] J. Felsenstein, “PHYLIP (Phylogeny Inference Package) Version3.6,” distributed by the author, Dept. of Genome Sciences, Univ. of Washington, 2005.
- [13] N. Saitou and M. Nei, “The Neighbor-Joining Method: A New Method for Reconstructing Phylogenetic Trees,”
Molecular Biology and Evolution, vol. 4, no. 4, pp. 406-425, 1987.- [14] G.E. Blelloch, K. Dhamdhere, E. Halperin, R. Ravi, R. Schwartz, and S. Sridhar, “Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction,”
Proc. 33rd Int'l Colloquium Automata, Languages and Programming (ICALP '06), pp.667-689, 2006.- [17] S. Sridhar, K. Dhamdhere, G.E. Blelloch, E. Halperin, R. Ravi, and R. Schwartz, “Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees,”
Proc. Int'l Workshop Bioinformatics Research and Applications (IWBRA), 2006.- [18] D. Gusfield, “Haplotyping by Pure Parsimony,”
Proc. 14th Symp. Combinatorial Pattern Matching (CPM '03), pp. 144-155, 2003.- [19]
Steiner Trees in Industry, X. Cheng and D.Z. Zu, eds., Springer, 2002.- [20] F.K. Hwang, D.S. Richards, and P. Winter, “The Steiner Minimum Tree Problems,”
Annals of Discrete Math., vol. 53, 1992.- [22] P. Buneman, “The Recovery of Trees from Measures of Dissimilarity,”
Math. in the Archeological and Historical Sciences, F. Hodson et al., eds., pp. 387-395, 1971.- [24] C. Semple and M. Steel,
Phylogenetics. Oxford Univ. Press, 2003.- [26] D. Gusfield and V. Bansal, “A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters,”
Proc. Ninth Int'l Conf. Research in Computational Molecular Biology (RECOMB '05), pp. 217-232, 2005.- [27] J. Beasley, “An Algorithm for the Steiner Problem in Graphs,”
Networks, vol. 14, pp. 147-159, 1984.- [28] N. Maculan, “The Steiner Problem in Graphs,”
Annals of Discrete Math., vol. 31, pp. 185-212, 1987.- [30] A.C. Stone, R.C. Griffiths, S.L. Zegura, and M.F. Hammer, “High Levels of Y-Chromosome Nucleotide Diversity in the Genus Pan,”
Proc. Nat'l Academy of Sciences, vol. 99, pp. 43-48, 2002.- [35] M. Merimaa, M. Liivak, E. Heinaru, J. Truu, and A. Heinaru, “Functional Co-Adaption of Phenol Hydroxylase and Catechol 2,3-Dioxygenase Genes in Bacteria Possessing Different Phenol and p-Cresol Degradation Pathways,”
Proc. Eighth Symp. Bacterial Genetics and Ecology (BAGECO '05), vol. 31, pp. 185-212, 2005.- [36] S. Sridhar, F. Lam, G. Blelloch, R. Ravi, and R. Schwartz, “Efficiently Finding the Most Parsimonious Phylogenetic Tree via Linear Programming,”
Proc. Int'l Symp. Bioinformatics Research and Applications (ISBRA '07), pp. 37-48, 2007. |