Pages that link to "Item:Q4962737"
From MaRDI portal
The following pages link to Dynamic entropy-compressed sequences and full-text indexes (Q4962737):
Displaying 17 items.
- Fast construction of wavelet trees (Q294942) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- (Q5088899) (← links)
- Faster Practical Block Compression for Rank/Select Dictionaries (Q5150935) (← links)
