Pages that link to "Item:Q3196619"
From MaRDI portal
The following pages link to An analysis of the Burrows—Wheeler transform (Q3196619):
Displaying 50 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Bounds from a card trick (Q414410) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- Wee LCP (Q991794) (← links)
- Burrows-Wheeler transform and Sturmian words (Q1007612) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Measuring the clustering effect of BWT via RLE (Q1676309) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Efficient chain code compression with interpolative coding (Q2195467) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Wavelet trees for all (Q2442812) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Faster suffix sorting (Q2465058) (← links)
- Compressing table data with column dependency (Q2465060) (← links)
