martin-steinegger / setcoverLinks
linear (time,space) greedy set cover implementation
☆30Updated 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
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- A tool for merging large BWTs☆25Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- ☆10Updated 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…☆12Updated 12 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Updated 5 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Ultra fast MSD radix sorter☆10Updated 5 years ago
- ☆20Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆87Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 4 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated last month
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- ☆14Updated 5 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated last week
- TU DOrtmund lossless COMPression framework☆19Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 10 months ago
- Extremely fast inplace radix sort☆43Updated 5 years ago
- De Bruijn graph representation in low memory☆35Updated last year
- Implementation for sGLMM (Sparse graph-structured linear mixed model)☆15Updated 2 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago