nkkarpov / editdistancek
LMS algorithm for computing edit distance with SIMD optimizations
☆11Updated 10 months ago
Alternatives and similar repositories for editdistancek:
Users that are interested in editdistancek are comparing it to the libraries listed below
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆15Updated last year
- Iterate over minimizers of a DNA sequence☆27Updated 7 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆14Updated 3 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- Benchmarking pairwise aligners☆36Updated last week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆18Updated 3 weeks ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 4 months ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- A bit-packed k-mer representation (and relevant utilities) for rust☆48Updated 7 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Catalogue of pairwise alignment algorithms and benchmarks☆25Updated 6 months ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 months ago
- Fast and exact gap-affine partial order alignment☆47Updated 2 months ago
- GBWT in Rust☆42Updated 2 months ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- ☆25Updated 3 years ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆19Updated 3 months ago
- De Bruijn graph representation in low memory☆36Updated 7 months ago
- A FASTA/FASTQ format parser library☆20Updated 11 months ago
- Shared k-mer content between two genomes☆17Updated last year
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 8 months ago
- Generate random test data for bioinformatics☆25Updated 8 months ago
- ☆14Updated 4 years ago