Abstract

We consider the problem of when the total number n of vertices in a phylogenetic network N is bounded by the number ℓ of leaves in N. The main result of the paper says that, provided N avoids three certain substructures, then n is at most quadratic in ℓ. Furthermore, if any of these substructures is present in N, then ℓ does not necessarily bound n.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.