Not all phylogenetic networks are leaf-reconstructible

Péter L. Erdős, Leo van Iersel, Mark Jones*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)
57 Downloads (Pure)

Abstract

Unrooted phylogenetic networks are graphs used to represent reticulate evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It has recently been conjectured that all unrooted phylogenetic networks for at least five taxa can be uniquely reconstructed from their subnetworks obtained by deleting a single taxon. Here, we show that this conjecture is false, by presenting a counter-example for each possible number of taxa that is at least 4. Moreover, we show that the conjecture is still false when restricted to binary networks. This means that, even if we are able to reconstruct the unrooted evolutionary history of each proper subset of some taxon set, this still does not give us enough information to reconstruct their full unrooted evolutionary history.

Original languageEnglish
Pages (from-to)1623-1638
Number of pages16
JournalJournal of Mathematical Biology
Volume79
Issue number5
DOIs
Publication statusPublished - 2019

Bibliographical note

green

Keywords

  • Graph reconstruction
  • Leaf removal
  • Phylogenetic Networks
  • Phylogenetics
  • Ulam’s Conjecture
  • Undirected graphs

Fingerprint

Dive into the research topics of 'Not all phylogenetic networks are leaf-reconstructible'. Together they form a unique fingerprint.

Cite this