Compare String matching algorithms emprically: Knuth Morris Pratt and Rabin Karp
-
Updated
Jun 9, 2019 - Java
Compare String matching algorithms emprically: Knuth Morris Pratt and Rabin Karp
All the important Data Structures and Algorithms implemented using Java
Implementation of the Aho-Corasick multiple pattern matching finite state automaton.
Implementations and analysis of the Brute Force and Horspool string matching algorithms in Java.
Web based - Spam detector
Implementation of Trie Data Structure in Java.
A basic string manipulation problem
Assignments for the course CSD303 Theory Of Computation
Translate any RNA sequence into the corresponding amino acid sequence
MiniFinder is a dual-mode search engine simulator designed to demonstrate the practical application of string-matching algorithms. It offers both Local Search Mode for searching within offline .txt files and Web Search Mode for simulating search across online content. Ideal for students and educators, MiniFinder showcases how algorithms like Naive,
Java toolkit for multi-threaded preprocessing of extremely large .fastq files in the GBS Pipeline by demultiplexing, filtering, and trimming sequenced DNA.
Finding vowel letters in the string
Soft string matching routines, with some accompanying datasets.
A simple decrypter that lists every combination a arbitrary-shift sentence/word could have meant before encryption
Executing important algorithms using java
A diiferent approach to get a solution to string matching with O(n) time complexity.
Add a description, image, and links to the string-matching topic page so that developers can more easily learn about it.
To associate your repository with the string-matching topic, visit your repo's landing page and select "manage topics."