## Aho–Corasick Algorithm

Admin | 19-Mar-2016 | C#, VB.Net, C, C++, PHP

Aho–Corasick algorithm is a string searching algorithm. It is a kind of dictionary-matching algorithm that locates elements of a finite set of ...

Admin | 19-Mar-2016 | C#, VB.Net, C, C++, PHP

Aho–Corasick algorithm is a string searching algorithm. It is a kind of dictionary-matching algorithm that locates elements of a finite set of ...

Admin | 29-Dec-2016 | C#, VB.Net, C, C++, PHP

This algorithm searches for all the occurrences of pattern and its permutations (or anagrams) in the specified text.

Admin | 28-May-2016 | C#, VB.Net, C, C++, PHP

This is a exact string matching version of bitap algorithm. The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet ...

Admin | 28-Sep-2015 | C#, VB.Net, C, C++, PHP

Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search ...

Admin | 28-Sep-2015 | C#, VB.Net, C, C++, PHP

Finite-State Automaton is a string searching algorithm.

Admin | 28-May-2016 | C#, VB.Net, C, C++, PHP

This is a fuzzy string matching version of bitap algorithm. The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet ...

Admin | 28-Sep-2015 | C#, VB.Net, C, C++, PHP

Knuth–Morris–Pratt (a.k.a KMP Algorithm) is a string search algorithm. it searches for occurrences of a sub-string within a ...

Admin | 04-Jun-2016 | C#, VB.Net, C, C++, PHP

Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is ...

Admin | 07-Jun-2016 | C#, VB.Net, C, C++

The longest common subsequence (LCS) is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two ...

Admin | 28-Sep-2015 | C#, VB.Net, C, C++, PHP

Longest common substring is an algorithm that finds the longest string that is a substring of two or more strings.