Finding the longest common nonsuperstring in linear time (Q989576)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5773854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the longest common nonsuperstring in linear time |
scientific article; zbMATH DE number 5773854 |
Statements
Finding the longest common nonsuperstring in linear time (English)
0 references
20 August 2010
0 references
design of algorithms
0 references
string non-inclusion problem
0 references
longest common nonsuperstring
0 references
generalized suffix tree
0 references
0.8460925817489624
0 references
0.8460925817489624
0 references
0.8248922228813171
0 references
0.7800998091697693
0 references
0.7768398523330688
0 references
