STL and Boost compatible edit distance functions for C++
-
Updated
Apr 14, 2014 - C++
STL and Boost compatible edit distance functions for C++
calculates the edit distance and the necessary operations between two strings
C++ homework code and final project
MAG for approximate pattern matching (MAGA)
C++ Tandem Repeats Detector -- Spring 2020 Independent Study Class in the Computer Science Department of Brooklyn College
UniTo - Algoritmi - Progetto di laboratorio - 2018/2019
Programming assignments for the course CSE3081 - Design and Analysis of Algorithms course (알고리즘설계와분석), Fall 2020, Sogang University
Step is a C++17, header-only library of STL-like algorithms and data structures
This is the edit distance calculated between two strings (C++)
In the Edit Distance problem, we need to find the minimum number of edits or operations required to make two strings equal.
Secure implementations of Edit Distance algorithms using EMP-toolkit garbled circuits
AStarix: Fast and Optimal Sequence-to-Graph Aligner
Fast fuzzy string search
All solutions to the "Algorithms II" study plan on LeetCode.
Solutions to the problems in "Dynamic Programming I", part of the Dynamic Programming Study Plan on LeetCode.
All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I.
Approximate pattern matching with Counting Filter on q-grams using SSE instructions (CF2)
A single header C++ library for compute edit distance (Levenshtein distance), supporting wstring ( and Chinese string).
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."