Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees

2011 ◽  
pp. 402-415 ◽  
Author(s):  
Kouichi Hirata ◽  
Yoshiyuki Yamamoto ◽  
Tetsuji Kuboyama
Keyword(s):  
Edit Distance ◽  
Unordered Trees

XML SCHEMA MATCHING

2007 ◽  
Vol 17 (05) ◽  
pp. 575-597 ◽  
Author(s):  
JIANGUO LU ◽  
JU WANG ◽  
SHENGRUI WANG
Keyword(s):  
Data Integration ◽  
Software Reuse ◽  
Edit Distance ◽  
Xml Schema ◽  
Schema Matching ◽  
Schema Evolution ◽  
Tree Edit Distance ◽  
Matching Problem ◽  
Matching Algorithm ◽  
Unordered Trees

XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching system that can find accurate matches and scales to large XML Schemas with hundreds of nodes. In our system, XML Schemas are modeled as labeled and unordered trees, and the schema matching problem is turned into a tree matching problem. We proposed Approximate Common Structures in trees, and developed a tree matching algorithm based on this concept. Compared with the traditional tree edit-distance algorithm and other schema matching systems, our algorithm is faster and more suitable for large XML Schema matching.

scholarly journals Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

2013 ◽  
Vol 470 ◽  
pp. 10-22 ◽  
Author(s):  
Tatsuya Akutsu ◽  
Daiji Fukagawa ◽  
Magnús M. Halldórsson ◽  
Atsuhiro Takasu ◽  
Keisuke Tanaka
Keyword(s):  
Edit Distance ◽  
Parameterized Algorithms ◽  
Unordered Trees

scholarly journals A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees

2012 ◽  
Vol 19 (10) ◽  
pp. 1089-1104 ◽  
Author(s):  
Tomoya Mori ◽  
Takeyuki Tamura ◽  
Daiji Fukagawa ◽  
Atsuhiro Takasu ◽  
Etsuji Tomita ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Edit Distance ◽  
Unordered Trees

scholarly journals A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures

2011 ◽  
Vol 12 (Suppl 1) ◽  
pp. S13 ◽  
Author(s):  
Daiji Fukagawa ◽  
Takeyuki Tamura ◽  
Atsuhiro Takasu ◽  
Etsuji Tomita ◽  
Tatsuya Akutsu
Keyword(s):  
Edit Distance ◽  
Unordered Trees

Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees

2006 ◽  
Vol 13 (6) ◽  
pp. 1165-1176 ◽  
Author(s):  
Yair Horesh ◽  
Ramit Mehr ◽  
Ron Unger
Keyword(s):  
Edit Distance ◽  
A Algorithm ◽  
Unordered Trees
Sign in / Sign up

Export Citation Format

Share Document