An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
From MaRDI portal
Publication:313792
DOI10.1016/j.dam.2016.05.011zbMath1344.05134OpenAlexW2409011140MaRDI QIDQ313792
Publication date: 12 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.011
Trees (05C05) Problems related to evolution (92D15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ Determining triangulations and quadrangulations by boundary distances ⋮ Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances ⋮ The space of equidistant phylogenetic cactuses ⋮ Recovering normal networks from shortest inter-taxa distance information ⋮ Level-\(2\) networks from shortest and longest distances ⋮ Constructing tree-child networks from distance matrices ⋮ Identifiability of local and global features of phylogenetic networks from average distances
Uses Software
Cites Work
This page was built for publication: An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances