Pages that link to "Item:Q2746431"
From MaRDI portal
The following pages link to New algorithm for ordered tree-to-tree correction problem (Q2746431):
Displaying 11 items.
- A survey on tree matching and XML retrieval (Q394973) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840) (← links)
- Faster algorithms for guided tree edit distance (Q975465) (← links)
- Further comments on the subtree isomorphism for ordered trees (Q1183481) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. (Q5090362) (← links)