Computing the edit-distance between unrooted ordered trees
From MaRDI portal
Recommendations
Cited in
(49)- On the editing distance between unordered labeled trees
- Constrained tree editing
- A VLSI algorithm for calculating the tree to tree distance
- An edit distance between quotiented trees
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
- Computing similarity between RNA structures
- Improved methods for computing distances between unordered trees using integer programming
- Tree edit distance with gaps
- Good edit similarity learning by loss minimization
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Generalized LCS
- Approximating tree edit distance through string edit distance
- Efficient exponential-time algorithms for edit distance between unordered trees
- Decomposition algorithms for the tree edit distance problem
- New algorithm for ordered tree-to-tree correction problem
- Segmental mapping and distance for rooted labeled ordered trees
- New dissimilarity measure for recognizing noisy subsequence trees
- scientific article; zbMATH DE number 2127737 (Why is no real title available?)
- Edit distance between unlabeled ordered trees
- Fast Algorithms for Computing Tree LCS
- Fast RNA Structure Alignment for Crossing Input Structures
- A survey on tree matching and XML retrieval
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- Segmental mapping and distance for rooted labeled ordered trees
- Edit distance between unrooted trees in cubic time
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- Fast RNA structure alignment for crossing input structures
- Algorithms for finding a most similar subforest
- A survey on tree edit distance and related problems
- Combinatorial Pattern Matching
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
- A new algorithm for computing similarity between RNA structures
- On the hardness of computing the edit distance of shallow trees
- Weighted edit distance computation: strings, trees, and Dyck
- Sum-of-max chain partition of a tree
- Approximate Cartesian tree pattern matching
- Approximate Cartesian tree pattern matching
- Faster algorithms for bounded tree edit distance
- Fast algorithms for computing tree LCS
- Faster algorithm for bounded tree edit distance in the low-distance regime
- A relation between edit distance for ordered trees and edit distance for Euler strings
- A theory of subtree matching and tree kernels based on the edit distance concept
- Comparing similar ordered trees in linear-time
- Space efficient algorithms for ordered tree comparison
- Learning probabilistic models of tree edit distance
- 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
This page was built for publication: Computing the edit-distance between unrooted ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252025)
