Finite sequence lengths suffice for high-probability reconstruction of binary level-1 phylogenetic networks under the CFN model, with length scaling log, poly or polylog in the number of taxa.
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
Finite sequence lengths suffice for high-probability reconstruction of binary level-1 phylogenetic networks under the CFN model, with length scaling log, poly or polylog in the number of taxa.