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:
- ☆18Updated 6 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 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
- ☆10Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆12Updated last year
- Streaming sequence classification with web services ✓📌☆19Updated 2 years ago
- Qtip: a tandem simulation approach for accurately predicting read alignment mapping qualities☆25Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 4 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 6 years ago
- ☆20Updated 4 years ago
- C++ library for parsing several formats in bioinformatics☆9Updated 2 years ago
- Linear-time, low-memory construction of variation graphs☆20Updated 5 years ago
- smith-waterman-gotoh alignment algorithm☆17Updated 7 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- A fast and space-efficient pre-filter for estimating the quantification of very large collections of nucleotide sequences☆14Updated last week
- A tool for merging large BWTs☆26Updated 4 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- ☆14Updated 9 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Somatic (mosaic) SNV caller for 10X Genomics data using random forest classification and feature-based filters☆24Updated 6 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago