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 this page instead for the normal view: Finding the longest common nonsuperstring in linear time |
scientific article; zbMATH DE number 5773854
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
