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 this page instead for the normal view: An efficient algorithm for the all pairs suffix-prefix problem |
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
