ekg / succinct-graphLinks
compressed, queryable variation graphs
☆11Updated 10 years ago
Alternatives and similar repositories for succinct-graph
Users that are interested in succinct-graph are comparing it to the libraries listed below
Sorting:
- Relative data structures based on the BWT☆12Updated 7 years ago
- A tool for merging large BWTs☆25Updated 4 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- dynamic-updateable-index☆11Updated 9 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
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆83Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 3 months ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- Dynamic succinct/compressed data structures☆110Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 8 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- BWT-based index for graphs☆73Updated 7 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- ☆20Updated 5 years ago
- ☆10Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Parallel Block GZIP☆50Updated 9 years ago
- De Bruijn graph representation in low memory☆35Updated last year
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 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