davidecenzato / PFP-eBWTLinks
Implementation of eBWT using Prefix-free parse (PFP)
☆14Updated last month
Alternatives and similar repositories for PFP-eBWT
Users that are interested in PFP-eBWT are comparing it to the libraries listed below
Sorting:
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 2 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆27Updated 6 months ago
- R-Index-F Library for Pattern Matching☆13Updated last year
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 5 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last month
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- ☆25Updated 4 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 7 years ago
- ☆14Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Pan-genome Seed Index☆20Updated 5 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- ☆10Updated last year
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- ☆25Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- ☆17Updated 2 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year