Pages that link to "Item:Q3225703"

The following pages link to Self-Indexed Grammar-Based Compression (Q3225703):

Displaying 24 items.

• Compact binary relation representations with rich functionality (Q386006) (← links)
• On compressing and indexing repetitive sequences (Q390894) (← links)
• LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
• Universal compressed text indexing (Q1729689) (← links)
• siEDM: an efficient string index and search algorithm for edit distance with moves (Q1736784) (← links)
• Top tree compression of tries (Q2067669) (← links)
• Grammar index by induced suffix sorting (Q2146128) (← links)
• An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
• Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
• Finger search in grammar-compressed strings (Q2322694) (← links)
• Fingerprints in compressed strings (Q2396828) (← links)
• Wavelet trees for all (Q2442812) (← links)
• Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
• Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
• Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
• LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding (Q2942259) (← links)
• Grammar-Based Compression in a Streaming Model (Q3564868) (← links)
• (Q5088899) (← links)
• A Space-Optimal Grammar Compression. (Q5111756) (← links)
• On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
• A Self-index on Block Trees (Q5150940) (← links)
• Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
• Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
• Rpair: rescaling RePair with Rsync (Q6536245) (← links)