On the Complexity of uSPR Distance

Authors:
Maria Luisa Bonet;Katherine St. John
Affiliations:
Universitat Politècnica de Catalunya (UPC), Barcelona;City University of New York (CUNY), Bronx
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2010

Citing 3
Cited 1

On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
A Faster FPT Algorithm for the Maximum Agreement Forest Problem

Theory of Computing Systems
A 3-approximation algorithm for the subtree distance between phylogenies

Journal of Discrete Algorithms

A quadratic kernel for computing the hybridization number of multiple trees

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [9] on the preservation of uSPR distance under chain reduction, improving on lower bounds of Hickey et al. [7].