| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949808 | Discrete Applied Mathematics | 2017 | 6 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Charles Semple,