Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2009.10.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2009.10.015 / rank | |||
Normal rank | |||
Latest revision as of 11:49, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem |
scientific article |
Statements
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (English)
0 references
2 September 2010
0 references
algorithms
0 references
suffix array
0 references
suffix-prefix matching
0 references
