Walks in phylogenetic treespace

Authors:
Alan Joseph J. Caceres;Samantha Daley;John DeJesus;Michael Hintze;Diquan Moore;Katherine St. John
Affiliations:
Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States;Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States;Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States;Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States;Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States;Dept. of Math & Computer Science, Lehman College, City University of New York, Bronx, NY 10468, United States
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 2

Introduction to algorithms

Introduction to algorithms
Landscapes on spaces of trees

Applied Mathematics and Computation
Some Notes on the Nearest Neighbour Interchange Distance

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A 3-approximation algorithm for the subtree distance between phylogenies

Journal of Discrete Algorithms

Walks on SPR Neighborhoods

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hamiltonian Walks of Phylogenetic Treespaces

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove that the spaces of unrooted phylogenetic trees are Hamiltonian for two popular search metrics: Subtree Prune and Regraft (SPR) and Tree Bisection and Reconnection (TBR). Further, we make progress on two conjectures of Bryant on searching phylogenetic treespace: treespace under the Nearest Neighbor Interchange (NNI) metric has a 2-walk, and there exist SPR neighborhoods without complete NNI walks.