Reconstructibility of unrooted level-k phylogenetic networks from distances

van Iersel, Leo, Moulton, Vincent ORCID: and Murakami, Yuki (2020) Reconstructibility of unrooted level-k phylogenetic networks from distances. Advances in Applied Mathematics, 120. ISSN 0196-8858

[thumbnail of Published_Version]
PDF (Published_Version) - Published Version
Available under License Creative Commons Attribution.

Download (36kB) | Preview


A phylogenetic network is a graph-theoretical tool that is used by biologists to represent the evolutionary history of a collection of species. One potential way of constructing such networks is via a distance-based approach, where one is asked to find a phylogenetic network that in some way represents a given distance matrix, which gives information on the evolutionary distances between present-day taxa. Here, we consider the following question. For which k are unrooted level-k networks uniquely determined by their distance matrices? We consider this question for shortest distances as well as for the case that the multisets of all distances is given. We prove that level-1 networks and level-2 networks are reconstructible from their shortest distances and multisets of distances, respectively. Furthermore we show that, in general, networks of level higher than 1 are not reconstructible from shortest distances and that networks of level higher than 2 are not reconstructible from their multisets of distances.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: LivePure Connector
Date Deposited: 24 Jun 2020 00:02
Last Modified: 22 Oct 2022 06:21
DOI: 10.1016/j.aam.2020.102075

Actions (login required)

View Item View Item