GuillaumeHolley / BloomFilterTrieLinks
An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
☆44Updated 3 years ago
Alternatives and similar repositories for BloomFilterTrie
Users that are interested in BloomFilterTrie are comparing it to the libraries listed below
Sorting:
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 4 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- BWT-based index for graphs☆71Updated 4 months ago
- Histosketching Using Little Kmers☆57Updated 2 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- k8 Javascript shell☆157Updated 11 months ago
- Pan-genome Seed Index☆20Updated 4 months ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆60Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 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
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- Incremental construction of FM-index for DNA sequences☆71Updated last year
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year