ParBLiSS / parconnect
Computes graph connectivity for large graphs
☆11Updated 8 years ago
Alternatives and similar repositories for parconnect:
Users that are interested in parconnect are comparing it to the libraries listed below
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- de Bruijn CompAction in Low Memory☆23Updated 9 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Parallel k-mer indexing for biological sequences☆12Updated 6 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 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 11 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- ☆9Updated 2 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 months ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- ☆18Updated 6 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- ☆15Updated 9 years ago
- Incremental construction of FM-index for DNA sequences☆70Updated 9 months ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- BWT-based index for graphs☆71Updated 3 weeks ago
- ☆14Updated 5 years ago
- StriDe Assembler☆25Updated 7 years ago