Title :
Hamiltonian Walks of Phylogenetic Treespaces
Author :
Gordon, Kevaughn ; Ford, Eric ; St.John, K.
Author_Institution :
Dept. of Math. & Comput. Sci., City Univ. of New York, New York, NY, USA
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.
Keywords :
bioinformatics; evolution (biological); genetics; genomics; trees (mathematics); Hamiltonian walks; NNI-treespace; binary trees; n-leaf trees; nearest-neighbor interchange metric; phylogenetic treespaces; Binary trees; Bioinformatics; Computational biology; Computer science; Measurement; Phylogeny; Silicon; Phylogenetic tree construction; analysis of algorithms; graph theory;
Journal_Title :
Computational Biology and Bioinformatics, IEEE/ACM Transactions on
DOI :
10.1109/TCBB.2013.105
