Algorithms in python and C

Optimized string search routines for Rust.

Automatic Essay Scoring implements the Rabin-Karp Algorithm and Synonym Recognition

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.

Toy project of JetBrains JavaCore track for analyzing file types

command line tool for generating files delta with using rolling hash algorithm

Various string search and Fuzzy String Matching algorithms. It contains implementations of Horspool, Boyer-Moore, Rabin-Karp as well as Brute Force algorithms for exact string matching. For Fuzzy Matching, it contains Hamming and Levenshtein Distance algorithms.

Helps to build your solution faster during leetcode contest, without same old template writing.

Minimal code for Rabin-Karp Algorithm for plagiarism checker

Design and Analysis of Algorithms, Assignment - BS CS Degree Program

SISTEM INFORMASI MANAJEMEN TUGAS AKHIR DAN DETEKSI PLAGIARISME PADA JUDUL TUGAS AKHIR MENGGUNAKAN METODE RABIN KARP

Julia and Python search algorithm implementation including Bloom Filter, Aho-Corasick, Boyer-Moore, Knuth-Morris-Pratt, Rabin-Karp, Binary & Sequential; hash algorithm implementation including Fowler-Noll-Vo-1, Jenkins One-at-a-time, Hash Chaining, Linear Probing & Quadratic Probing; sort algorithm implementation including Cocktail, Bitonic, Gno…

A repository containing various string-matching algorithms

Yaroslavl Demidov State University/Math/MP. 6sem. Yakimova.

This is a repository for homework on programming methods

Offers various sorting and string search algorithms, e.g. Quicksort (also Dual-Pivot) or Rabin-Karp (also with Set).

Substring matching with application to genomics/proteomics.

JavaFX string searcher application using Naive, Knuth-Morris-Pratt, Boyer-Moore, and Rabin-Karp pattern searching algorithms.

This is a project that tests 2 string processing algorithms, Rabin-Karp and Knuth-Morris-Pratt. The algorithms were tested in C language.