C++ homework code and final project
-
Updated
Jan 4, 2018 - C++
C++ homework code and final project
A basic implementation of the MPED in Rust
Dynamic Programming code for MO640 course
A little library to calculate the edit distance between 2 strings.
Exercises from the "Algorithm and Data structures" course at University of Florence.
Minimum Edit Distance (Advance Algorithm Project)- Implementing Dynamic, Greedy, Branch and Bound, K-strip Algo
Java exercises to evaluate sorting algorithms and compare strings using edit distance.
Calculates the edit distance between two strings
UniTo - Algoritmi - Progetto di laboratorio - 2018/2019
A module to calculate the edit distance between two lists.
Tree edit distances using the Zhang-Shasha algorithm
IEnumerableCorrelater knows to compare two IEnumerables or strings. It returns the distance between them, and returns two arrays which represent their "best match". IEnumerableCorrelater can be used to create diff tools.
Nim wrapper for the Edlib library
MAG for approximate pattern matching (MAGA)
calculates the edit distance and the necessary operations between two strings
Official implementation of "Weighted Weighted Edit Distance optimized using Genetic Algorithm for SMILES-based Compound Similarity, PAAA(SCIE)".
Find pairs of similar files according to Levenshtein distance.
Weighted Leveshtein Distance and its extended interfaces written in Go.
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."