COMBINE-lab / SkipPatch
dynamic-updateable-index
☆11Updated 9 years ago
Alternatives and similar repositories for SkipPatch
Users that are interested in SkipPatch are comparing it to the libraries listed below
Sorting:
- Implementation of a Backpack Quotient Filter☆11Updated 9 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 3 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- ☆18Updated 6 years ago
- ☆14Updated 9 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated 11 months ago
- Fast and cache-efficient full-text pangenome index☆27Updated this week
- ☆15Updated 9 years ago
- Incremental construction of FM-index for DNA sequences☆70Updated 11 months ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- ☆14Updated 2 years ago
- ☆10Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- ☆12Updated 5 years ago