Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537)
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: Near-optimal algorithm to count occurrences of subsequences of a given length |
scientific article; zbMATH DE number 6794905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal algorithm to count occurrences of subsequences of a given length |
scientific article; zbMATH DE number 6794905 |
Statements
Near-optimal algorithm to count occurrences of subsequences of a given length (English)
0 references
20 October 2017
0 references
counting subsequences
0 references
perfect tree
0 references
0 references
0.788681149482727
0 references
0.7353867888450623
0 references
0.7343759536743164
0 references
0.7340211272239685
0 references
