Not all phylogenetic networks are leaf-reconstructible

Autor: Leo van Iersel, Mark Jones, Péter L. Erdős
Jazyk: angličtina
Rok vydání: 2018
Předmět:
05C60 Isomorphism problems
05C60
Binary number
Leaf removal
01 natural sciences
Models
Biological
Article
010305 fluids & plasmas
Set (abstract data type)
Evolution
Molecular
03 medical and health sciences
Reticulate
Phylogenetics
0103 physical sciences
Phylogenetic Networks
FOS: Mathematics
Quantitative Biology::Populations and Evolution
Mathematics - Combinatorics
Relevance (information retrieval)
Graph reconstruction
Phylogeny
030304 developmental biology
Mathematics
0303 health sciences
Conjecture
Phylogenetic tree
Models
Genetic
92D15 Problems related to evolution
Applied Mathematics
Mathematical Concepts
Agricultural and Biological Sciences (miscellaneous)
Biological Evolution
Taxon
Evolutionary biology
Modeling and Simulation
Undirected graphs
Combinatorics (math.CO)
Ulam’s Conjecture
Algorithms
Zdroj: Journal of Mathematical Biology, 79(5)
Journal of Mathematical Biology
Journal of Mathematical Biology, 79, 1623-1638
ISSN: 0303-6812
Popis: 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.
Databáze: OpenAIRE
Externí odkaz: