imartayan / CBLLinks
A Rust library providing fully dynamic sets of k-mers with high locality
☆45Updated 9 months ago
Alternatives and similar repositories for CBL
Users that are interested in CBL are comparing it to the libraries listed below
Sorting:
- Wavefront alignment algorithm (WFA) in Golang☆29Updated 8 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 4 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆51Updated 3 weeks ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 2 months ago
- Iterate over minimizers of a DNA sequence☆31Updated last year
- Fast and exact gap-affine partial order alignment☆52Updated this week
- A FASTA/FASTQ format parser library☆20Updated last year
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 5 months ago
- Given a set of kmers (fasta format) and a set of sequences (fasta format), this tool will extract the sequences containing the kmers.☆21Updated last year
- ☆13Updated this week
- Long read aligner for cyclic and acyclic pangenome graphs☆37Updated last year
- Rust library for processing sequencing reads.☆25Updated 10 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- A bioinformatics tool written in Rust to find palindromic sequences in DNA☆35Updated 5 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆25Updated 8 months ago
- ☆18Updated 5 months ago
- Extracts subgraphs or components from a graph in GFA format☆23Updated 7 months ago
- A k-mer search engine for all Sequence Read Archive public accessions☆29Updated 8 months ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated last month
- Generate random test data for bioinformatics☆26Updated last year
- Compute a pairwise SNP distance matrix from one or two alignment(s)☆25Updated 10 months ago
- Benchmarking pairwise aligners☆36Updated 5 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- convert variation graph alignments to coverage maps over nodes☆24Updated 3 weeks ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Hierarchical binned indexed data store for on-disk genomic data.☆14Updated 5 months ago
- GBWT in Rust☆43Updated 3 months ago