An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
From MaRDI portal
(Redirected from Publication:313792)
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
Cites work
Cited in
(13)- Identifiability of local and global features of phylogenetic networks from average distances
- Level-\(2\) networks from shortest and longest distances
- Determining triangulations and quadrangulations by boundary distances
- Circular Networks from Distorted Metrics
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Reconstruction of certain phylogenetic networks from their tree-average distances
- 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
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)