A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368)
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 2102129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time lower bound on McCreight and general updating algorithms for suffix trees |
scientific article; zbMATH DE number 2102129 |
Statements
A linear time lower bound on McCreight and general updating algorithms for suffix trees (English)
0 references
22 September 2004
0 references
Linear-time algorithm
0 references
Suffix tree
0 references
Suffix trie
0 references
0 references
0 references
0.8257158994674683
0 references
0.8257156610488892
0 references
0.8122386932373047
0 references
0.8086224794387817
0 references
0.8086224794387817
0 references
