Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380)
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: Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays |
scientific article; zbMATH DE number 5532456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays |
scientific article; zbMATH DE number 5532456 |
Statements
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (English)
0 references
24 March 2009
0 references
Suffix trees
0 references
Suffix arrays
0 references
Index data structures
0 references
String algorithms
0 references
0 references
0 references
0 references
0.8972187042236328
0 references
0.8219976425170898
0 references
0.8216755390167236
0 references
0.8210564255714417
0 references
