Pages that link to "Item:Q5428805"
From MaRDI portal
The following pages link to An Optimal Decomposition Algorithm for Tree Edit Distance (Q5428805):
Displayed 18 items.
- A survey on tree matching and XML retrieval (Q394973) (← links)
- Approximate joins for XML at label level (Q507755) (← links)
- Fast RNA structure alignment for crossing input structures (Q533402) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes (Q627175) (← links)
- Finding common RNA pseudoknot structures in polynomial time (Q655437) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A theory of subtree matching and tree kernels based on the edit distance concept (Q906000) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Faster algorithms for guided tree edit distance (Q975465) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Covering tree with stars (Q2354301) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Algorithms for local similarity between forests (Q2436665) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- Fast RNA Structure Alignment for Crossing Input Structures (Q3637116) (← links)
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes (Q5901383) (← links)