1 problem

0 votes0 replies0 views
Conjecture on improving the low-substitution bound for NNI recovery
The paper considers binary phylogenetic trees $T$ , the alignment $A_k(T)$ of binary characters of parsimony score $k$ on $T$ , and unique maximum-parsimony recovery within the NNI n…
Conjectureopenmaximum-parsimony nearest-neighbor-interchange phylogeneticsarXiv posted 2 days ago

Conjecture on improving the low-substitution bound for NNI recovery