RUSH-LAB / RAMBOLinks
☆20Updated 4 years ago
Alternatives and similar repositories for RAMBO
Users that are interested in RAMBO are comparing it to the libraries listed below
Sorting:
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- C++ library for parsing several formats in bioinformatics☆9Updated 2 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆12Updated last year
- Probabilistic inference of somatic copy number alterations using repeat DNA (FAST-SeqS)☆9Updated 6 years ago
- ☆10Updated 4 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆32Updated 6 months ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- ☆14Updated 5 years ago
- ☆18Updated 6 years ago
- ☆13Updated last year
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- ☆10Updated 3 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
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- ☆12Updated 5 years ago
- ☆14Updated 9 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- De Bruijn graph representation in low memory☆36Updated 11 months ago
- ☆25Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year