Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128)
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: Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem |
scientific article; zbMATH DE number 5778960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem |
scientific article; zbMATH DE number 5778960 |
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
