Hamiltonian Walks of Phylogenetic Treespaces

Authors:
Kevaughn Gordon;Eric Ford;Katherine St. John
Affiliations:
City University of New York, Bronx;City University of New York, New York;City University of New York, Bronx
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2013

Citing 3
Cited 0

Introduction to algorithms

Introduction to algorithms
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Walks in phylogenetic treespace

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.