GuillaumeHolley / BlastGraph
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 11 years ago
Alternatives and similar repositories for BlastGraph:
Users that are interested in BlastGraph are comparing it to the libraries listed below
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 7 years ago
- ☆18Updated 6 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 5 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- ☆19Updated 4 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- ☆21Updated 9 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- ☆10Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Qtip: a tandem simulation approach for accurately predicting read alignment mapping qualities☆25Updated 5 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- Streaming sequence classification with web services ✓📌☆19Updated 2 years ago
- Boiler: a software tool for highly efficient, lossy compression of RNA-seq alignments☆13Updated 8 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Updated 10 months ago
- ☆15Updated 8 years ago
- reference free variant assembly☆32Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 2 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 5 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago