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
- Implementation of a Backpack Quotient Filter☆11Updated 8 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
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 months ago
- Substring index for paths in a graph☆60Updated 3 weeks ago
- Incremental construction of FM-index for DNA sequences☆70Updated 9 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- BWT-based index for graphs☆71Updated 3 weeks ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 10 months 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
- ☆18Updated 6 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- a string to graph aligner☆41Updated 8 years ago
- Fast and cache-efficient full-text pangenome index☆27Updated last week
- Efficient construction of the BWT using string compression☆17Updated 5 months ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 4 years ago
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆64Updated 4 years ago
- ☆10Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- Classify sequencing reads using MinHash.☆48Updated 4 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Self-contained, multi-threaded fasta/q parser☆43Updated 6 months ago
- ☆14Updated 9 years ago