GuillaumeHolley / BlastGraphLinks
BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented graph and a set of query sequences, it detects paths in the graph on which query sequences align at most at the given edit distance.
☆12Updated 12 years ago
Alternatives and similar repositories for BlastGraph
Users that are interested in BlastGraph are comparing it to the libraries listed below
Sorting:
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- ☆25Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- ☆14Updated 9 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 8 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- EXPERIMENTAL implementation of side graph☆10Updated 10 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆47Updated 6 years ago
- Pan-genome Seed Index☆20Updated 4 months ago
- ☆18Updated 7 years ago
- ☆28Updated 3 months ago
- ☆25Updated 4 years ago
- Long read to reference genome mapping tool☆13Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year