A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468)
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 weak approach to suffix automata simulation for exact and approximate string matching |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A weak approach to suffix automata simulation for exact and approximate string matching |
scientific article |
Statements
A weak approach to suffix automata simulation for exact and approximate string matching (English)
0 references
27 September 2022
0 references
exact string matching
0 references
swap matching
0 references
text processing
0 references
automata
0 references
experimental algorithms
0 references
design and analysis of algorithms
0 references
0 references
