Pages that link to "Item:Q5133958"
From MaRDI portal
The following pages link to Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space (Q5133958):
Displaying 29 items.
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Wheeler languages (Q2051845) (← links)
- Adaptive succinctness (Q2118203) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- A combinatorial view on string attractors (Q2216440) (← links)
- Block trees (Q2221797) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- (Q5874481) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries (Q6173217) (← links)
- \(r\)-indexing the eBWT (Q6543261) (← links)
- Data structures for SMEM-finding in the PBWT (Q6545416) (← links)
- Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)
- Non-overlapping indexing in BWT-runs bounded space (Q6545434) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- Iterated straight-line programs (Q6547917) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
- Comparative genomics with succinct colored de Bruijn graphs (Q6658084) (← links)
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform (Q6658309) (← links)
