The Tree-to-Tree Correction Problem
From MaRDI portal
Publication:4197350
DOI10.1145/322139.322143zbMATH Open0409.68040OpenAlexW1975009259MaRDI QIDQ4197350FDOQ4197350
Authors: K. C. Tai 
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322139.322143
Cited In (75)
- Identifying consensus of trees through alignment
- A survey on tree matching and XML retrieval
- An overview on XML similarity: background, current trends and future directions
- Algorithms for finding a most similar subforest
- Approximating tree edit distance through string edit distance
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- A similarity measure for graphs with low computational complexity
- Which XML schemas are streaming bounded repairable?
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Comparing similar ordered trees in linear-time
- Title not available (Why is that?)
- Homeomorphic alignment of weighted trees
- Faster algorithms for guided tree edit distance
- Improved approximation of the largest common subtree of two unordered trees of bounded height
- Fifty years of graph matching, network alignment and network comparison
- A survey on tree edit distance and related problems
- Edit distance between unrooted trees in cubic time
- A relation between edit distance for ordered trees and edit distance for Euler strings
- Computing similarity between RNA structures
- Developmental graphs comparison strategy for analysis of pattern formation and phylogeny
- A new algorithm for computing similarity between RNA structures
- Fast algorithms for computing tree LCS
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Efficient chaining of seeds in ordered trees
- A modified tree-to-tree correction problem
- A new constrained edit distance between quotiented ordered trees
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- Tree edit distance and maximum agreement subtree
- A string matching based algorithm for performance evaluation of mathematical expression recognition
- Decomposition algorithms for the tree edit distance problem
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Data mining in an engineering design environment: OR applications from graph matching
- A constrained edit distance between unordered labeled trees
- On the complexity of finding a largest common subtree of bounded degree
- Algorithms for approximate graph matching
- Exact algorithms for computing the tree edit distance between unordered trees
- Multi-label classification and extracting predicted class hierarchies
- Property testing of regular tree languages
- New and improved algorithms for unordered tree inclusion
- Constrained tree editing
- Forest Alignment with Affine Gaps and Anchors
- Homeomorphic Alignment of Edge-Weighted Trees
- A theory of subtree matching and tree kernels based on the edit distance concept
- Mining approximate patterns with frequent locally optimal occurrences
- On the editing distance between unordered labeled trees
- Alignment of trees -- an alternative to tree edit
- Reeb graphs of curves are stable under function perturbations
- Identifying approximately common substructures in trees based on a restricted edit distance
- Fast similarity search for graphs by edit distance
- Local similarity between quotiented ordered trees
- Efficient exponential-time algorithms for edit distance between unordered trees
- A metric normalization of tree edit distance
- A VLSI algorithm for calculating the tree to tree distance
- Space efficient algorithms for ordered tree comparison
- Approximate joins for XML at label level
- Statistical shape analysis of simplified neuronal trees
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
- Algebraic dynamic programming on trees
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Title not available (Why is that?)
- Algorithms for local similarity between forests
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- Automated methods for the comparison of natural languages
- Linear-time algorithms for the subpath kernel
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- Fast Algorithms for Computing Tree LCS
- Anti Tai mapping for unordered labeled trees
- Tai mapping hierarchy for rooted labeled trees through common subforest
- Weighted edit distance computation: strings, trees, and Dyck
- Inexact tree pattern matching with 1-degree edit distance using finite automata
- On the hardness of computing the edit distance of shallow trees
- Tractable and intractable variations of unordered tree edit distance
- Generation of algebraic data type values using evolutionary algorithms
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
This page was built for publication: The Tree-to-Tree Correction Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197350)
