COMBINE-lab / SkipPatchLinks
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:
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆82Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆12Updated 2 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Substring index for paths in a graph☆60Updated 5 months ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆63Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- ☆13Updated 9 years ago
- BWT-based index for graphs☆72Updated 6 months ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Efficient construction of the BWT using string compression☆20Updated 3 months ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 6 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- Pan-genome Seed Index☆20Updated 6 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆55Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆84Updated 3 weeks ago
- ☆20Updated 5 years 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
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago