Computing DAWGs and minimal absent words in linear time for integer alphabets (Q4608599)
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: Computing DAWGs and minimal absent words in linear time for integer alphabets |
scientific article; zbMATH DE number 6851871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing DAWGs and minimal absent words in linear time for integer alphabets |
scientific article; zbMATH DE number 6851871 |
Statements
21 March 2018
0 references
string algorithms
0 references
DAWGs
0 references
suffix trees
0 references
minimal absent words
0 references
0.9586504101753236
0 references
0.8666446805000305
0 references
