Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1501.06619 / rank | |||
Normal rank |
Revision as of 04:32, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing LZ78 tries and position heaps in linear time for large alphabets |
scientific article |
Statements
Constructing LZ78 tries and position heaps in linear time for large alphabets (English)
0 references
2 June 2015
0 references
algorithms
0 references
data structures
0 references
Lempel-Ziv 78 factorization
0 references
suffix trees
0 references
position heaps
0 references
nearest marked ancestor queries
0 references