When k=o(√n), the number of binary phylogenetic networks with k reticulations on n taxa is asymptotic to binom(n,k) 2^{n+k-1/2} n^{n+k-1} e^{-n}.
Phylogenetic classification and the universal tree.Science, 284(5423):2124–2128, 1999
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asymptotic Counting of Binary Phylogenetic Networks
When k=o(√n), the number of binary phylogenetic networks with k reticulations on n taxa is asymptotic to binom(n,k) 2^{n+k-1/2} n^{n+k-1} e^{-n}.