ParBLiSS / parconnectLinks
Computes graph connectivity for large graphs
☆11Updated 9 years ago
Alternatives and similar repositories for parconnect
Users that are interested in parconnect are comparing it to the libraries listed below
Sorting:
- FM-index representation of a de Bruijn graph☆26Updated 8 years ago
- Parallel k-mer indexing for biological sequences☆12Updated 7 years ago
- A tool for merging large BWTs☆24Updated 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
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- BWT-based index for graphs☆73Updated 10 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 6 months ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Seqnature: incorporate SNPs and Indels into a reference genome☆16Updated 9 years ago
- de Bruijn CompAction in Low Memory☆23Updated 10 years ago
- Population Stratification Analysis on Genomics Data Using Deep Learning☆25Updated 9 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Updated last year
- ☆15Updated 9 years ago
- A demo implementation of Succinct de Bruijn Graphs.☆25Updated 12 years ago
- Fast and memory-efficient sequencing error corrector☆94Updated last month
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 4 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Updated 5 years ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- Efficient base quality score recalibrator for NGS data☆24Updated 10 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- ☆23Updated 2 years ago
- dynamic-updateable-index☆11Updated 10 years ago
- succinct labeled graphs with collections and paths☆15Updated 7 years ago
- ☆13Updated 6 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 7 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆85Updated last year