Pages that link to "Item:Q3196619"

The following pages link to An analysis of the Burrows—Wheeler transform (Q3196619):

Displaying 23 items.

• Rank and select revisited and extended (Q2465064) (← links)
• Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576) (← links)
• Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
• Locally Compressed Suffix Arrays (Q2828176) (← links)
• General Document Retrieval in Compact Space (Q2828189) (← links)
• Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
• Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
• Self-indexing Based on LZ77 (Q3011842) (← links)
• Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
• Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
• Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
• Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
• On the Value of Multiple Read/Write Streams for Data Compression (Q3637105) (← links)
• (Q5005170) (← links)
• A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
• Compressed Multiple Pattern Matching (Q5088902) (← links)
• Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
• Spaces, Trees, and Colors (Q5176183) (← links)
• Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
• Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
• The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
• Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
• A new class of string transformations for compressed text indexing (Q6053405) (← links)