The Tree-to-Tree Correction Problem
From MaRDI portal
Publication:4197350
DOI10.1145/322139.322143zbMath0409.68040OpenAlexW1975009259MaRDI QIDQ4197350
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
Related Items
Which XML schemas are streaming bounded repairable?, Constrained tree editing, Statistical shape analysis of simplified neuronal trees, A VLSI algorithm for calculating the tree to tree distance, Algebraic dynamic programming on trees, A relation between edit distance for ordered trees and edit distance for Euler strings, Approximating tree edit distance through string edit distance, Reeb graphs of curves are stable under function perturbations, Algorithms for approximate graph matching, A similarity measure for graphs with low computational complexity, A constrained edit distance between unordered labeled trees, A metric normalization of tree edit distance, Tai mapping hierarchy for rooted labeled trees through common subforest, TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE, Fast similarity search for graphs by edit distance, A survey on tree matching and XML retrieval, Exact algorithms for computing the tree edit distance between unordered trees, Multi-label classification and extracting predicted class hierarchies, A metric for rooted trees with unlabeled vertices based on nested parentheses, On the hardness of computing the edit distance of shallow trees, Fast Algorithms for Computing Tree LCS, Automated methods for the comparison of natural languages, Unnamed Item, Inexact tree pattern matching with 1-degree edit distance using finite automata, Anti Tai mapping for unordered labeled trees, A theory of subtree matching and tree kernels based on the edit distance concept, A modified tree-to-tree correction problem, Mining approximate patterns with frequent locally optimal occurrences, Algorithms for local similarity between forests, Efficient chaining of seeds in ordered trees, Efficient exponential-time algorithms for edit distance between unordered trees, Tree edit distance and maximum agreement subtree, An overview on XML similarity: background, current trends and future directions, RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm., Local similarity between quotiented ordered trees, Comparing similar ordered trees in linear-time, Space efficient algorithms for ordered tree comparison, Identifying approximately common substructures in trees based on a restricted edit distance, Property testing of regular tree languages, Alignment of trees -- an alternative to tree edit, Approximate joins for XML at label level, Forest Alignment with Affine Gaps and Anchors, Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees, Developmental graphs comparison strategy for analysis of pattern formation and phylogeny, Fifty years of graph matching, network alignment and network comparison, On the editing distance between unordered labeled trees, A comparative analysis of multidimensional features of objects resembling sets of graphs, Finding similar consensus between trees: An algorithm and a distance hierarchy, Algorithms for finding a most similar subforest, Identifying consensus of trees through alignment, 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, A survey on tree edit distance and related problems, An improved algorithm for tree edit distance with applications for RNA secondary structure comparison, Data mining in an engineering design environment: OR applications from graph matching, Unnamed Item, Unnamed Item, A new algorithm for computing similarity between RNA structures, Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition, Fast algorithms for computing tree LCS, A new constrained edit distance between quotiented ordered trees, New and improved algorithms for unordered tree inclusion, A string matching based algorithm for performance evaluation of mathematical expression recognition, Alignment distance of regular tree languages, Alignment distance of regular tree languages, Homeomorphic Alignment of Edge-Weighted Trees, A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression., FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES, Decomposition algorithms for the tree edit distance problem, On the complexity of finding a largest common subtree of bounded degree, Computing similarity between RNA structures, Linear-time algorithms for the subpath kernel
