The following pages link to Indexing compressed text (Q3546296):
Displaying 50 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Compressed property suffix trees (Q386003) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Wee LCP (Q991794) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- Wheeler languages (Q2051845) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Compressed string-matching in standard Sturmian words (Q2271418) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
