Who is Who in Phylogenetic Networks

Publication no #2072   Type :   Html | Bib | Both

Created: 2011-01-03 10:18:47     Modified: 2011-06-18 00:59:09

2072 Lavanya Kannan, Hua Li and Arcady Mushegian. A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance. In JCB, Vol. 18(5):743-757, 2011. Keywords: bound, minimum number, polynomial, SPR distance. Note: http://dx.doi.org/10.1089/cmb.2010.0045.         Toggle abstract "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 drSPR 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(n4) 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. © Copyright 2011, Mary Ann Liebert, Inc. 2011." @Article{KLM2011,       AUTHOR = {Kannan, Lavanya and Li, Hua and Mushegian, Arcady},       TITLE = {A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance},       YEAR = {2011},       JOURNAL = {JCB},       VOLUME = {18},       NUMBER = {5},       PAGES = {743-757},       URL = {http://dx.doi.org/10.1089/cmb.2010.0045},       NOTE = {http://dx.doi.org/10.1089/cmb.2010.0045},       KEYWORDS = {bound, minimum number, polynomial, SPR distance} }