Constructing the Simplest Possible Phylogenetic Network from Triplets

DOI10.1007/978-3-540-92182-0_43zbMath1183.92065arXiv0805.1859OpenAlexW2118432126MaRDI QIDQ3596742

Leo van Iersel, Steven Kelk

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.1859

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Nonnumerical algorithms (68W05) Directed graphs (digraphs), tournaments (05C20)

Related Items

Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time ⋮ The Structure of Level-k Phylogenetic Networks