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:

Constructing tree-child networks from distance matrices.

Bordewich, Magnus and Semple, Charles and Tokac, Nihan (2017) 'Constructing tree-child networks from distance matrices.', Algorithmica., 80 (8). pp. 2240-2259.


A tree-child network is a phylogenetic network with the property that each non-leaf vertex is the parent of a tree vertex or a leaf. In this paper, we show that a tree-child network on taxa (leaf) set X with an outgroup and a positive real-valued weighting of its edges is essentially determined by the multi-set of all path-length distances between elements in X provided, for each reticulation, the edges directed into it have equal weight. Furthermore, we give a polynomial-time algorithm for reconstructing such a network from this inter-taxa distance information. Such constructions are of central importance in evolutionary biology where phylogenetic networks represent the ancestral history of a collection of present-day taxa.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:The final publication is available at Springer via
Date accepted:27 April 2017
Date deposited:27 April 2017
Date of first online publication:08 May 2017
Date first made open access:08 May 2018

Save or Share this output

Look up in GoogleScholar