| Literature DB >> 24334399 |
Kevaughn Gordon1, Eric Ford2, Katherine St John1.
Abstract
We answer Bryant's combinatorial challenge on minimal walks of phylogenetic treespace under the nearest-neighbor interchange (NNI) metric. We show that the shortest path through the NNI-treespace of n-leaf trees is Hamiltonian for all n. That is, there is a minimal path that visits all binary trees exactly once, under NNI moves.Mesh：
Year: 2013 PMID： 24334399 DOI： 10.1109/TCBB.2013.105
Source DB: PubMed Journal: IEEE/ACM Trans Comput Biol Bioinform ISSN： 1545-5963 Impact factor: 3.710