Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552)
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: Worst-case efficient single and multiple string matching on packed texts in the word-RAM model |
scientific article; zbMATH DE number 6082047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case efficient single and multiple string matching on packed texts in the word-RAM model |
scientific article; zbMATH DE number 6082047 |
Statements
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (English)
0 references
13 September 2012
0 references
independent set
0 references
fixed-parameter tractability
0 references
hereditary class of graphs
0 references
modular decomposition
0 references
0 references
0.9722298383712769
0 references
0.8645138740539551
0 references
0.8557003736495972
0 references
0.8541647791862488
0 references
0.8377367854118347
0 references
