Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
-
Updated
Apr 19, 2023 - C++
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
super fast cpp implementation of longest common subsequence/substring
AStarix: Fast and Optimal Sequence-to-Graph Aligner
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
➗ SIMD-accelerated bitwise hamming distance Python module for hexadecimal strings
Fast fuzzy string search
HUMID: reference free FastQ deduplication
Step is a C++17, header-only library of STL-like algorithms and data structures
Secure implementations of Edit Distance algorithms using EMP-toolkit garbled circuits
STL and Boost compatible edit distance functions for C++
UniTo - Algoritmi - Progetto di laboratorio - 2018/2019
C++ homework code and final project
MAG for approximate pattern matching (MAGA)
calculates the edit distance and the necessary operations between two strings
C++ Tandem Repeats Detector -- Spring 2020 Independent Study Class in the Computer Science Department of Brooklyn College
Solutions to the problems in "Dynamic Programming I", part of the Dynamic Programming Study Plan on LeetCode.
This is the edit distance calculated between two strings (C++)
Bio informatics course materials for NEUB students.
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."