The following pages link to On finding common subtrees (Q1208722):
Displaying 14 items.
- Longest common extensions in trees (Q294947) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- An optimal algorithm for computing all subtree repeats in trees (Q2955638) (← links)
- About the largest subtree common to several X-trees (Q3010530) (← links)
- (Q3476826) (← links)
- (Q3976605) (← links)
- Finding largest common embeddable subtrees (Q4596639) (← links)
- Increasing the efficiency of automated theorem proving (Q4835513) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)