Pages that link to "Item:Q845840"
From MaRDI portal
The following pages link to A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840):
Displaying 7 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Approximate joins for XML at label level (Q507755) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes (Q5901383) (← links)
