jermp / lphashLinks
Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
☆43Updated 2 years ago
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
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Updated 9 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated this week
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 10 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- Efficient, parallel compression for terabyte-scale data☆58Updated 4 months ago
- ☆16Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 3 months ago
- A small, auxiliary index to massively improve parallel fastq parsing☆30Updated 3 weeks ago
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆53Updated last week
- ☆24Updated 5 months ago
- Parallel Sequence to Graph Alignment☆36Updated 3 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆57Updated last year
- Efficient construction of the BWT using string compression☆21Updated 8 months ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆20Updated 5 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆86Updated last month
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 10 months ago
- ☆28Updated 10 months ago
- Optimized sequence graph implementations for graph genomics☆34Updated this week
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆47Updated 3 weeks ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Updated 2 months ago
- De Bruijn graph representation in low memory☆35Updated last year