martin-steinegger / setcover
linear (time,space) greedy set cover implementation
☆30Updated 3 years ago
Alternatives and similar repositories for setcover:
Users that are interested in setcover are comparing it to the libraries listed below
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆62Updated last year
- compressed, queryable variation graphs☆11Updated 9 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 2 weeks ago
- ☆9Updated 2 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- ☆13Updated 5 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- ☆23Updated last year
- Paper Collection for Stringologists☆17Updated 4 months ago
- FOundation of stXXl and thriLL☆14Updated last year
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 11 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- ☆20Updated 4 years ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆16Updated last week
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Metagenomic binning using low-density hashing a support vector machine☆21Updated 4 years ago
- De Bruijn graph representation in low memory☆36Updated 8 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago