imartayan / CBLLinks
A Rust library providing fully dynamic sets of k-mers with high locality
☆45Updated 10 months ago
Alternatives and similar repositories for CBL
Users that are interested in CBL are comparing it to the libraries listed below
Sorting:
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- Iterate over minimizers of a DNA sequence☆31Updated last year
- Wavefront alignment algorithm (WFA) in Golang☆30Updated last month
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 5 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated last month
- A FASTA/FASTQ format parser library☆20Updated last year
- Contains the description of a file format to store kmers and associated values☆32Updated 3 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆52Updated last week
- Fast and exact gap-affine partial order alignment☆54Updated last month
- ☆13Updated last month
- A bioinformatics tool written in Rust to find palindromic sequences in DNA☆35Updated 6 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
- Compute a pairwise SNP distance matrix from one or two alignment(s)☆25Updated 11 months ago
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆15Updated 4 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Rust library for processing sequencing reads.☆25Updated 11 months ago
- Extracts subgraphs or components from a graph in GFA format☆24Updated 9 months ago
- Benchmarking pairwise aligners☆36Updated 6 months ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆25Updated 9 months ago
- ☆17Updated 7 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Long read aligner for cyclic and acyclic pangenome graphs☆39Updated last year
- convert variation graph alignments to coverage maps over nodes☆24Updated 2 months ago
- Variant call verification☆16Updated 3 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Shared k-mer content between two genomes☆18Updated 2 years ago
- A k-mer search engine for all Sequence Read Archive public accessions☆31Updated 10 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago