We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Reticulation-visible networks.

Bordewich, Magnus and Semple, Charles (2016) 'Reticulation-visible networks.', Advances in applied mathematics., 78 . pp. 114-141.


Let X be a finite set, N be a reticulation-visible network on X , and T be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not N displays T. Furthermore, for all |X|≥1, we show that N has at most 8|X|−7 vertices in total and at most 3|X|−3 reticulation vertices, and that these upper bounds are sharp.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2016 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:13 April 2016
Date deposited:20 April 2016
Date of first online publication:27 April 2016
Date first made open access:27 April 2017

Save or Share this output

Look up in GoogleScholar