An efficient algorithm for the all pairs suffix-prefix problem (Q1190509): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:25, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for the all pairs suffix-prefix problem |
scientific article |
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