Sciweavers

79 search results - page 1 / 16
» The pq-gram distance between ordered labeled trees
Sort
View
VLDB
2005
ACM
104views Database» more  VLDB 2005»
13 years 10 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
TODS
2010
51views more  TODS 2010»
13 years 3 months ago
The pq-gram distance between ordered labeled trees
Nikolaus Augsten, Michael H. Böhlen, Johann G...
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
13 years 9 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
IDEAL
2007
Springer
13 years 11 months ago
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, T...
JCB
2006
115views more  JCB 2006»
13 years 5 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger