Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2011.12.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2011.12.011 / rank | |||
Normal rank | |||
Revision as of 01:53, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case efficient single and multiple string matching on packed texts in the word-RAM model |
scientific article |
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
