A Java application which finds similar strings based on common substrings
-
Updated
Jun 23, 2017 - Java
A Java application which finds similar strings based on common substrings
This is a project that shows how to find the longest common substring in an array of strings.
Get the LCS for several strings (more than 2) using suffix array and stack
A lexer and longest common sequence finder (between JS source code files)
Suffix Tree based method to find repeated sequences
An implementation of the `Longest common substring` algorithm for PHP.
This package allow use strings operations to generic sequence
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
Step is a C++17, header-only library of STL-like algorithms and data structures
Here are some dynamic programming problem solutions.
Implementation All Kind of Algorithm .. Such as..... Back-traking,Dinamic Progra, FBS,DFS,Number theory,Search Algorithm,Diakastra,Floyed Warshal,Hamiltonpath,KMP,Longest Common Subsequence,Robin Cup Pattern Maching,Selection Sort
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
Dynamic Programming
String Comparision in C#.NET
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
LCS and Edit Distance text corrector
Spell Checker
Add a description, image, and links to the longest-common-substring topic page so that developers can more easily learn about it.
To associate your repository with the longest-common-substring topic, visit your repo's landing page and select "manage topics."