Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A Tree System Approach for Fingerprint Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Time-by-Example Query Language for Historical Databases
IEEE Transactions on Software Engineering
Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Query processing techniques in the summary-table-by-example database query language
ACM Transactions on Database Systems (TODS)
OQL: a query language for manipulating object-oriented databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
Query optimization in database and information retrieval systems
Query optimization in database and information retrieval systems
On the editing distance between unordered labeled trees
Information Processing Letters
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
PROBE Spatial Data Modeling and Query Processing in an Image Database Application
IEEE Transactions on Software Engineering
An Efficient Pictorial Database System for PSQL
IEEE Transactions on Software Engineering
Query Processing for Distance Metrics
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
The editing distance between trees: algorithms and applications
The editing distance between trees: algorithms and applications
Creating and querying lexical data bases
ANLC '88 Proceedings of the second conference on Applied natural language processing
Extracting semantic hierarchies from a large on-line dictionary
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Dictionaries, dictionary grammars and dictionary entry parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Structural matching and discovery in document databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Error-Tolerant Retrieval of Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Best-Match Retrieval for Structured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A graphical environment for change detection in structured documents
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Discovering New Knowledge from Graph Data Using Inductive Logic Programming
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient and effective web change detection
Data & Knowledge Engineering
A bag of paths model for measuring structural similarity in Web documents
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Fast structural query with application to chinese treebank sentence retrieval
Proceedings of the 2004 ACM symposium on Document engineering
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A survey on tree edit distance and related problems
Theoretical Computer Science
Feature-based similarity search in graph structures
ACM Transactions on Database Systems (TODS)
Distributed recursive learning for shape recognition through multiscale trees
Image and Vision Computing
Measuring the structural similarity of semistructured documents using entropy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An Exploratory Study of Database Integration Processes
IEEE Transactions on Knowledge and Data Engineering
Elements and principal stages in the design of non-profit websites
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Theories of meaning in schema matching: An exploratory study
Information Systems
A new approach for the creation of a non-profit website with the example of a regional museum
WSEAS Transactions on Information Science and Applications
Split-Order Distance for Clustering and Classification Hierarchies
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
A context-aware service model using a multi-level prediction algorithm in smart home environments
Proceedings of the 2009 International Conference on Hybrid Information Technology
Utilising Task-Patterns in Organisational Process Knowledge Sharing
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Utilising Task-Patterns in Organisational Process Knowledge Sharing
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Peer-to-peer semantic coordination
Web Semantics: Science, Services and Agents on the World Wide Web
Structural and semantic aspects of similarity of Document Type Definitions and XML schemas
Information Sciences: an International Journal
Collaborative information filtering by using categorized bookmarks on the web
INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support
Contextual factors in database integration: a Delphi study
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Incident mining using structural prototypes
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
X-Tree diff+: efficient change detection algorithm in XML documents
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Soundness of schema matching methods
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Measuring structural similarity of semistructured data based on information-theoretic approaches
The VLDB Journal — The International Journal on Very Large Data Bases
Improving XML instances comparison with preprocessing algorithms
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hierarchical clustering of XML documents focused on structural components
Data & Knowledge Engineering
| Hi-index | 0.00 |
Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called approximate-tree-by-example (ATBE), which allows inexact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.