On the number of 2-protected nodes in tries and suffix trees (Q2920872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6349017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of 2-protected nodes in tries and suffix trees |
scientific article; zbMATH DE number 6349017 |
Statements
29 September 2014
0 references
retrieval trees
0 references
suffix trees
0 references
Poissonization
0 references
Mellin transforms
0 references
pattern matching
0 references
On the number of 2-protected nodes in tries and suffix trees (English)
0 references
0.8323871493339539
0 references
0.8162705898284912
0 references
0.812617301940918
0 references
0.8038768768310547
0 references
0.7960750460624695
0 references
