Sciweavers

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

84

Voted

TODS
2010

51views more TODS 2010»

The pq-gram distance between ordered labeled trees

15 years 2 months ago

The pq-gram distance between ordered labeled trees

Download tods.acm.org

Nikolaus Augsten, Michael H. Böhlen, Johann G

Real-time Traffic

TODS 2010 |

claim paper

Related Content

» Approximate Matching of Hierarchical Data Using pqGrams

» Computing the EditDistance between Unrooted Ordered Trees

» A New Dissimilarity Measure Between Trees by Decomposition of UnitCost Edit Distance

» Designing an A Algorithm for Calculating Edit Distance between RootedUnordered Trees

» Distances between pairs of vertices and vertical profile in conditioned GaltonWatson trees

» Extracting Narrative Timelines as Temporal Dependency Structures

» Labeling trees with a condition at distance two

» Comparison of Additive Trees Using Circular Orders

» Globally Optimal Pixel Labeling Algorithms for Tree Metrics

Post Info
More Details (n/a)

Added	31 Jan 2011
Updated	31 Jan 2011
Type	Journal
Year	2010
Where	TODS
Authors	Nikolaus Augsten, Michael H. Böhlen, Johann Gamper

Comments (0)