Kingsford-Group / omhismb2019
☆23Updated 9 months ago
Related projects: ⓘ
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆43Updated 3 weeks ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated 2 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆56Updated 3 months ago
- Benchmarking pairwise aligners☆35Updated 5 months ago
- Parallel Sequence to Graph Alignment☆34Updated last year
- REINDEER REad Index for abuNDancE quERy☆56Updated last month
- Fast and precise comparison of genomes and metagenomes (in the order of terabytes) on a typical personal laptop☆56Updated 5 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- Contains the description of a file format to store kmers and associated values☆30Updated 2 years ago
- ☆17Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆21Updated this week
- Practical Dynamic de Bruijn Graphs☆18Updated 3 years ago
- ☆15Updated 9 months ago
- Classify sequencing reads using MinHash.☆47Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆39Updated last year
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- ☆13Updated last year
- Tool to estimate deltas for sequence sets and answer questions about relative contribution☆21Updated 7 months ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆51Updated 2 years ago
- Optimized sequence graph implementations for graph genomics☆30Updated last week
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Small general purpose library for C and Python with focus on bioinformatics.☆29Updated 2 years ago
- Self-contained, multi-threaded fasta/q parser☆42Updated 10 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- Iterate over minimizers of a DNA sequence☆24Updated 2 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆50Updated last week
- A long read simulator based on badread idea☆20Updated last year
- Python bindings for Bifrost with a NetworkX compatible API☆27Updated 11 months ago