ParBLiSS / parconnectLinks
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
Sorting:
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Parallel k-mer indexing for biological sequences☆12Updated 6 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- de Bruijn CompAction in Low Memory☆23Updated 9 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- External memory suffix array construction using inducing☆11Updated 4 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 4 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- ☆10Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 4 months ago
- ☆18Updated 6 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- ☆25Updated 4 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- ☆14Updated 5 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- ☆15Updated 9 years ago