C language algo

Hash Functions and Tables, including Rabin-Karp for strings

This C# program searches the U.S. Constitution for user inputted words using the Rabin-Karp Algorithm.

The Rabin-Karp Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a hash function to compare the pattern string and substrings of the text string and only performs a full string comparison when a hash match is found.

GPU accelerated string search.

Brute Force, Rabin Karp, KMP Algortihm

Implementation of several algorithms solving the classical bioinformatics problems, such as substring search, sequence alignment, matching regular expressions, finding k-similar and minimal window for two strings.

Compare String matching algorithms emprically: Knuth Morris Pratt and Rabin Karp

Лабораторные работы по дисциплине "Программирование" 1 курса ФИТ НГУ

A C# software with GUI that uses 3 string matching algorithms (BF, RK and KMP) for efficient word search.

Naive Algorithm, Rabin-Karp Algorithm, Finite Automata Algorithm, KMP Algorithm.

Desktop Application built with Java to find DNA substrings in linear O(n) time

String matching algorithms written in go

Algorithms laboratory works