The following pages link to The tree-to-tree editing problem (Q1251477):
Displaying 32 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- Recent advances in graph-based pattern recognition with applications in document analysis (Q632592) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Fuzzy trees in decision support systems (Q858359) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Local similarity between quotiented ordered trees (Q924539) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- Learning probabilistic models of tree edit distance (Q931691) (← links)
- Homeomorphic alignment of weighted trees (Q975210) (← links)
- A new constrained edit distance between quotiented ordered trees (Q1013074) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- A modified tree-to-tree correction problem (Q1152712) (← links)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Constrained tree editing (Q1328503) (← links)
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm. (Q1426469) (← links)
- Statistical shape analysis of simplified neuronal trees (Q1620982) (← links)
- An inductive characterization of matching in binding bigraphs (Q1941899) (← links)
- Good edit similarity learning by loss minimization (Q1945121) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Selected tree classifier combination based on both accuracy and error diversity (Q2485044) (← links)
- Decomposition algorithms for the tree edit distance problem (Q2569420) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
- Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- Matching of Bigraphs (Q2867883) (← links)
- TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
- Homeomorphic Alignment of Edge-Weighted Trees (Q3637696) (← links)
- A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. (Q5090362) (← links)
- Automated methods for the comparison of natural languages (Q6163813) (← links)
