Efficient seed computation revisited (Q390905)
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: Efficient seed computation revisited |
scientific article; zbMATH DE number 6243786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient seed computation revisited |
scientific article; zbMATH DE number 6243786 |
Statements
Efficient seed computation revisited (English)
0 references
9 January 2014
0 references
seed in a string
0 references
cover
0 references
suffix tree
0 references
shortest-seed algorithm
0 references
0 references
0.9973827004432678
0 references
0.9055809378623962
0 references
0.8989695906639099
0 references
0.8775285482406616
0 references
0.8688867688179016
0 references
