On the complexity of uSPR distance.

IEEE/ACM Trans Comput Biol Bioinform

Lenguajes y Sistemas Informaticos, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain.

Published: December 2010

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.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TCBB.2008.132DOI Listing

Publication Analysis

Top Keywords

uspr distance
12
complexity uspr
4
distance
4
distance subtree
4
subtree prune
4
prune regraft
4
regraft uspr
4
distance unrooted
4
unrooted trees
4
trees fixed
4

Similar Publications

On the complexity of uSPR distance.

IEEE/ACM Trans Comput Biol Bioinform

December 2010

Lenguajes y Sistemas Informaticos, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain.

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.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!