Parallel computation for the all-pairs suffix-prefix problem (Q1796839)
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: Parallel computation for the all-pairs suffix-prefix problem |
scientific article; zbMATH DE number 6957585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel computation for the all-pairs suffix-prefix problem |
scientific article; zbMATH DE number 6957585 |
Statements
Parallel computation for the all-pairs suffix-prefix problem (English)
0 references
17 October 2018
0 references
suffix-prefix matching
0 references
parallel algorithm
0 references
multithreading
0 references
suffix array
0 references
LCP array
0 references
0.8458671569824219
0 references
0.8341217637062073
0 references
0.8243076801300049
0 references
0.8233319520950317
0 references
0.8197659254074097
0 references
