martin-steinegger / setcoverLinks
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
Sorting:
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- ☆10Updated 3 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 3 weeks ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Computes graph connectivity for large graphs☆11Updated 8 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- De Bruijn graph representation in low memory☆36Updated last year
- ☆14Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 10 months ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 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
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated 11 months ago
- Extremely fast inplace radix sort☆42Updated 5 years ago
- ☆25Updated 4 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week