Counting Trees in a Phylogenetic Network Is \#P-Complete

DOI10.1137/12089394XzbMath1276.05028OpenAlexW2062269505MaRDI QIDQ2862211

Simone Linz, Charles Semple, Katherine St. John

Publication date: 14 November 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/12089394x

zbMATH Keywords

phylogenetic treesphylogenetic networks\#P-complete

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Related Items (8)

Non-essential arcs in phylogenetic networks ⋮ Counting General Phylogenetic networks ⋮ Display sets of normal and tree-child networks ⋮ Tree-based networks: characterisations, metrics, and support trees ⋮ Phylogenetic networks that display a tree twice ⋮ A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ A decomposition theorem and two algorithms for reticulation-visible networks

This page was built for publication: Counting Trees in a Phylogenetic Network Is \#P-Complete