Alternatives and similar repositories for parconnect:

Users that are interested in parconnect are comparing it to the libraries listed below

• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• ParBLiSS / kmerind
  Parallel k-mer indexing for biological sequences
  ☆12Updated 6 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• GuillaumeHolley / BlastGraph
  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
• Malfoy / BCALM
  de Bruijn CompAction in Low Memory
  ☆23Updated 9 years ago
• brc7 / DiversitySampling
  ☆10Updated 2 years ago
• ocxtal / comb
  comb aligner -- a graphical nucleotide sequence alignment tool
  ☆9Updated 8 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 2 months ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• ratschlab / graph_annotation
  Code accompanying the publication for compressed graph annotation
  ☆13Updated 6 years ago
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 4 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 5 years ago
• Kingsford-Group / splitsbt
  ☆18Updated 6 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆10Updated 4 years ago
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆70Updated 10 months ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated last month
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated last year
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 9 years ago
• lynxoid / nimbliner
  nimble aligner that will map your reads to the references on a laptop
  ☆12Updated 7 years ago
• nfergu / popstrat
  Population Stratification Analysis on Genomics Data Using Deep Learning
  ☆26Updated 8 years ago
• torognes / swipe
  Smith-Waterman database searches with inter-sequence SIMD parallelisation
  ☆59Updated last year
• lh3 / lh3-snippets
  ☆14Updated 5 years ago
• yunwilliamyu / quartz
  ☆15Updated 9 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 4 years ago