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:
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- ☆14Updated 5 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- ☆13Updated 9 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Updated 7 years ago
- ☆24Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- ☆24Updated 3 weeks ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 6 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- ☆18Updated 7 years ago
- EXPERIMENTAL implementation of side graph☆10Updated 10 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Pan-genome Seed Index☆20Updated 6 months ago
- Long read to reference genome mapping tool☆13Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- ☆10Updated last year