+ Site Statistics
+ Search Articles
+ PDF Full Text Service
How our service works
Request PDF Full Text
+ Follow Us
Follow on Facebook
Follow on Twitter
Follow on LinkedIn
+ Subscribe to Site Feeds
Most Shared
PDF Full Text
+ Translate
+ Recently Requested

A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance



A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance



Journal of Computational Biology 18(5): 743-757



Rooted, leaf-labeled trees are used in biology to represent hierarchical relationships of various entities, most notably the evolutionary history of molecules and organisms. Rooted Subtree Prune and Regraft (rSPR) operation is a tree rearrangement operation that is used to transform a tree into another tree that has the same set of leaf labels. The minimum number of rSPR operations that transform one tree into another is denoted by d(rSPR) and gives a measure of dissimilarity between the trees, which can be used to compare trees obtained by different approaches, or, in the context of phylogenetic analysis, to detect horizontal gene transfer events by finding incongruences between trees of different evolving characters. The problem of computing the exact d(rSPR) measure is NP-hard, and most algorithms resort to finding sequences of rSPR operations that are sufficient for transforming one tree into another, thereby giving upper bound heuristics for the distance. In this article, we present an O(n⁴) recursive algorithm D-Clust that gives both lower bound and upper bound heuristics for the distance between trees with n shared leaves and also gives a sequence of operations that transforms one tree into another. Our experiments on simulated pairs of trees containing up to 100 leaves showed that the two bounds are almost equal for small distances, thereby giving the nearly-precise actual value, and that the upper bound tends to be close to the upper bounds given by other approaches for all pairs of trees.

Please choose payment method:






(PDF emailed within 0-6 h: $19.90)

Accession: 051213553

Download citation: RISBibTeXText

PMID: 21166560

DOI: 10.1089/cmb.2010.0045


Related references

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance. Annals of Combinatorics 8(4): 409-423, 2005

Supertrees Based on the Subtree Prune-and-Regraft Distance. Systematic Biology 63(4): 566-581, 2014

Calculating the Unrooted Subtree Prune-and-Regraft Distance. Ieee/Acm Transactions on Computational Biology and Bioinformatics 2018:, 2018

A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25(2): 190-196, 2009

On Hill et al's conjecture for calculating the subtree prune and regraft distance between phylogenies. Bmc Evolutionary Biology 10: 334, 2010

Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees. Cladistics 32(1): 82-89, 2016

Properties of Subtree-Prune-and-Regraft Operations on Totally-Ordered Phylogenetic Trees. Annals of Combinatorics 10(1): 147-163, 2006

Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks. Journal of Theoretical Biology 423: 1-12, 2017

Lower bounds for the polynomial calculus and the Grbner basis algorithm. Computational Complexity 8(2): 127-144, 1999

A polynomial time algorithm for computing the area under a GDT curve. Algorithms for Molecular Biology 10: 27, 2015

An optimal algorithm for computing all subtree repeats in trees. Philosophical Transactions. Series A Mathematical Physical and Engineering Sciences 372(2016): 20130140, 2014

Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. Journal of Combinatorial Optimization 33(1): 28-34, 2017

A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms for Molecular Biology 6: 15, 2011

A polynomial-time algorithm for computing characteristic strings under a set of strings. Systems and Computers in Japan 26(3): 30-38, 1995

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. Bmc Bioinformatics 14(Suppl. 2): S18, 2013