On-line construction of parameterized suffix trees for large alphabets (Q1944073)
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 6150254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line construction of parameterized suffix trees for large alphabets |
scientific article; zbMATH DE number 6150254 |
Statements
On-line construction of parameterized suffix trees for large alphabets (English)
0 references
4 April 2013
0 references
data structures
0 references
design of algorithms
0 references
randomized algorithms
0 references
0 references
0 references
0.8598015904426575
0 references
0.8042978644371033
0 references
0.8034029006958008
0 references
0.795647919178009
0 references
0.7887139320373535
0 references
