Alternatives and similar repositories for bwt-merge

Users that are interested in bwt-merge are comparing it to the libraries listed below

• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated last year
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 4 months ago
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆60Updated last month
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 2 months ago
• rob-p / FQFeeder
  Self-contained, multi-threaded fasta/q parser
  ☆43Updated 8 months ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆47Updated last year
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆85Updated 3 months ago
• Kmer-File-Format / kff-tools
  ☆17Updated last year
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆18Updated this week
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• edawson / gfakluge
  A C++ library and utilities for manipulating the Graphical Fragment Assembly format.
  ☆54Updated 3 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆70Updated 11 months ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated last week
• medvedevgroup / UST
  ☆25Updated 4 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆52Updated 2 months ago
• pmelsted / KmerStream
  Streaming algorithm for computing kmer statistics for massive genomics datasets
  ☆54Updated 5 years ago
• Malfoy / Blight
  De Bruijn graph representation in low memory
  ☆36Updated 10 months ago
• ParBLiSS / kmerind
  Parallel k-mer indexing for biological sequences
  ☆12Updated 6 years ago
• kloetzl / libdna
  ♥ Essential Functions for DNA Manipulation
  ☆20Updated last month
• ParBLiSS / PaSGAL
  Parallel Sequence to Graph Alignment
  ☆37Updated 2 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago