An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
DOI10.1016/J.DAM.2016.05.011zbMATH Open1344.05134OpenAlexW2409011140MaRDI QIDQ313792FDOQ313792
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
Recommendations
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Constructing tree-child networks from distance matrices
- Mathematical Foundations of Computer Science 2005
- Determining phylogenetic networks from inter-taxa distances
- Recovering normal networks from shortest inter-taxa distance information
Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Taxonomy, cladistics, statistics in mathematical biology (92B10)
Cites Work
Cited In (12)
- Identifiability of local and global features of phylogenetic networks from average distances
- Determining triangulations and quadrangulations by boundary distances
- Level-\(2\) networks from shortest and longest distances
- Circular Networks from Distorted Metrics
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- The space of equidistant phylogenetic cactuses
- Do branch lengths help to locate a tree in a phylogenetic network?
- Mathematical Foundations of Computer Science 2005
- Reconstruction of additive phylogenetic tree.
- Recovering normal networks from shortest inter-taxa distance information
- Constructing tree-child networks from distance matrices
Uses Software
This page was built for publication: An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313792)
