holtjma / msbwt
A python toolkit for building and querying multi-string BWTs
☆27Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for msbwt
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆30Updated 2 months ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- ☆28Updated last year
- De Bruijn graph representation in low memory☆36Updated 4 months ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆51Updated 2 years ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆10Updated 7 years ago
- genome variation graphs constructed from HLA GRCh38 ALTs☆22Updated 2 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- Construct a Physical Map from Linked Reads☆18Updated 7 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- A lightweight library for working with PAF (Pairwise mApping Format) files☆31Updated 2 years ago
- A Pedantic FASTA Parser and Tool Set☆14Updated 4 years ago
- Population-scale detection of novel sequence insertions☆27Updated 2 years ago
- Parallel Sequence to Graph Alignment☆35Updated last year
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆64Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- A long read simulator based on badread idea☆20Updated 2 years ago
- URMAP ultra-fast read mapper☆39Updated 4 years ago
- Bam Read Index - Extract alignments from a bam file by readname☆24Updated 6 months ago
- The Modular Aligner and The Modular SV Caller☆46Updated last year
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Updated 8 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated last month
- ☆17Updated last year
- Fast-SG: An alignment-free algorithm for ultrafast scaffolding graph construction from short or long reads.☆22Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago