ParBLiSS / parconnect
Computes graph connectivity for large graphs
☆11Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for parconnect
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Parallel k-mer indexing for biological sequences☆12Updated 5 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- BWT-based index for graphs☆71Updated 2 weeks ago
- ☆9Updated 2 years ago
- ☆19Updated 4 years ago
- de Bruijn CompAction in Low Memory☆23Updated 8 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 5 years ago
- FMtree: A fast locating algorithm of FM-indexes for genomic data☆18Updated 7 years ago
- ☆18Updated 6 years ago
- smith-waterman-gotoh alignment algorithm☆17Updated 7 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- ☆23Updated 11 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆80Updated 8 months ago
- Lightweight C++ library for reading FASTA and FASTQ files.☆11Updated 5 years ago
- Educational implementation of BWT and FM-index☆57Updated 6 years ago
- StriDe Assembler☆25Updated 7 years ago
- ☆15Updated 8 years ago
- ☆10Updated 8 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago