imartayan / CBL
A Rust library providing fully dynamic sets of k-mers with high locality
☆44Updated 4 months ago
Alternatives and similar repositories for CBL:
Users that are interested in CBL are comparing it to the libraries listed below
- Fast and exact gap-affine partial order alignment☆47Updated 2 months ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- Iterate over minimizers of a DNA sequence☆27Updated 7 months ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 months ago
- A k-mer search engine for all Sequence Read Archive public accessions☆20Updated 3 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- A FASTA/FASTQ format parser library☆20Updated 11 months ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated this week
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Long read aligner for cyclic and acyclic pangenome graphs☆36Updated last year
- Generate random test data for bioinformatics☆25Updated 8 months ago
- Nail is an Alignment Inference tooL☆44Updated 3 weeks ago
- Given a set of kmers (fasta format) and a set of sequences (fasta format), this tool will extract the sequences containing the kmers.☆22Updated last year
- ☆17Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 2 months ago
- This is a library C/Python/CLI for working with TAF (.taf,.taf.gz) and MAF (.maf) alignment files☆25Updated 2 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 8 months ago
- Python wrapper for wavefront alignment using WFA2-lib☆35Updated 3 months ago
- implicit pangenome graph☆52Updated this week
- ☆21Updated 4 months ago
- Extracts subgraphs or components from a graph in GFA format☆23Updated 3 months ago
- Benchmarking pairwise aligners☆36Updated last week
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆18Updated 3 weeks ago
- ☆13Updated last week
- Rust wrapper for the next generation (still currently in C++)☆23Updated 2 weeks ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- convert variation graph alignments to coverage maps over nodes☆23Updated 3 weeks ago
- A bioinformatics tool written in Rust to find palindromic sequences in DNA☆34Updated 3 weeks ago
- General purpose utility related to GAF files☆22Updated 3 weeks ago
- Alignment against all pre-2019 bacteria on laptops within a few hours (former MOF-Search)