Unique reconstruction of tree-like phylogenetic networks from distances between leaves
From MaRDI portal
(Redirected from Publication:743846)
Recommendations
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
- Reconstruction of certain phylogenetic networks from the genomes at their leaves
- Constructing tree-child networks from distance matrices
Cites work
- scientific article; zbMATH DE number 1975249 (Why is no real title available?)
- A framework for representing reticulate evolution
- Efficient algorithms for inferring evolutionary trees
- Reconstructing evolution of sequences subject to recombination using parsimony
- Reconstructing the shape of a tree from observed dissimilarity data
- Simple method for constructing phylogenetic trees from distance matrices.
- The fine structure of galls in phylogenetic networks
- Unique solvability of certain hybrid networks from their distances
Cited in
(9)- Constructing circular phylogenetic networks from weighted quartets using simulated annealing
- Level-\(2\) networks from shortest and longest distances
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
- Unique determination of some homoplasies at hybridization events
- Reconstruction of certain phylogenetic networks from the genomes at their leaves
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- Identifying circular orders for blobs in phylogenetic networks
- Unique solvability of certain hybrid networks from their distances
This page was built for publication: Unique reconstruction of tree-like phylogenetic networks from distances between leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743846)
