Unique reconstruction of tree-like phylogenetic networks from distances between leaves

DOI10.1007/S11538-005-9044-XzbMath1296.92175OpenAlexW2010275335WikidataQ51938991 ScholiaQ51938991MaRDI QIDQ743846

Stephen J. Willson

Publication date: 30 September 2014

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11538-005-9044-x

zbMATH Keywords

networkphylogenyphylogenetic network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10)

Related Items (5)

Unique determination of some homoplasies at hybridization events ⋮ Reconstruction of some hybrid phylogenetic networks with homoplasies from distances ⋮ Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances ⋮ Constructing circular phylogenetic networks from weighted quartets using simulated annealing ⋮ Level-\(2\) networks from shortest and longest distances

Uses Software

• fastDNAml
• SplitsTree

Cites Work

• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Reconstructing evolution of sequences subject to recombination using parsimony
• A framework for representing reticulate evolution
• Unique solvability of certain hybrid networks from their distances
• The Fine Structure of Galls in Phylogenetic Networks
• Simple method for constructing phylogenetic trees from distance matrices.
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Unique reconstruction of tree-like phylogenetic networks from distances between leaves