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:
- ☆24Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆27Updated 6 months ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆34Updated last week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- ☆16Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 8 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 9 months ago
- Contains the description of a file format to store kmers and associated values☆33Updated 3 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆55Updated last week
- Self-contained, multi-threaded fasta/q parser☆48Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- ☆24Updated 2 months ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 8 months ago
- Efficient construction of the BWT using string compression☆20Updated 5 months ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆67Updated last year
- Bidirectional WFA (Paper)☆48Updated last year
- Efficient, parallel compression for terabyte-scale data☆52Updated last month
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 weeks ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- Benchmarking pairwise aligners☆36Updated 9 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆85Updated 2 months ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆53Updated last week