Constructing tree-child networks from distance matrices

DOI10.1007/s00453-017-0320-6zbMath1391.92028OpenAlexW2610964622MaRDI QIDQ724232

Nihan Tokac, Charles Semple, Magnus Bordewich

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/21622/1/21622.pdf

zbMATH Keywords

distance matrixtree-child networkstack-free network

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15) Distance in graphs (05C12)

Related Items (10)

Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Orchard networks are trees with additional horizontal arcs ⋮ The SNPR neighbourhood of tree-child networks ⋮ Determining triangulations and quadrangulations by boundary distances ⋮ Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances ⋮ Recovering normal networks from shortest inter-taxa distance information ⋮ Level-\(2\) networks from shortest and longest distances ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ Phylogenetic networks that are their own fold-ups ⋮ Identifiability of local and global features of phylogenetic networks from average distances

Cites Work

• Determining phylogenetic networks from inter-taxa distances
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Reconstruction of certain phylogenetic networks from their tree-average distances
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Constructing tree-child networks from distance matrices