title: On the complexity of uSPR distance.
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 on the preservation of uSPR distance under chain reduction, improving on lower bounds of Hickey et al.
authors.affiliation: Lenguajes y Sistemas Informaticos, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain. bonet@lsi.upc.edu
authors.forename: Maria Luisa
authors.initials: ML
authors.lastname: Bonet
authors.forename: Katherine
authors.initials: K
authors.lastname: St John
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D008957:Models, Genetic; D008962:Models, Theoretical; D010802:Phylogeny