The following pages link to Algorithms and Computation (Q5712135):
Displaying 12 items.
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Comparing similar ordered trees in linear-time (Q925064) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- (Q4432975) (← links)
- (Q4547753) (← links)
- A Comparison of Many Max-tree Computation Algorithms (Q4925097) (← links)
- Combinatorial Pattern Matching (Q5315356) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)