koeppl / stringsheetLinks
A cheatsheet for most common Stringology tasks
☆15Updated 4 years ago
Alternatives and similar repositories for stringsheet
Users that are interested in stringsheet are comparing it to the libraries listed below
Sorting:
- R-Index-F Library for Pattern Matching☆13Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 months ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 years ago
- Efficient construction of the BWT using string compression☆18Updated 3 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆15Updated 2 months ago
- Implementation of a Backpack Quotient Filter☆12Updated 2 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆27Updated 6 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- Dynamic succinct/compressed data structures☆111Updated last year
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last month
- TU DOrtmund lossless COMPression framework☆19Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- A lightweight suffix-sorting library enhanced with LCP construction☆12Updated 5 years ago
- ☆24Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆50Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Paper Collection for Stringologists☆17Updated 2 weeks ago
- ☆15Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago