Implementation of Trie Data Structure in Java.
-
Updated
Nov 6, 2022 - Java
Implementation of Trie Data Structure in Java.
All the important Data Structures and Algorithms implemented using Java
Compare String matching algorithms emprically: Knuth Morris Pratt and Rabin Karp
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
A basic string manipulation problem
Effective string searching algorithm (Aho-Corasick).
String based algorithms explained in detail using Python/Java.
In the sample code provided I have used Java to compare two given strings getting the percentage match using the Fuzzy Logic.
Implementations and analysis of the Brute Force and Horspool string matching algorithms in Java.
Translate any RNA sequence into the corresponding amino acid sequence
Executing important algorithms using java
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,
Solutions to my advent of code questions 2023
PIJ Lab Assignment 8
Web application for retrieving tweet data using Knuth–Morris–Pratt and Boyer–Moore algorithms for the string matching.
Java toolkit for multi-threaded preprocessing of extremely large .fastq files in the GBS Pipeline by demultiplexing, filtering, and trimming sequenced DNA.
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."