CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2013 vol.10 Issue No.04 - July-Aug.
Issue No.04 - July-Aug. (2013 vol.10)
Kevaughn Gordon , Dept. of Math. & Comput. Sci., City Univ. of New York, New York, NY, USA
Eric Ford , Dept. of Comput. Sci., City Univ. of New York, New York, NY, USA
Katherine St. John , Dept. of Math. & Comput. Sci., City Univ. of New York, New York, NY, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.105
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.
Measurement, Binary trees, Phylogeny, Silicon, Computational biology, Bioinformatics, Computer science,analysis of algorithms, Phylogenetic tree construction, graph theory
Kevaughn Gordon, Eric Ford, Katherine St. John, "Hamiltonian Walks of Phylogenetic Treespaces", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, no. 4, pp. 1076-1079, July-Aug. 2013, doi:10.1109/TCBB.2013.105