Skip to main content
Springer Nature Link
Log in

A Tool for Non-binary Tree Reconciliation

  • Conference paper
Bioinformatics Research and Applications (ISBRA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 7875))

Included in the following conference series:

  • 4240 Accesses

Abstract

Tree reconciliation has been widely used to study the important roles of gene duplication and loss, and to infer a species tree from gene trees in evolutionary biology. Motivated by the fact that both reference species trees and real gene trees are often non-binary, we develop a novel computer program to reconcile two non-binary trees. Such a program extends the usefulness of tree reconciliation greatly, as it can be used for gene duplication inference and species tree inference.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bansal, M.S., Shamir, S.: A note on the fixed parameter tractability of the gene-duplication problem. IEEE-ACM Trans. Comput. Biol. Bioinform. 8, 848–850 (2010)

    Article  Google Scholar 

  2. Bansal, M.S., Alm, E.J., Kellis, M.: Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinform. 28, i283–i291 (2012)

    Article  Google Scholar 

  3. Berglund-Sonnhammer, A., et al.: Optimal gene trees from sequences and species trees using a soft interpretation of parsimony. J. Mol. Evol. 63, 240–250 (2006)

    Article  Google Scholar 

  4. Chang, W.-C., Eulenstein, O.: Reconciling gene trees with apparent polytomies. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 235–244. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Chauve, C., El-Mabrouk, N.: New perspectives on gene family evolution: Losses in reconciliation and a link with supertrees. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 46–58. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Chen, K., Durand, D., Farach-Colton, M.: NOTUNG: a program for dating gene duplications and optimizing gene family trees. J. Comput. Biol. 7, 429–447 (2000)

    Article  Google Scholar 

  7. Doyon, J.-P., Ranwez, V., Daubin, V., Berry, V.: Models, algorithms and programs for phylogeny reconciliation. Briefings Bioinform. 12, 392–400 (2012)

    Article  Google Scholar 

  8. Durand, D., Halldorsson, B., Vernot, B.: A hybrid micro- macroevolutionary approach to gene tree reconstruction. J. Comput. Biol. 13(2), 320–335 (2005)

    Article  MathSciNet  Google Scholar 

  9. Eulenstein, O., Huzurbazar, S., Liberles, D.: Reconciling phylogenetic trees. In: Dittmar, K., Liberles, D. (eds.) Evolution After Duplication, pp. 185–206. Wiley-Blackwell, New Jersey, USA (2010)

    Google Scholar 

  10. Goodman, M., et al.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool. 28, 132–163 (1979)

    Article  Google Scholar 

  11. Górecki, P., Tiuryn, J.: DLS-trees: a model of evolutionary scenarios. Theoret. Comput. Sci. 359, 378–399 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hahn, M.W., et al.: Estimating the tempo and mode of gene family evolution from comparative genomic data. Genome Res. 15, 1153–1160 (2005)

    Article  Google Scholar 

  13. Hahn, M.W.: Bias in phylogenetic tree reconciliation methods: implications for vertebrate genome evolution. Genome Biol. 8(7), R141 (2007)

    Google Scholar 

  14. Koonin, E.V.: The origin and early evolution of eukaryotes in the light of phylogenomics. Genome Biol. 11, 209 (2010)

    Article  Google Scholar 

  15. Ma, B., Li, M., Zhang, L.X.: From gene trees to species trees. SIAM J. Comput. 30, 729–752 (2000); also in Proc. RECOMB 1998, pp. 182–191 (2000)

    Google Scholar 

  16. Mak, W.-K.: Faster min-cut computation in unweighted hypergraphs/circuit netlists. In: Proc. 2005 IEEE Int’l. Symp. VLSI, Automation and Test, pp. 67–70 (2005)

    Google Scholar 

  17. Ouangraoua, A., Swenson, K., Chauve, C.: A 2-approximation for the minimum duplication speciation problem. J. Comput. Biol. 18, 1041–1053 (2011)

    Article  MathSciNet  Google Scholar 

  18. Page, R.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Syst. Biol. 43, 58–77 (1994)

    Google Scholar 

  19. Shertz, C.A., Bastidas, R.J., Li, W., Heitman, J., Cardenas, M.E.: Conservation, duplication, and loss of the Tor signaling pathway in the fungal kingdom. BMC Genomics 11, 510 (2010)

    Article  Google Scholar 

  20. Stolzer, M., Lai, H., Xu, M., Sathaye, D., Vernot, B., Durand, D.: Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinform. 28, 409–415 (2012)

    Article  Google Scholar 

  21. Vernot, B., Stolzer, M., Goldman, A., Durand, D.: Reconciliation with non-binary species trees. J. Comput. Biol. 15(8), 981–1006 (2008)

    Article  MathSciNet  Google Scholar 

  22. Zhang, L.X.: On a Mirkin–Muchnik–Smith conjecture for comparing molecular phylogenies. J. Comput. Biol. 4, 177–187 (1997)

    Article  Google Scholar 

  23. Zheng, Y., Wu, T., Zhang, L.X.: Reconciliation of gene and species trees with polytomies, arXiv:1201.3995, arxiv.org (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, Singapore, 119076

    Yu Zheng & Louxin Zhang

Authors
  1. Yu Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Louxin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, Georgia State University, 34 Peachtree Street, Suite 1410, 30303, Atlanta, GA, USA

    Zhipeng Cai

  2. Computer Science, Iowa State University, 50011, Ames, IA, USA

    Oliver Eulenstein

  3. Bioinformatics and Genomics, University of North Carolina at Charlotte, 9201 University City Blvd, Suite 315, 28223, Charlotte, NC, USA

    Daniel Janies

  4. Physiology and Neurobiology, University of Connecticut, 75 North Eagleville Road, Unit 3156, 06269, Storrs, CT, USA

    Daniel Schwartz

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, Y., Zhang, L. (2013). A Tool for Non-binary Tree Reconciliation. In: Cai, Z., Eulenstein, O., Janies, D., Schwartz, D. (eds) Bioinformatics Research and Applications. ISBRA 2013. Lecture Notes in Computer Science(), vol 7875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38036-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38036-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38035-8

  • Online ISBN: 978-3-642-38036-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics