Pages that link to "Item:Q5505395"
From MaRDI portal
The following pages link to Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections (Q5505395):
Displaying 22 items.
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Composite Repetition-Aware Data Structures (Q2942243) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- (Q5088898) (← links)
- (Q5088915) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- (Q5111826) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
