splatlab / debgrLinks
deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
☆31Updated 4 years ago
Alternatives and similar repositories for debgr
Users that are interested in debgr are comparing it to the libraries listed below
Sorting:
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated last month
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Updated last year
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆46Updated 6 years ago
- Classify sequencing reads using MinHash.☆48Updated 5 years ago
- Population-scale detection of novel sequence insertions☆27Updated 3 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 9 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- reference free variant assembly☆34Updated 2 years ago
- An integrated high performance bioinformatics toolkit☆23Updated 6 years ago
- Parallel Sequence to Graph Alignment☆36Updated 3 years ago
- GBWT-based handle graph☆31Updated 3 weeks ago
- ☆13Updated 9 years ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆11Updated 8 years ago
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- de Bruijn Graph-based read aligner☆34Updated 7 years ago
- de Bruijn Graph REAd mapping Tool☆14Updated 8 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- De Bruijn graph representation in low memory☆35Updated last year
- URMAP ultra-fast read mapper☆38Updated 5 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Substring index for paths in a graph☆60Updated 3 weeks ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- ☆24Updated 4 years ago
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Updated 8 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Scaffolding genomes using synthetic long read clouds☆20Updated 9 years ago
- Benchmarking pairwise aligners☆36Updated 10 months ago