A faster algorithm for matching a set of patterns with variable length don't cares (Q991757)
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: A faster algorithm for matching a set of patterns with variable length don't cares |
scientific article; zbMATH DE number 5780804
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for matching a set of patterns with variable length don't cares |
scientific article; zbMATH DE number 5780804 |
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
0 references
0.8766488
0 references
0 references
0.8612424
0 references
0.86118525
0 references
