martin-steinegger / setcoverLinks
linear (time,space) greedy set cover implementation
☆31Updated 4 years ago
Alternatives and similar repositories for setcover
Users that are interested in setcover are comparing it to the libraries listed below
Sorting:
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 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…☆12Updated 12 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated 2 weeks ago
- Extremely fast inplace radix sort☆42Updated 5 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆15Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- A tool for merging large BWTs☆25Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- ☆14Updated 5 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 4 years ago
- ☆10Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A heuristic solver for the set cover problem☆57Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Parallel Implementation of HMM on Multicore Platform☆25Updated 2 years ago
- FMtree: A fast locating algorithm of FM-indexes for genomic data☆18Updated 8 years ago
- ☆20Updated 5 years ago