An efficient algorithm for the all pairs suffix-prefix problem (Q1190509): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126551376, #quickstatements; #temporary_batch_1722518891357 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90176-v / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063556310 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126551376 / rank | |||
Normal rank | |||
Latest revision as of 15:28, 1 August 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
