Fast and flexible string matching by combining bit-parallelism and suffix automata (Q5463398)
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: Fast and flexible string matching by combining bit-parallelism and suffix automata |
scientific article; zbMATH DE number 2192033
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and flexible string matching by combining bit-parallelism and suffix automata |
scientific article; zbMATH DE number 2192033 |
Statements
Fast and flexible string matching by combining bit-parallelism and suffix automata (English)
0 references
4 August 2005
0 references
