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 the normal view instead:
scientific article; zbMATH DE number 7593354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A weak approach to suffix automata simulation for exact and approximate string matching |
scientific article; zbMATH DE number 7593354 |
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
0.8246687650680542
0 references
0.8218705654144287
0 references
0.8114404082298279
0 references
0.807747483253479
0 references
0.7997638583183289
0 references
