A hash map using the BooPHF perfect hash function
☆13Sep 25, 2016Updated 9 years ago
Alternatives and similar repositories for BooM
Users that are interested in BooM are comparing it to the libraries listed below
Sorting:
- Johns Hopkins University student-led genomics paper discussion group☆13Apr 19, 2020Updated 5 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 8 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Jul 24, 2025Updated 7 months ago
- ☆16Feb 5, 2026Updated 3 weeks ago
- The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.☆18Feb 26, 2022Updated 4 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Jan 6, 2026Updated last month
- Preprocessing paired-end reads produced with experiment-specific protocols☆32Jun 28, 2018Updated 7 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Aug 4, 2021Updated 4 years ago
- Low memory multithreaded hash table☆24Mar 23, 2015Updated 10 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Improved multi-sample transcript abundance estimates using adaptive priors☆20Oct 29, 2018Updated 7 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 6 years ago
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 12 years ago
- Bit packed vector of integral values☆28Jan 28, 2025Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- Self-contained, multi-threaded fasta/q parser☆48Jan 30, 2026Updated 3 weeks ago
- semi-reference-based short read compression☆11Mar 5, 2019Updated 6 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- Finding putative exons and constructing splicegraphs using Trans-ABySS contigs☆11Nov 8, 2018Updated 7 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- ☆24Apr 2, 2021Updated 4 years ago
- Finding all the circuits of a directed graph with self-arcs and multiple-arcs by K.A. Hawick and H.A. James☆19Apr 11, 2013Updated 12 years ago
- StriDe Assembler☆25Nov 23, 2017Updated 8 years ago
- REINDEER REad Index for abuNDancE quERy☆56Jul 6, 2025Updated 7 months ago
- A succinct colored dBG representation☆12Sep 11, 2018Updated 7 years ago
- Comparing and combining multiple metagenomic datasets☆16Oct 12, 2022Updated 3 years ago
- ☆13Jan 8, 2020Updated 6 years ago
- Accurate, Lightweight Clustering of de novo Transcriptomes using Fragment Equivalence Classes☆31Jun 16, 2024Updated last year
- Using reference-free compressed data structures to analyse thousands of human genomes (1000 Genomes ReadServer)☆14Sep 23, 2017Updated 8 years ago
- ☆13Jan 20, 2016Updated 10 years ago
- A pipeline for detecting mis-assemblies in metagenomic assemblies.☆14Nov 3, 2017Updated 8 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- ☆15Apr 6, 2016Updated 9 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Rust bindings to the wavefront algorithm C implementation☆17Sep 20, 2022Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 7 months ago
- A efficient method to construct BWT index of a given DNA sequence, especially useful for gigantic and high similar genome.☆15May 4, 2016Updated 9 years ago