Fuzzy finder using Smith-Waterman algorithm
-
Updated
Mar 29, 2024 - Go
#
smith-waterman
Here are 3 public repositories matching this topic...
A simple application to calculate similarity between two files (text document) using Smith-Waterman algorithm that is used originally to determine similar region between two sequences of DNA
-
Updated
Apr 15, 2017 - Go
Go metrics for calculating string similarity and other string utility functions
golang
string
smith-waterman
levenshtein
jaro-winkler
string-metrics
string-distance
jaccard-similarity
jaccard
string-matching
string-similarity
hamming-distance
jaro
n-gram
jaccard-index
overlap-coefficient
dice-coefficient
smith-waterman-gotoh
sorensen-dice
n-gram-intersection
-
Updated
Nov 15, 2024 - Go
Improve this page
Add a description, image, and links to the smith-waterman topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the smith-waterman topic, visit your repo's landing page and select "manage topics."