Skip to main content
SpringerLink
Log in

Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time

  • Conference paper
  • First Online:
Algorithms for Computational Biology (AlCoB 2018)

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

Included in the following conference series:

Abstract

The tree containment problem (TCP) is a fundamental problem in phylogenetic study. It was introduced as a mean for verifying whether a network is consistent with a binary tree. The containment problem is NP-complete, even if the network input is binary. If the input is restricted to reticulation-visible networks, the TCP has been proved to be solvable in quadratic time. In this paper, we show that there is a linear time TCP algorithm for binary reticulation-visible networks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75–94 (2005)

    Article  MathSciNet  Google Scholar 

  2. Bordewich, M., Semple, C.: Reticulation-visible networks. Adv. Appl. Math. 78, 114–141 (2016)

    Article  MathSciNet  Google Scholar 

  3. Chan, J.M., Carlsson, G., Rabadan, R.: Topology of viral evolution. PNAS 110(46), 18566–18571 (2013)

    Article  MathSciNet  Google Scholar 

  4. Gunawan, A.D.M., DasGupta, B., Zhang, L.: A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252, 161–175 (2017)

    Article  MathSciNet  Google Scholar 

  5. Gunawan, A.D.M., Lu, B., Zhang, L.: A program for verification of phylogenetic network models. Bioinformatics 32(17), i503–i510 (2016)

    Article  Google Scholar 

  6. Gunawan, A.D.M., Zhang, L.: Bounding the size of a network defined by visibility property (2015). http://arxiv.org/abs/1510.00115

  7. van Iersel, L., Semple, C., Steel, M.: Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23), 1037–1043 (2010)

    Article  MathSciNet  Google Scholar 

  8. Kanj, I.A., Nakhleh, L., Than, C., Xia, G.: Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401, 153–164 (2008)

    Article  MathSciNet  Google Scholar 

  9. Lu, B., Zhang, L., Leong, H.W.: A program to compute the soft Robinson-Foulds distance between phylogenetic networks. BMC Genomics 18(2), 111 (2017)

    Article  Google Scholar 

  10. Marcussen, T., Sandve, S.R., Heier, L., Spannagl, M., Pfeifer, M., Jakobsen, K.S., Wulff, B.B.H., Steuernagel, B., Mayer, K.F.X., Olsen, O., et al.: Ancient hybridizations among the ancestral genomes of bread wheat. Science 345(6194), 1250092 (2014)

    Article  Google Scholar 

  11. Weller, M.: Linear-time tree containment in phylogenetic networks. arXiv preprint arXiv:1702.06364 (2017)

Download references

Acknowledgement

I’d like to thank Prof. Zhang Louxin for his guidance and help. The project is financially supported by Singapore MoE-ARF Tier 1 grant, R-146-000-238-114.

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, Singapore, Singapore

    Andreas D. M. Gunawan

Authors
  1. Andreas D. M. Gunawan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas D. M. Gunawan .

Editor information

Editors and Affiliations

  1. The Hong Kong Polytechnic University, Kowloon, Hong Kong

    Jesper Jansson

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. University of Extremadura, Cáceres, Spain

    Miguel A. Vega-Rodríguez

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gunawan, A.D.M. (2018). Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time. In: Jansson, J., Martín-Vide, C., Vega-Rodríguez, M. (eds) Algorithms for Computational Biology. AlCoB 2018. Lecture Notes in Computer Science(), vol 10849. Springer, Cham. https://doi.org/10.1007/978-3-319-91938-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91938-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91937-9

  • Online ISBN: 978-3-319-91938-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation