The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July-Aug. (2013 vol.10)
pp: 1076-1079
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
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.
INDEX TERMS
Measurement, Binary trees, Phylogeny, Silicon, Computational biology, Bioinformatics, Computer science,analysis of algorithms, Phylogenetic tree construction, graph theory
CITATION
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
REFERENCES
[1] B.L. Allen and M. Steel, "Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees," Annals of Combinatorics, vol. 5, no. 1, pp. 1-15, 2001.
[2] D. Bryant, "Penny Ante: A Mathematical Challenge," http://www. math.canterbury.ac.nz/bio/events/ kaikoura09penny.shtml, 2008.
[3] A.J.J. Caceres, J. DeJesus, M. Hintze, D. Moore, and K. St. John, "Walks in Phylogenetic Treespace," Information Processing Letters, vol. 111, pp. 600-604, 2011.
[4] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed., MIT Press, 2001.
[5] L. Foulds and R. Graham, "The Steiner Problem in Phylogeny is NP-Complete," Advances in Applied Math., vol. 3, no. 1, pp. 43-49, 1982.
[6] D. Robinson, "Comparison of Labeled Trees with Valency Three," J. Combinatorial Theory, Series B, vol. 11, no. 2, pp. 105-119, 1971.
[7] S. Roch, "A Short Proof That Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 92-94, Jan. 2006.
[8] C. Semple and M. Steel, Phylogenetics, Oxford Lecture Series in Math. and Its Applications, vol. 24, Oxford Univ. Press, 2003.
93 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool