Circular Networks from Distorted Metrics
From MaRDI portal
Recommendations
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Phylogenetic networks
- scientific article; zbMATH DE number 1113977
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks
Cites work
- scientific article; zbMATH DE number 2079368 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- A canonical decomposition theory for metrics on a finite set
- A few logs suffice to build (almost) all trees (I)
- A few logs suffice to build (almost) all trees. II
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- Circular Networks from Distorted Metrics
- Computational phylogenetics. An introduction to designing methods for phylogeny estimation
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
- Phylogenies without branch bounds: contracting the short, pruning the deep
- Phylogeny. Discrete and random processes in evolution
- Recovering a tree from the leaf colourations it generates under a Markov model
Cited in
(4)
This page was built for publication: Circular Networks from Distorted Metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881351)