The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March-April (2013 vol.10)
pp: 522-536
Pawel Gorecki , Dept. of Math., Inf. & Mech., Univ. of Warsaw, Warsaw, Poland
Oliver Eulenstein , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
Jerzy Tiuryn , Dept. of Math., Inf. & Mech., Univ. of Warsaw, Warsaw, Poland
ABSTRACT
Tree comparison functions are widely used in phylogenetics for comparing evolutionary trees. Unrooted trees can be compared with rooted trees by identifying all rootings of the unrooted tree that minimize some provided comparison function between two rooted trees. The plateau property is satisfied by the provided function, if all optimal rootings form a subtree, or plateau, in the unrooted tree, from which the rootings along every path toward a leaf have monotonically increasing costs. This property is sufficient for the linear-time identification of all optimal rootings and rooting costs. However, the plateau property has only been proven for a few rooted comparison functions, requiring individual proofs for each function without benefitting from inherent structural features of such functions. Here, we introduce the consistency condition that is sufficient for a general function to satisfy the plateau property. For consistent functions, we introduce general linear-time solutions that identify optimal rootings and all rooting costs. Further, we identify novel relationships between consistent functions in terms of plateaus, especially the plateau of the well-studied duplication-loss function is part of a plateau of every other consistent function. We introduce a novel approach for identifying consistent cost functions by defining a formal language of Boolean costs. Formulas in this language can be interpreted as cost functions. Finally, we demonstrate the performance of our general linear-time solutions in practice using empirical and simulation studies.
INDEX TERMS
Vegetation, Radio frequency, Cost function, Search problems, Bioinformatics, Phylogeny, IEEE transactions,formal language, Vegetation, Radio frequency, Cost function, Search problems, Bioinformatics, Phylogeny, IEEE transactions, Boolean cost, Reconciliation, unrooted gene tree, species tree, evolutionary cost, gene duplication, gene loss, speciation, deep coalescence, Robinson-Foulds distance
CITATION
Pawel Gorecki, Oliver Eulenstein, Jerzy Tiuryn, "Unrooted Tree Reconciliation: A Unified Approach", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, no. 2, pp. 522-536, March-April 2013, doi:10.1109/TCBB.2013.22
REFERENCES
[1] M.S. Bansal and R. Shamir, "A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 8, no. 3, pp. 848-850, May/June 2011.
[2] J.G. Burleigh, M.S. Bansal, O. Eulenstein, S. Hartmann, A. Wehe, and T.J. Vision, "Genome-Scale Phylogenetics: Inferring the Plant Tree of Life from 18,896 Discordant Gene Trees," Systematic Biology, vol. 60, pp. 117-125, 2011.
[3] R. Chaudhary, M.S. Bansal, A. Wehe, D. Fernández-Baca, and O. Eulenstein, "iGTP: A Software Package for Large-Scale Gene Tree Parsimony Analysis," BMC Bioinformatics, vol. 11, article 574, 2010.
[4] D. Chen, O. Eulenstein, D. Fernández-Baca, and J.G. Burleigh, "Improved Heuristics for Minimum-Flip Supertree Construction," Evolutionary Bioinformatics, vol. 2, pp. 347-356, 2006.
[5] F. Chen, A.J. Mackey, C.J. Stoeckert, and D.S. Roos, "OrthoMCL-DB: Querying a Comprehensive Multi-Species Collection of Ortholog Groups," Nucleic Acids Research, vol. 34, no. suppl. 1, pp. D363-D368, 2005.
[6] E. Oliver, S. Huzurbazar, and D.A. Liberles, "Reconciling Phylogenetic Trees," Evolution after Gene Duplication, Dittmar and Liberles, eds., Wiley, 2010.
[7] R.C. Edgar, "MUSCLE: Multiple Sequence Alignment with High Accuracy and High Throughput," Nucleic Acids Research, vol. 32, pp. 1792-1797, 2004.
[8] P. Górecki and O. Eulenstein, "A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees," Proc. Seventh Int'l Conf. Bioinformatics Research and Applications, pp. 148-159, 2011.
[9] P. Górecki and O. Eulenstein, "Algorithms: Simultaneous Error-Correction and Rooting for Gene Tree Reconciliation and the Gene Duplication Problem," BMC Bioinformatics, vol. 13, no. suppl. 10, article S14, 2012.
[10] P. Górecki and O. Eulenstein, "Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms," Proc. 18th Ann. Int'l Computing and Combinatorics Conf. (COCOON '12), pp. 531-542, 2012.
[11] P. Górecki and O. Eulenstein, "GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches," Proc. Int'l Conf. Bioinformatics Research and Applications, pp. 83-105, 2012.
[12] P. Górecki and O. Eulenstein, "A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees," Proc. Int'l Conf. Bioinformatics Research and Applications, pp. 102-114, 2012.
[13] P. Górecki and J. Tiuryn, "DLS-Trees: A Model of Evolutionary Scenarios," Theoretical Computer Science, vol. 359, nos. 1-3, pp. 378-399, 2006.
[14] P. Górecki and J. Tiuryn, "Inferring Phylogeny from Whole Genomes," Bioinformatics, vol. 23, no. 2 pp. e116-e122, 2007.
[15] P. Górecki and J. Tiuryn, "URec: A System for Unrooted Reconciliation," Bioinformatics, vol. 23, no. 4, pp. 511-512, 2007.
[16] S. Guindon, F. Delsuc, J. Dufayard, and O. Gascuel, "Estimating Maximum Likelihood Phylogenies with PhyML," Methods Molecular Biology, vol. 537, pp. 113-137, 2009.
[17] B.R. Holland, D. Penny, and M.D. Hendy, "Outgroup Misplacement and Phylogenetic Inaccuracy under a Molecular Clock---A Simulation Study," Systematic Biology, vol. 52, pp. 229-238, 2003.
[18] J.P. Huelsenbeck, J.P. Bollback, and A.M. Levine, "Inferring the Root of a Phylogenetic Tree," Systematic Biology, vol. 51, no. 1 pp. 32-43, Jan. 2002.
[19] E.V. Koonin and M.Y. Galperin, Sequence - Evolution - Function: Computational Approaches in Comparative Genomics. Kluwer Academic, 2003.
[20] B. Ma, M. Li, and L. Zhang, "From Gene Trees to Species Trees," SIAM J. Computing, vol. 30, no. 3, pp. 729-752, 2000.
[21] W.P. Maddison, "Gene Trees in Species Trees," Systematic Biology, vol. 46, pp. 523-536, 1997.
[22] C. Notredame, D.G. Higgins, and H. Jaap, "T-Coffee: A Novel Method for Fast and Accurate Multiple Sequence Alignment," J. Molecular Biology, vol. 302, no. 1, pp. 205-217, 2000.
[23] R.D.M. Page and E.C. Holmes, Molecular Evolution: A Phylogenetic Approach. Blackwell Science, 1998.
[24] M.D. Rasmussen and M. Kellis, "A Bayesian Approach for Fast and Accurate Gene Tree Reconstruction," Molecular Biology and Evolution, vol. 28, pp. 273-290, 2011.
[25] J. Ruan et al., "TreeFam: 2008 Update," Nucleic Acids Res, vol. 36, pp. D735-D740, 2008.
[26] E.W. Sayers et al., "Database Resources of the National Center for Biotechnology Information," Nucleic Acids Research, vol. 37, no. suppl. 1, pp. D5-D15, 2009.
[27] D.J. Sherman et al., "Gènolevures: Protein Families and Synteny among Complete Hemiascomycetous Yeast Proteomes and Genomes," Nucleic Acids Research, vol. 37, no. suppl. 1, pp. D550-D554, 2009.
[28] J. Slowinski and R.D.M. Page, "How Should Species Phylogenies Be Inferred from Sequence Data?" Systematic Biology, vol. 105, pp. 147-158, 1999.
[29] M. Steel, "Root Location in Random Trees: A Polarity Property of All Sampling Consistent Phylogenetic Models Except One," Molecular Phylogenetics and Evolution, vol. 65, pp. 345-348, 2012.
[30] A. Wehe, M.S. Bansal, J.G. Burleigh, and O. Eulenstein, "DupTree: A Program for Large-Scale Phylogenetic Analyses Using Gene Tree Parsimony," Bioinformatics, vol. 24, no. 13, pp. 1540-1541, 2008.
[31] Y. Wu, D.M. Rasmussen, S.M. Bansal, and M. Kellis, "TreeFix: Statistically Informed Gene Tree Error Correction Using Species Trees," Systematic Biology, vol. 62, pp. 110-120, Sept. 2012.
[32] Y. Yu, T. Warnow, and L. Nakhleh, "Algorithms for MDC-Based Multi-Locus Phylogeny Inference," Proc. 15th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '11), pp. 531-545, 2011.
[33] L. Zhang, "From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 8, no. 6, pp. 1685-1691, Nov./Dec. 2011.
57 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool