Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Space efficient algorithms for ordered tree comparison
- Learning probabilistic models of tree edit distance
- Tractable and intractable variations of unordered tree edit distance
- On the hardness of computing the edit distance of shallow trees
- Approximate joins for XML at label level
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
- On the complexity of comparing evolutionary trees
- An edit distance between quotiented trees
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
- Edit distance between unlabeled ordered trees
- Reconstructing trees from traces
- Algebraic dynamic programming on trees
- An optimal decomposition algorithm for tree edit distance
- Approximate XML structure validation based on document-grammar tree similarity
- scientific article; zbMATH DE number 1972679 (Why is no real title available?)
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- A survey on tree matching and XML retrieval
- An overview on XML similarity: background, current trends and future directions
- Identifying consensus of trees through alignment
- Comparative assessment of alignment algorithms for NGS data: features, considerations, implementations, and future
- Improving strategic decisions in sequential games by exploiting positional similarity
- An Optimal Decomposition Algorithm for Tree Edit Distance
- Algorithms for local similarity between forests
- Algorithms for finding a most similar subforest
- Approximation of RNA multiple structural alignment
- Graph embedding using tree edit-union
- Recursive tree grammar autoencoders
- Supervised classification and mathematical optimization
- Approximating tree edit distance through string edit distance
- Finding approximate patterns in undirected acyclic graphs
- scientific article; zbMATH DE number 1844616 (Why is no real title available?)
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- On the similarity metric and the distance metric
- Comparing similar ordered trees in linear-time
- Approximation of trees by self-nested trees
- scientific article; zbMATH DE number 826058 (Why is no real title available?)
- A survey of graph edit distance
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm
- Finding common structured patterns in linear graphs
- Faster algorithms for guided tree edit distance
- Segmental mapping and distance for rooted labeled ordered trees
- A survey on tree edit distance and related problems
- Approximate matching for two families of trees
- Normalization of edit sequences for text synchronization
- scientific article; zbMATH DE number 2062653 (Why is no real title available?)
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Algorithms and Computation
- An efficient algorithm for some tree matching problems
- A relation between edit distance for ordered trees and edit distance for Euler strings
- The Bourque distances for mutation trees of cancers
- Computing similarity between RNA structures
- Development and analysis of a sentence semantics representation model
- Efficient computation of the tree edit distance
- Fast algorithms for the unit cost editing distance between trees
- Comparing trees via crossing minimization
- Tree edit distance with gaps
- Extending E prover with similarity based clause selection strategies
- Resequencing a set of strings based on a target string
- Finding smallest supertrees
- Computing approximate tree edit distance using relaxation labeling
- Fast algorithms for computing tree LCS
- A new algorithm for computing similarity between RNA structures
- Dissimilarity between two skeletal trees in a context
- A constrained edit distance algorithm between semi-ordered trees
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Efficient chaining of seeds in ordered trees
- Sublinear DTD validity
- Caterpillar alignment distance for rooted labeled caterpillars: distance based on alignments required to be caterpillars
- Fast Algorithms for Computing Tree LCS
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
- A new constrained edit distance between quotiented ordered trees
- Tree edit distance and maximum agreement subtree
- Membrane Computing
- A string matching based algorithm for performance evaluation of mathematical expression recognition
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Decomposition algorithms for the tree edit distance problem
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
- A constrained edit distance between unordered labeled trees
- New algorithm for ordered tree-to-tree correction problem
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Algorithms for approximate graph matching
- Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
- Computer Vision - ECCV 2004
- Segmental mapping and distance for rooted labeled ordered trees
- Constrained tree editing
- Numerical similarity and dissimilarity measures between two trees
- Some MAX SNP-hard results concerning unordered labeled trees
- Combinatorial Pattern Matching
- Forest Alignment with Affine Gaps and Anchors
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
- A theory of subtree matching and tree kernels based on the edit distance concept
- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
- On the editing distance between unordered labeled trees
- scientific article; zbMATH DE number 2185644 (Why is no real title available?)
- Alignment of trees -- an alternative to tree edit
This page was built for publication: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034830)
