Time-space trade-offs for the longest common substring problem (Q4928575)
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: Time-space trade-offs for the longest common substring problem |
scientific article; zbMATH DE number 6176338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space trade-offs for the longest common substring problem |
scientific article; zbMATH DE number 6176338 |
Statements
Time-Space Trade-Offs for the Longest Common Substring Problem (English)
0 references
14 June 2013
0 references
0.9235851168632508
0 references
0.8636720180511475
0 references
0.8617864847183228
0 references
0.8527003526687622
0 references
0.8485661745071411
0 references
