Efficient counting of square substrings in a tree (Q2250458)
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: Efficient counting of square substrings in a tree |
scientific article; zbMATH DE number 6313790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient counting of square substrings in a tree |
scientific article; zbMATH DE number 6313790 |
Statements
Efficient counting of square substrings in a tree (English)
0 references
7 July 2014
0 references
tree
0 references
square in string
0 references
pattern matching
0 references
1.0000002
0 references
0 references
0.8620716
0 references
0.85366136
0 references
0.85134876
0 references
0.84479594
0 references
0.84479594
0 references
0.8444983
0 references
