title: Hamiltonian walks of phylogenetic treespaces.
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.
authors: City University of New York, Bronx.
authors: Kevaughn
authors: K
authors: Gordon
authors: City University of New York, New York.
authors: Eric
authors: E
authors: Ford
authors: City University of New York, Bronx.
authors: Katherine
authors: K
authors: St John
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D008957:Models, Genetic; D010802:Phylogeny