Karp-Rabin sequence-matching implementation using Python.
-
Updated
Apr 11, 2019 - Python
Karp-Rabin sequence-matching implementation using Python.
The Rabin-Karp algorithm, which uses a rolling hash to match patterns in text, is commonly used for exact string matching and plagiarism detection. This work presents a parallel version of the Accelerated Rabin-Karp algorithm, implemented using MPI and Distributed Python disPy.
Automatic Essay Scoring implements the Rabin-Karp Algorithm and Synonym Recognition
Group project 1 from the course Advanced Algorithms
Repo for Algorithm and DataStructures with visualization parameter
This repo contains the source code of Plagiarism detection system using string matching algorithm -Knuth-Morris-Pratt, Boyer-Moore and Rabin Karp.
Algorithms laboratory works
This repository contains code for Design and analysis of Algorithm(IT252) course mini Project "Plagiarism-Detector in Python"
Implementation of efficient string search algorithms (Aho-Corasick, Boyer-Moore, Rabin-Karp) for pattern matching
Add a description, image, and links to the rabin-karp-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the rabin-karp-algorithm topic, visit your repo's landing page and select "manage topics."