A faster algorithm for matching a set of patterns with variable length don't cares (Q991757): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2009.12.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2009.12.007 / rank | |||
Normal rank | |||
Latest revision as of 11:41, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for matching a set of patterns with variable length don't cares |
scientific article |
Statements
A faster algorithm for matching a set of patterns with variable length don't cares (English)
0 references
7 September 2010
0 references
algorithms
0 references
string matching
0 references
variable length don't cares
0 references
