Sibling Distance for Rooted Labeled Trees

Authors:
Taku Aratsu;Kouichi Hirata;Tetsuji Kuboyama
Affiliations:
Graduate School of Computer Science and Systems Engineering,;Department of Artificial Intelligence, Kyushu Institute of Technology, Iizuka, Japan 820-8502;Computer Center, Gakushuin University, Tokyo, Japan 171-8588
Venue:
New Frontiers in Applied Data Mining
Year:
2009

Citing 11
Cited 1

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
On the editing distance between unordered labeled trees

Information Processing Letters
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
Similarity evaluation on tree-structured data

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Approximate matching of hierarchical data using pq-grams

VLDB '05 Proceedings of the 31st international conference on Very large data bases
A survey on tree edit distance and related problems

Theoretical Computer Science
A relation between edit distance for ordered trees and edit distance for Euler strings

Information Processing Letters
An efficient unordered tree kernel and its application to glycan classification

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
The q-gram distance for ordered unlabeled trees

DS'05 Proceedings of the 8th international conference on Discovery Science
An optimal decomposition algorithm for tree edit distance

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a sibling distance Δ s for rooted labeled trees as an L 1-distance between their sibling histograms, which consist of the frequencies of every pair of the label of a node and the sequence of labels of its children. Then, we show that Δ s gives a constant factor lower bound on the tree edit distance Δ such that Δ s (T 1,T 2) ≤ 4Δ(T 1,T 2). Next, we design the algorithm to compute the sibling histogram in O(n) time for ordered trees and in O(gn) time for unordered trees, where n and g are the number of nodes and the degree of a tree. Finally, we give experimental results by applying the sibling distance to glycan data.