Pages that link to "Item:Q620949"
From MaRDI portal
The following pages link to Exact algorithms for computing the tree edit distance between unordered trees (Q620949):
Displaying 14 items.
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- An edit distance between quotiented trees (Q1402214) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Covering tree with stars (Q2354301) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- (Q5091018) (← links)
- Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
