An optimal algorithm for computing all subtree repeats in trees (Q2870033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for computing all subtree repeats in trees |
scientific article; zbMATH DE number 6247334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for computing all subtree repeats in trees |
scientific article; zbMATH DE number 6247334 |
Statements
An Optimal Algorithm for Computing All Subtree Repeats in Trees (English)
0 references
17 January 2014
0 references
0.9901067018508912
0 references
0.8916813731193542
0 references
0.8000661134719849
0 references
0.7964299321174622
0 references
0.7922943830490112
0 references
