Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

TCBB
2010

favoriteEmaildiscussreport

122views more TCBB 2010»

On the Complexity of uSPR Distance

13 years 2 months ago

On the Complexity of uSPR Distance

Download comet.lehman.cuny.edu

We show that subtree prune and regraft (uSPR) distance on unrooted trees is ﬁxed 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].

Maria Luisa Bonet, Katherine St. John

Real-time Traffic

Hickey Et | Lower Bounds | Subtree Prune | TCBB 2010 |

claim paper

Related Content

» The OneWay Communication Complexity of Hamming Distance

» On the Complexity of Ordinal Clustering

» COFE A Scalable Method for Feature Extraction from Complex Objects

» The Complex Wave Representation of Distance Transforms

» The communication complexity of the Hamming distance problem

» ComplexityDistortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance ...

» On the complexity and approximation of syntenic distance

» Processing Complex Similarity Queries with DistanceBased Access Methods

» A Complex XML Schema to Map the XML Documents of Distance Education Technical Specificatio...

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	TCBB
Authors	Maria Luisa Bonet, Katherine St. John

Comments (0)