Pages that link to "Item:Q4458882"

The following pages link to New text indexing functionalities of the compressed suffix arrays (Q4458882):

Displaying 21 items.

• Colored range queries and document retrieval (Q390874) (← links)
• On compressing and indexing repetitive sequences (Q390894) (← links)
• On compressing permutations and adaptive sorting (Q391981) (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
• Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
• Efficient fully-compressed sequence representations (Q472482) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
• Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
• A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
• Succinct data structures for flexible text retrieval systems (Q924538) (← links)
• Wee LCP (Q991794) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Approximate string matching with compressed indexes (Q1662494) (← links)
• Practical compressed suffix trees (Q1736557) (← links)
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
• Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
• Distribution-aware compressed full-text indexes (Q2017875) (← links)
• The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)