Searching a bitstream in linear time for the longest substring of any given density (Q644795)
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: Searching a bitstream in linear time for the longest substring of any given density |
scientific article; zbMATH DE number 5968722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching a bitstream in linear time for the longest substring of any given density |
scientific article; zbMATH DE number 5968722 |
Statements
Searching a bitstream in linear time for the longest substring of any given density (English)
0 references
7 November 2011
0 references
linear time algorithm
0 references
string processing
0 references
substring density
0 references
randomness testing
0 references
bioinformatics
0 references
0 references
0 references
0.8164030313491821
0 references
0.7980021834373474
0 references
0.7643309235572815
0 references
0.761259913444519
0 references
