Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.

Algorithms useful for CS graduates

This project implements substring search and sequence alignment algorithms for molecular sequences analysis. It includes the Rabin-Karp algorithm for substring search and the Needleman-Wunsch algorithm for sequence alignment. Developed in C++17, the code follows Google Style and includes a Makefile for building and testing the program.

Common Data Structures And Algorithms Implemented In C++. FOR LEARNING PURPOSES ONLY

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

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.

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

A short assignment app, which allows to search text from files via GUI interface using windows form C++