jermp / lphash
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
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- Fast and cache-efficient full-text pangenome index☆27Updated 3 weeks ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 8 months ago
- ☆25Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆47Updated 11 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- ☆17Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 weeks ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 4 months ago
- ☆25Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- Efficient construction of the BWT using string compression☆17Updated 4 months ago
- ☆13Updated 5 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
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆18Updated 3 weeks ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Lift-over alignments from variant-aware references☆34Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- De Bruijn graph representation in low memory☆36Updated 7 months ago
- Optimized sequence graph implementations for graph genomics☆34Updated 2 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 5 years ago
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 2 months ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated 4 months ago
- Efficient, parallel compression for terabyte-scale data☆39Updated last month
- C implementation of the Landau-Vishkin algorithm☆35Updated 2 years ago