jltsiren / gcsa2Links
BWT-based index for graphs
☆72Updated 5 months ago
Alternatives and similar repositories for gcsa2
Users that are interested in gcsa2 are comparing it to the libraries listed below
Sorting:
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- Incremental construction of FM-index for DNA sequences☆71Updated last year
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆63Updated 7 months ago
- Substring index for paths in a graph☆61Updated 4 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- An Oxford Nanopore Basecaller☆71Updated 3 years ago
- Adaptive semi-global banded alignment on string graphs☆67Updated 7 years ago
- A C++ header-only library for reading Oxford Nanopore Fast5 files☆53Updated 3 years ago
- De novo genome assembly and multisample variant calling☆113Updated 6 years ago
- Estimating k-mer coverage histogram of genomics data☆77Updated last year
- compacted de Bruijn graph construction in low memory☆100Updated 10 months ago
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated 10 months ago
- Antibiotic resistance predictions in minutes on a laptop☆50Updated 6 years ago
- Implementation of Positional Burrows-Wheeler Transform for genetic data☆110Updated 5 months ago
- Fast and memory-efficient sequencing error corrector☆93Updated last year
- a string to graph aligner☆41Updated 9 years ago
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- An illumina paired-end and mate-pair short read simulator. This project attempts to model as many of the quirks that exist in Illumina da…☆67Updated 10 years ago
- Gfapy: a flexible and extensible software library for handling sequence graphs in Python☆68Updated 10 months ago
- Genome inference from a population reference graph☆97Updated 5 months ago
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆97Updated 3 years ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- de Bruijn Graph-based read aligner☆33Updated 6 years ago
- Scripts for implementing read until and other examples.☆32Updated 5 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 6 months ago
- Standalone C library for assembling Illumina short reads in small regions☆72Updated 2 years ago
- Global alignment and alignment extension☆134Updated 2 years ago
- tools for error correction and working with long read data☆44Updated 10 years ago
- Create Bloom filters for a given reference and then use it to categorize sequences☆76Updated 9 months ago