COMBINE-lab / SkipPatch
dynamic-updateable-index
☆11Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for SkipPatch
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Fast and cache-efficient full-text pangenome index☆25Updated last week
- Implementation of a Backpack Quotient Filter☆10Updated 4 months ago
- A tool for merging large BWTs☆26Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago
- Parallel Sequence to Graph Alignment☆35Updated last year
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- ☆14Updated 8 years ago
- ☆18Updated 6 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Efficient construction of the BWT using string compression☆17Updated last month
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago
- ☆17Updated last year
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆51Updated 2 years ago
- ☆28Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆44Updated this week
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- Classify sequencing reads using MinHash.☆48Updated 4 years ago
- Population-scale detection of novel sequence insertions☆27Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated last year
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- ☆19Updated 4 years ago