Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences (Q6487606)
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 7651077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences |
scientific article; zbMATH DE number 7651077 |
Statements
Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences (English)
0 references
7 February 2023
0 references
string matching algorithm
0 references
text processing
0 references
0.8270983099937439
0 references
0.8173649311065674
0 references
0.8151369094848633
0 references
0.8060147166252136
0 references
