Unique solvability of certain hybrid networks from their distances
From MaRDI portal
Publication:2494465
DOI10.1007/S00026-006-0280-ZzbMATH Open1089.92037OpenAlexW2094142380MaRDI QIDQ2494465FDOQ2494465
Authors: Stephen J. Willson 
Publication date: 28 June 2006
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-006-0280-z
Recommendations
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
- Unique determination of some homoplasies at hybridization events
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- Determining phylogenetic networks from inter-taxa distances
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Directed graphs (digraphs), tournaments (05C20)
Cited In (11)
- Identifiability of local and global features of phylogenetic networks from average distances
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
- Unique determination of some homoplasies at hybridization events
- Properties of normal phylogenetic networks
- Determining phylogenetic networks from inter-taxa distances
- A framework for representing reticulate evolution
- Reconstruction of certain phylogenetic networks from the genomes at their leaves
- Reconstruction of certain phylogenetic networks from their tree-average distances
- On encodings of phylogenetic networks of bounded level
- Distinguished minimal topological lassos
Uses Software
This page was built for publication: Unique solvability of certain hybrid networks from their distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494465)
