Unique solvability of certain hybrid networks from their distances

DOI10.1007/s00026-006-0280-zzbMath1089.92037OpenAlexW2094142380MaRDI QIDQ2494465

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

zbMATH Keywords

directed graphphylogenetic treehybridizationhybridphylogenetic network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Unique determination of some homoplasies at hybridization events ⋮ On encodings of phylogenetic networks of bounded level ⋮ Unique reconstruction of tree-like phylogenetic networks from distances between leaves

Uses Software

• Spectronet

This page was built for publication: Unique solvability of certain hybrid networks from their distances