COMBINE-lab / SkipPatchLinks
dynamic-updateable-index
☆11Updated 10 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☆85Updated last year
- A tool for merging large BWTs☆24Updated 5 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 6 months ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- ☆15Updated 9 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Substring index for paths in a graph☆60Updated last week
- ☆20Updated 5 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 6 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- ☆10Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆63Updated 5 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆56Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 2 months ago
- ☆13Updated 10 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Parallel Sequence to Graph Alignment☆36Updated 3 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆46Updated 7 years ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆11Updated 8 years ago
- BWT-based index for graphs☆73Updated 10 months ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Fast approximation of similarity for sets of very different sizes☆20Updated 3 years ago
- Graph-based mapping of long sequences, noisy or HiFi.☆55Updated 5 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Updated 5 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆86Updated 11 months ago