Sciweavers

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

36

IJAC
2007

favoriteEmaildiscussreport

89views more IJAC 2007»

Bounding Right-Arm Rotation Distances

13 years 10 months ago

Bounding Right-Arm Rotation Distances

Download www.crm.es

Abstract. Rotation distance quantiﬁes the diﬀerence in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a ﬁxed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson’s group F with respect to diﬀerent generating sets, including both ﬁnite and inﬁnite generating sets.

Sean Cleary, Jennifer Taback

Real-time Traffic

Binary Trees | IJAC 2007 | Minimum Number | Rotation Distance |

claim paper

Related Content

» Restricted rotation distance between binary trees

» An efficient upper bound of the rotation distance of binary trees

» An EnvelopeBased Approach to RotationInvariant Boundary Image Matching

» Rotation invariant distance measures for trajectories

» Incidences in three dimensions and distinct distances in the plane

» Dynamicsaware similarity of moving objects trajectories

» FullyAutomatic Correction of the Erroneous Border Areas of an Aneurysm

» UnlevelSets Geometry and PriorBased Segmentation

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	IJAC
Authors	Sean Cleary, Jennifer Taback

Comments (0)