martin-steinegger / setcover
linear (time,space) greedy set cover implementation
☆29Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for setcover
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- ☆9Updated 2 years ago
- ☆13Updated 4 years ago
- Computes graph connectivity for large graphs☆11Updated 7 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- Metagenomic binning using low-density hashing a support vector machine☆21Updated 4 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated 6 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 5 years ago
- Fast and exact ILP-based solvers for the Minimum Flow Decomposition problem, and variants of it.☆12Updated last year
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆15Updated this week
- R-Index-F Library for Pattern Matching☆13Updated 3 months ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- De Bruijn graph representation in low memory☆36Updated 4 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆12Updated 3 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- Fast and cache-efficient full-text pangenome index☆25Updated last week
- ☆23Updated 11 months ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆24Updated last year
- Extremely fast inplace radix sort☆42Updated 4 years ago