Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: binary tree code

Sortuj według:

Ogranicz wyniki do:

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

Aratsu T., Hirata K., Kuboyama T.

Fundamenta Informaticae

2010

Vol. 101, nr 3

157-171

This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2≤τ≤(h+1)σ+h, where τ is the tree edit distance between trees, and is the string edit distance between their binary tree codes and h is the minimum height of the trees.