Pages that link to "Item:Q2930275"
From MaRDI portal
The following pages link to An optimal decomposition algorithm for tree edit distance (Q2930275):
Displayed 6 items.
- Efficient chaining of seeds in ordered trees (Q450556) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Efficient Chaining of Seeds in Ordered Trees (Q3000514) (← links)
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)