Average complexity of backward \(q\)-gram string matching algorithms (Q436556)
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: Average complexity of backward q-gram string matching algorithms |
scientific article; zbMATH DE number 6059682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average complexity of backward \(q\)-gram string matching algorithms |
scientific article; zbMATH DE number 6059682 |
Statements
Average complexity of backward \(q\)-gram string matching algorithms (English)
0 references
25 July 2012
0 references
analysis of algorithms
0 references
string matching
0 references
average case complexity
0 references
0.9000541
0 references
0.8886719
0 references
0.8812644
0 references
0.8789523
0 references
0.8784487
0 references
0.8737241
0 references
0 references
0.8713409
0 references
