Abstract
Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so, to construct such a network [24]. Here, we extend this work by showing that this problem is even polynomial time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily nontree-like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We also implemented the algorithm and applied it to yeast data.
- A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman, "Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions," SIAM J. Computing, vol. 10, no. 3, pp. 405-421, 1981.Google ScholarCross Ref
- D. Bryant, "Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis," PhD dissertation, Univ. of Canterbury, 1997.Google Scholar
- D. Bryant and V. Moulton, "Neighbor-Net: An Agglomerative Method for the Construction of Phylogenetic Networks," Molecular Biology and Evolution, vol. 21, no. 2, pp. 255-265, 2004.Google ScholarCross Ref
- D. Bryant and M. Steel, "Constructing Optimal Trees from Quartets," J. Algorithms, vol. 38, no. 1, pp. 237-259, 2001. Google ScholarDigital Library
- J. Byrka, P. Gawrychowski, K.T. Huber, and S. Kelk, "Worst-Case Optimal Approximation Algorithms for Maximizing Triplet Consistency within Phylogenetic Networks," arXiv:0710.3258v3 {q-bio.PE}, 2008.Google Scholar
- H.-L. Chan, J. Jansson, T.W. Lam, and S.-M. Yiu, "Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix," J. Bioinformatics and Computational Biology, vol. 4, no. 4, pp. 807-832, 2006.Google ScholarCross Ref
- P.L. Erdös, M.A. Steel, L.A. Szekely, and T. Warnow, "A Few Logs Suffice to Build (Almost) All Trees (Part II)," Theoretical Computer Science, vol. 221, no. 1, pp. 77-118, 1999. Google ScholarDigital Library
- L. Gaasieniec, J. Jansson, A. Lingas, and A. Östlin, "On the Complexity of Constructing Evolutionary Trees," J. Combinatorial Optimization, vol. 3, pp. 183-197, 1999.Google ScholarCross Ref
- S. Guindon and O. Gascuel, "A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood," Systematic Biology, vol. 52, no. 5, pp. 696-704, 2003.Google ScholarCross Ref
- D. Gusfield, S. Eddhu, and C. Langley, "Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination," J. Bioinformatics and Computational Biology, vol. 2, pp. 173-213, 2004.Google ScholarCross Ref
- Y.-J. He, T.N.D. Huynh, J. Jansson, and W.-K. Sung, "Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets," J. Bioinformatics and Computational Biology, vol. 4, no. 1, pp. 59-74, 2006.Google ScholarCross Ref
- M. Holder and P.O. Lewis, "Phylogeny Estimation: Traditional and Bayesian Approaches," Nature Rev. Genetics, vol. 4, pp. 275- 284, 2003.Google ScholarCross Ref
- K.T. Huber, B. Oxelman, M. Lott, and V. Moulton, "Reconstructing the Evolutionary History of Polyploids from Multilabeled Trees," Molecular Biology and Evolution, vol. 23, no. 9, pp. 1784- 1791, 2006.Google ScholarCross Ref
- D.H. Huson and D. Bryant, "Application of Phylogenetic Networks in Evolutionary Studies," Molecular Biology and Evolution, vol. 23, no. 2, pp. 254-267, 2006.Google ScholarCross Ref
- D.H. Huson and T.H. Klöpper, "Beyond Galled Trees--Decomposition and Computation of Galled Networks," Proc. Int'l Conf. Research in Computational Molecular Biology (RECOMB '07), pp. 211- 225, 2007. Google ScholarDigital Library
- L.J.J. van Iersel, J.C.M. Keijsper, S.M. Kelk, and L. Stougie, "Constructing Level-2 Phylogenetic Networks from Triplets," arXiv:0707.2890v1 {q-bio.PE}, 2007.Google Scholar
- L.J.J. van Iersel, J.C.M. Keijsper, S.M. Kelk, L. Stougie, F. Hagen, and T. Boekhout, "Constructing Level-2 Phylogenetic Networks from Triplets," Proc. 12th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '08), pp. 450-462, 2008. Google ScholarDigital Library
- L.J.J. van Iersel, S.M. Kelk, and M. Mnich, "Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks," to be published in J. Bioinformatics and Computational Biology.Google Scholar
- J. Jansson, personal communication, Kyushu Univ., 2007.Google Scholar
- J. Jansson, "On the Complexity of Inferring Rooted Evolutionary Trees," Proc. Brazilian Symp. Graphs, Algorithms and Combinatorics (GRACO '01), pp. 121-125, 2001.Google Scholar
- J. Jansson, J.H.-K. Ng, K. Sadakane, and W.-K. Sung, "Rooted Maximum Agreement Supertrees," Algorithmica, vol. 43, pp. 293- 307, 2005. Google ScholarDigital Library
- J. Jansson, N.B. Nguyen, and W.-K. Sung, "Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network," SIAM J. Computing, vol. 35, no. 5, pp. 1098-1121, 2006. Google ScholarDigital Library
- J. Jansson and W.-K. Sung, "Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets," Proc. Conf. Computing and Combinatorics (COCOON '04), pp. 462-472, 2004.Google ScholarCross Ref
- J. Jansson and W.-K. Sung, "Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets," Theoretical Computer Science, vol. 363, pp. 60-68, 2006. Google ScholarDigital Library
- T. Jiang, P.E. Kearney, and M. Li, "A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application," SIAM J. Computing, vol. 30, no. 6, pp. 1942-1961, 2000. Google ScholarDigital Library
- S. Kidd, F. Hagen, R. Tscharke, M. Huynh, K. Bartlett, M. Fyfe, L. MacDougall, T. Boekhout, K.J. Kwon-Chung, and W. Meyer, "A Rare Genotype of Cryptococcus Gattii Caused the Cryptococcosis Outbreak on Vancouver Island (British Columbia, Canada)," Proc. Nat'l Academy of Sciences USA, vol. 101, pp. 17258-17263, 2004.Google ScholarCross Ref
- "LEVEL2: A Fast Method for Constructing Level-2 Phylogenetic Networks from Dense Sets of Rooted Triplets," http://home pages.cwi.nl/~kelk/level2triplets.html and http://level2.source forge.net/, 2009.Google Scholar
- V. Makarenkov, "T-REX: Reconstructing and Visualizing Phylogenetic Trees and Reticulation Networks," Bioinformatics, vol. 17, no. 7, pp. 664-668, 2001.Google ScholarCross Ref
- V. Makarenkov, D. Kevorkov, and P. Legendre, "Phylogenetic Network Reconstruction Approaches," Applied Mycology and Biotechnology, vol. 6. pp. 61-97, 2006.Google ScholarCross Ref
- B.M.E. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme, "Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 1, pp. 13-23, Jan.-Mar. 2004. Google ScholarDigital Library
- C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.Google Scholar
- M. Steel, "The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees," J. Classification, vol. 9, pp. 91-116, 1992.Google ScholarCross Ref
- R.E. Tarjan and U. Vishkin, "An Efficient Parallel Biconnectivity Algorithm," SIAM J. Computing, vol. 14, no. 4, pp. 862-874, 1985.Google ScholarCross Ref
- L. Wang, K. Zhang, and L. Zhang, "Perfect Phylogenetic Networks with Recombination," J. Computational Biology, vol. 8, no. 1, pp. 69-78, 2001.Google ScholarCross Ref
- B.Y. Wu, "Constructing the Maximum Consensus Tree from Rooted Triples," J. Combinatorial Optimization, vol. 8, pp. 29-39, 2004.Google ScholarCross Ref
Index Terms
- Constructing Level-2 Phylogenetic Networks from Triplets
Recommendations
Constructing the Simplest Possible Phylogenetic Network from Triplets
A phylogenetic network is a directed acyclic graph that visualizes an evolutionary history containing so-called reticulations such as recombinations, hybridizations or lateral gene transfers. Here we consider the construction of a simplest possible ...
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks
Recently, much attention has been devoted to the construction of phylogenetic networks which generalize phylogenetic trees in order to accommodate complex evolutionary processes. Here, we present an efficient, practical algorithm for reconstructing ...
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
Phylogenetic networks are models of sequence evolution that go beyond trees, allowing biological operations that are not tree-like. One of the most important biological operations is recombination between two sequences. An established problem [J. Hein, ...
Comments