Alternatives and similar repositories for ORCOM

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

• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆72Updated last year
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 10 months ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated 2 months ago
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 4 years ago
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆60Updated this week
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆53Updated last year
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆52Updated 10 months ago
• ocxtal / libgaba
  Adaptive semi-global banded alignment on string graphs
  ☆66Updated 7 years ago
• COMBINE-lab / pufferfish
  An efficient index for the colored, compacted, de Bruijn graph
  ☆111Updated last year
• mateidavid / fast5
  A C++ header-only library for reading Oxford Nanopore Fast5 files
  ☆53Updated 3 years ago
• chhylp123 / FMtree
  FMtree: A fast locating algorithm of FM-indexes for genomic data
  ☆18Updated 8 years ago
• COMBINE-lab / cuttlefish
  Building the compacted de Bruijn graph efficiently from references or reads.
  ☆92Updated last week
• lh3 / gwfa
  Proof-of-concept implementation of GWFA for sequence-to-graph alignment
  ☆56Updated last year
• Kingsford-Group / remuval
  ☆12Updated 6 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 5 years ago
• ParBLiSS / PaSGAL
  Parallel Sequence to Graph Alignment
  ☆36Updated 3 years ago
• ksahlin / strobemers
  A repository for generating strobemers and evalaution
  ☆79Updated last year
• isovic / minialign
  Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.
  ☆11Updated 8 years ago
• GATB / bcalm
  compacted de Bruijn graph construction in low memory
  ☆100Updated 3 months ago
• DixianZhu / deBWT
  A efficient method to construct BWT index of a given DNA sequence, especially useful for gigantic and high similar genome.
  ☆15Updated 9 years ago
• Malfoy / Blight
  De Bruijn graph representation in low memory
  ☆35Updated last year
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 9 years ago
• PASSIONLab / BELLA
  BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper
  ☆52Updated 3 years ago
• isovic / raptor
  Graph-based mapping of long sequences, noisy or HiFi.
  ☆55Updated 5 years ago
• HongzheGuo / deBGA
  de Bruijn Graph-based read aligner
  ☆35Updated 7 years ago
• rcedgar / urmap
  URMAP ultra-fast read mapper
  ☆38Updated 5 years ago
• lh3 / miniwfa
  A reimplementation of the WaveFront Alignment algorithm at low memory
  ☆50Updated last year
• karel-brinda / NanoSim-H
  NanoSim-H: a simulator of Oxford Nanopore reads; a fork of NanoSim.
  ☆18Updated 3 years ago
• jermp / fulgor
  ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.
  ☆59Updated last month
• sfu-compbio / scalce
  FASTQ compression via boosting Sequence Compression Algorithms using Locally Consistent Encoding
  ☆14Updated 5 years ago