jermp / lphashLinks
Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
☆43Updated last year
Alternatives and similar repositories for lphash
Users that are interested in lphash are comparing it to the libraries listed below
Sorting:
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- ☆25Updated 4 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆52Updated this week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- ☆17Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 5 months ago
- Contains the description of a file format to store kmers and associated values☆32Updated 3 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 5 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50Updated last year
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Self-contained, multi-threaded fasta/q parser☆45Updated 10 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 10 months ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- ☆28Updated 4 months ago
- Efficient, parallel compression for terabyte-scale data☆48Updated 3 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated last month
- De Bruijn graph representation in low memory☆36Updated last year
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆65Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 6 months ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆84Updated 10 months ago
- Library for the Handle Graph abstraction☆24Updated last month
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- Bidirectional WFA (Paper)☆47Updated last year