I/O-efficient data structures for non-overlapping indexing (Q2220773)
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 7300875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O-efficient data structures for non-overlapping indexing |
scientific article; zbMATH DE number 7300875 |
Statements
I/O-efficient data structures for non-overlapping indexing (English)
0 references
25 January 2021
0 references
suffix trees
0 references
data structure
0 references
string algorithms
0 references
0.9585738182067872
0 references
0.8938623666763306
0 references
0.8897882103919983
0 references
0.8810040354728699
0 references
0.8284472227096558
0 references
