Pages that link to "Item:Q996703"
From MaRDI portal
The following pages link to A space and time efficient algorithm for constructing compressed suffix arrays (Q996703):
Displaying 16 items.
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
- Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Haplotype-aware graph indexes (Q5090328) (← links)
- (Q5501319) (← links)
