论文信息 - On the Complexity of uSPR Distance

On the Complexity of uSPR Distance

We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel on the preservation of uSPR distance under chain reduction, improving on lower bounds of Hickey et al..

Maria Luisa Bonet | Katherine St. John | K. S. John

[1] Charles Semple,et al. A 3-approximation algorithm for the subtree distance between phylogenies , 2008, J. Discrete Algorithms.

[2] Glenn Hickey,et al. SPR Distance Computation for Unrooted Trees , 2008, Evolutionary bioinformatics online.

[3] Catherine McCartin,et al. A Faster FPT Algorithm for the Maximum Agreement Forest Problem , 2007, Theory of Computing Systems.

[4] Maria Luisa Bonet,et al. Approximating Subtree Distances Between Phylogenies , 2006, J. Comput. Biol..

[5] M. Steel,et al. Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .

[6] Tao Jiang,et al. On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..

[7] C. Zmasek. Phylogenetic Inference , 2011, Encyclopedia of Parallel Computing.

[8] Charles Semple,et al. On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .