Counting consistent phylogenetic trees is \#P-complete
The paper studies the complexity of counting rooted phylogenetic (super)trees consistent to a set of (possibly overlapping) rooted phylogenetic trees, and shows that it (similarly to two other related problems) is \#P-complete. The proof works through reducing the problem \(\#\)-\texttt{MON-2-SAT} to the problem at hand.
scientific article; zbMATH DE number 2107235
scientific article