Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677)
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: Efficient string matching based on a two-step simulation of the suffix automaton |
scientific article; zbMATH DE number 7495113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient string matching based on a two-step simulation of the suffix automaton |
scientific article; zbMATH DE number 7495113 |
Statements
Efficient string matching based on a two-step simulation of the suffix automaton (English)
0 references
22 March 2022
0 references
text processing
0 references
string matching
0 references
automata based algorithms
0 references
suffix automaton simulation
0 references
design and analysis on algorithms
0 references
0 references
0 references
