nkkarpov / editdistancek
LMS algorithm for computing edit distance with SIMD optimizations
☆11Updated last year
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
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆15Updated 4 years ago
- Iterate over minimizers of a DNA sequence☆28Updated 9 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆24Updated last month
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 3 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 10 months ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆20Updated 5 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- Wavefront alignment algorithm (WFA) in Golang☆29Updated 5 months ago
- Fast and cache-efficient full-text pangenome index☆27Updated last month
- Fast and exact gap-affine partial order alignment☆50Updated 2 weeks ago
- Benchmarking pairwise aligners☆36Updated 2 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated last month
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Shared k-mer content between two genomes☆17Updated last year
- ☆13Updated 2 weeks ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated last week
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 5 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 6 months ago
- Minimum plain text representation of kmer sets☆17Updated 2 months ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- A FASTA/FASTQ format parser library☆20Updated last year
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- A long read simulator based on badread idea☆22Updated 2 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Validation of sycnmers compared to minimizers☆11Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago