marco-oliva / pfpLinks
Prefix Free Parsing
☆8Updated last year
Alternatives and similar repositories for pfp
Users that are interested in pfp are comparing it to the libraries listed below
Sorting:
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Efficient construction of the BWT using string compression☆18Updated this week
- ☆25Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- Efficient, parallel compression for terabyte-scale data☆46Updated 3 weeks ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 2 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆24Updated last month
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 2 weeks ago
- De Bruijn graph representation in low memory☆36Updated 10 months 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
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆50Updated this week
- Self-contained, multi-threaded fasta/q parser☆43Updated 8 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- ☆17Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 8 months ago
- modified from gitlab.com/manzai/Big-BWT to support fasta files☆9Updated 4 months ago
- ☆8Updated 3 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 2 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Library for the Handle Graph abstraction☆23Updated 2 months ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- ☆28Updated last month
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- Optimal distance lower bound k-mer sampling.☆12Updated 11 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- GBWT in Rust☆43Updated 2 months ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆84Updated 7 months ago