An efficient algorithm for the all pairs suffix-prefix problem (Q1190509)
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 55560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the all pairs suffix-prefix problem |
scientific article; zbMATH DE number 55560 |
Statements
An efficient algorithm for the all pairs suffix-prefix problem (English)
0 references
26 September 1992
0 references
string matching
0 references
suffix-prefix match
0 references
0.8702411651611328
0 references
0.835114598274231
0 references
0.8243064284324646
0 references
0.8114444613456726
0 references
