Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 21:00, 5 March 2024
scientific article; zbMATH DE number 6794905
Language | Label | Description | Also known as |
---|---|---|---|
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