Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Fast parallel and serial approximate string matching
Journal of Algorithms
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms
Nonlinear pattern matching in trees
Journal of the ACM (JACM)
On the editing distance between unordered labeled trees
Information Processing Letters
On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters
Approximate tree matching in the presence of variable length don't cares
Journal of Algorithms
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Change detection in hierarchically structured information
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Meaningful change detection in structured data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Pattern matching algorithms
More efficient algorithm for ordered tree inclusion
Journal of Algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New algorithm for ordered tree-to-tree correction problem
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
A System for Approximate Tree Matching
IEEE Transactions on Knowledge and Data Engineering
On the Approximation of Largest Common Subtrees and Largest Common Point Sets
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
ATreeGrep: Approximate Searching in Unordered Trees
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Parallel Algorithms for Tree Editing Problems
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A New Algorithm for the Ordered Tree Inclusion Problem
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Lecture notes on approximation algorithms: Volume I
Lecture notes on approximation algorithms: Volume I
Approximation Algorithms for the Largest Common Subtree Problem.
Approximation Algorithms for the Largest Common Subtree Problem.
A New Measure of the Distance between Ordered Trees and its Applications
A New Measure of the Distance between Ordered Trees and its Applications
The editing distance between trees: algorithms and applications
The editing distance between trees: algorithms and applications
Optimal constituent alignment with edge covers for semantic projection
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A relation between edit distance for ordered trees and edit distance for Euler strings
Information Processing Letters
Tree Structure for Contractible Regions in R3
International Journal of Computer Vision
Visualizing Changes of Hierarchical Data using Treemaps
IEEE Transactions on Visualization and Computer Graphics
Change Distilling: Tree Differencing for Fine-Grained Source Code Change Extraction
IEEE Transactions on Software Engineering
Relevance measures for XML information retrieval
International Journal of Web and Grid Services
Learning probabilistic models of tree edit distance
Pattern Recognition
Learning Metrics Between Tree Structured Data: Application to Image Recognition
ECML '07 Proceedings of the 18th European conference on Machine Learning
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Efficient Similarity Search for Tree-Structured Data
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Deriving and Mining Spatiotemporal Event Schemas in In-Situ Sensor Data
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
SEDiL: Software for Edit Distance Learning
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Visualizing and Evaluating Complexity of Textual Case Bases
ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
Deriving input syntactic structure from execution
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Theoretical Computer Science
Improved approximation of the largest common subtree of two unordered trees of bounded height
Information Processing Letters
GAIML: A new language for verbal and graphical interaction in chatbots
Mobile Information Systems - Information Assurance and Advanced Human-Computer Interfaces
On Measuring Process Model Similarity Based on High-Level Change Operations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A Tree Distance Function Based on Multi-sets
New Frontiers in Applied Data Mining
Sibling Distance for Rooted Labeled Trees
New Frontiers in Applied Data Mining
A Visual Technique for Web Pages Comparison
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for fine-grained data integration and curation, with provenance, in a dataspace
TAPP'09 First workshop on on Theory and practice of provenance
On exploiting the power of time in data mining
ACM SIGKDD Explorations Newsletter
Robust web extraction: an approach based on a probabilistic tree-edit model
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Split-Order Distance for Clustering and Classification Hierarchies
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Orthographic similarity search for dictionary lookup of Japanese words
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
ICWE '9 Proceedings of the 9th International Conference on Web Engineering
Type-safe diff for families of datatypes
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Measuring and predicting orthographic associations: modelling the similarity of Japanese kanji
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Efficient change control of XML documents
Proceedings of the 9th ACM symposium on Document engineering
Fast algorithms for computing tree LCS
Theoretical Computer Science
Similarity Evaluation of XML Documents Based on Weighted Element Tree Model
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Tree-Based Microaggregation for the Anonymization of Search Logs
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
Incremental Learning and Memory Consolidation of Whole Body Human Motion Primitives
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Analysis of tree edit distance on XML data
CIIT '07 The Sixth IASTED International Conference on Communications, Internet, and Information Technology
Extensible User-Based XML Grammar Matching
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Customizable and upgradable enterprise systems without the crystal ball assumption
EDOC'09 Proceedings of the 13th IEEE international conference on Enterprise Distributed Object Computing
Estimating topological distances based on end-to-end path sharing
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Semantic-based Merging of RSS Items
World Wide Web
A new dissimilarity measure between trees by decomposition of unit-cost edit distance
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Comparing trees via crossing minimization
Journal of Computer and System Sciences
An automatic HTTP cookie management system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tag tree template for Web information and schema extraction
Expert Systems with Applications: An International Journal
Can recognising multiword expressions improve shallow parsing?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Tree edit models for recognizing textual entailments, paraphrases, and answers to questions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Diffing, patching and merging XML documents: toward a generic calculus of editing deltas.
Proceedings of the 10th ACM symposium on Document engineering
NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications
Proceedings of the 17th ACM conference on Computer and communications security
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
Fundamenta Informaticae
Indexing tree and subtree by using a structure network
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
New partially labelled tree similarity measure: a case study
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Approximate joins for XML using g-string
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Measuring tree similarity for natural language processing based information retrieval
NLDB'10 Proceedings of the Natural language processing and information systems, and 15th international conference on Applications of natural language to information systems
Determining the best suited semantic events for cognitive surveillance
Expert Systems with Applications: An International Journal
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science
pq-hash: an efficient method for approximate XML joins
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Augmenting video surveillance footage with virtual agents for incremental event evaluation
Pattern Recognition Letters
A metric normalization of tree edit distance
Frontiers of Computer Science in China
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
XML data clustering: An overview
ACM Computing Surveys (CSUR)
Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis
Genetic Programming and Evolvable Machines
Selecting peers for execution comparison
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Machine translation system combination by confusion forest
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Improved MAX SNP-hard results for finding an edit distance between unordered trees
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A distance for partially labeled trees
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Dissimilarity-based classification of anatomical tree structures
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
A generic calculus of XML editing deltas
Proceedings of the 11th ACM symposium on Document engineering
Dynamic programming algorithms for efficiently computing cosegmentations between biological images
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Intelligent self-repairable web wrappers
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Learning stochastic tree edit distance
ECML'06 Proceedings of the 17th European conference on Machine Learning
RTED: a robust algorithm for the tree edit distance
Proceedings of the VLDB Endowment
A theoretical analysis of alignment and edit problems for trees
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
No tag, a little nesting, and great XML keyword search
AIRS'06 Proceedings of the Third Asia conference on Information Retrieval Technology
Operation-based, fine-grained version control model for tree-based representation
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Space efficient algorithms for ordered tree comparison
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Comparing trees via crossing minimization
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A comparative survey of business process similarity measures
Computers in Industry
Evaluating dependency parsing: robust and heuristics-free cross-nnotation evaluation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Discovery and diagnosis of behavioral transitions in patient event streams
ACM Transactions on Management Information Systems (TMIS)
Web Semantics: Science, Services and Agents on the World Wide Web
The q-gram distance for ordered unlabeled trees
DS'05 Proceedings of the 8th international conference on Discovery Science
Comparing approaches to implement feature model composition
ECMFA'10 Proceedings of the 6th European conference on Modelling Foundations and Applications
Connecting the dots: constructing spatiotemporal episodes from events schemas
Transactions on Computational Science VI
Approximating tree edit distance through string edit distance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Anti-unification algorithms and their applications in program analysis
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
An integrated distance for atoms
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Intuitionistic fuzzy XML query matching
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Normalized similarity of RNA sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
XML document clustering using structure-preserving flat representation of XML content and structure
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
LearnPADS++: incremental inference of ad hoc data formats
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Path queries in weighted trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
XCC: change control of XML documents
Computer Science - Research and Development
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Similarity join on XML based on k-generation set distance
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Enriching domain-specific language models using domain independent WWW n-gram corpus
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Bounded repairability for regular tree languages
Proceedings of the 15th International Conference on Database Theory
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Similarity measure models and algorithms for hierarchical cases
Expert Systems with Applications: An International Journal
A framework for exploring organizational structure in dynamic social networks
Decision Support Systems
Minimizing user effort in XML grammar matching
Information Sciences: an International Journal
Hiding the policy in cryptographic access control
STM'11 Proceedings of the 7th international conference on Security and Trust Management
CAiSE'12 Proceedings of the 24th international conference on Advanced Information Systems Engineering
Plag-Inn: intrinsic plagiarism detection using grammar trees
NLDB'12 Proceedings of the 17th international conference on Applications of Natural Language Processing and Information Systems
Local exact pattern matching for non-fixed RNA structures
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Efficient exponential time algorithms for edit distance between unordered trees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Review: Supervised classification and mathematical optimization
Computers and Operations Research
Cross-framework evaluation for statistical parsing
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Tree-based hybrid machine translation
EACL 2012 Proceedings of the Joint Workshop on Exploiting Synergies between Information Retrieval and Machine Translation (ESIRMT) and Hybrid Approaches to Machine Translation (HyTra)
Inferring the semantic properties of sentences by mining syntactic parse trees
Data & Knowledge Engineering
Efficient search for transformation-based inference
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Joint evaluation of morphological segmentation and syntactic parsing
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
What is the IQ of your data transformation system?
Proceedings of the 21st ACM international conference on Information and knowledge management
Neurocomputing
Succinct data structures for path queries
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Structural similarity evaluation of XML documents based on basic statistics
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Theoretical Computer Science
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Parameter pollution vulnerabilities detection study based on tree edit distance
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Complexity of computing distances between geometric trees
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
PRIB'12 Proceedings of the 7th IAPR international conference on Pattern Recognition in Bioinformatics
XUTools: UNIX commands for processing next-generation structured text
lisa'12 Proceedings of the 26th international conference on Large Installation System Administration: strategies, tools, and techniques
Efficient multidimensional aggregation for large scale monitoring
lisa'12 Proceedings of the 26th international conference on Large Installation System Administration: strategies, tools, and techniques
On Utilizing Web Service Equivalence for Supporting the Composition Life Cycle
International Journal of Web Services Research
Which DTDs are streaming bounded repairable?
Proceedings of the 16th International Conference on Database Theory
Using XML-Based Multicasting to Improve Web Service Scalability
International Journal of Web Services Research
DTD based costs for tree-edit distance in structured information retrieval
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Indexing for subtree similarity-search using edit distance
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Information Systems
Extracting differences between regular tree grammars
Proceedings of the 28th Annual ACM Symposium on Applied Computing
An input-output hidden Markov model for tree transductions
Neurocomputing
Retrieving documents with mathematical content
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Neighborhood-Preserving mapping between trees
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Characterization and analysis of sales data for the semiconductor market: An expert system approach
Expert Systems with Applications: An International Journal
Automated grading of DFA constructions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Natural language inference for arabic using extended tree edit distance with subtrees
Journal of Artificial Intelligence Research
Dimension reduction in principal component analysis for trees
Computational Statistics & Data Analysis
Efficient exponential-time algorithms for edit distance between unordered trees
Journal of Discrete Algorithms
Automated detection of parameter tampering opportunities and vulnerabilities in web applications
Journal of Computer Security
Journal of Combinatorial Optimization
| Hi-index | 5.24 |
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem.