Go implementation of the Patience Diff algorithm
-
Updated
May 13, 2024 - Go
Go implementation of the Patience Diff algorithm
This repository contains some well-known programming problems and their greedy/recusrive as well as dynamic algorithms.
Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
A chess analytics tool that compares user-submitted games to a database of GM games, helping users learn stronger continuations by studying closest matches.
Spell Checker using a Hash Table
super fast cpp implementation of longest common subsequence/substring
This repo contains solutions to problems solved using dynamic programming with python.
This repository serves as a valuable resource for individuals interested in exploring the design and analysis of algorithms. Whether you are a student studying computer science or a developer seeking to enhance your algorithmic skills, this collection will provide you with a diverse set of algorithms to learn from and apply in your projects.
Step20 is a C++20, header-only library of STL-like algorithms and data structures
iOS Islamic application for the holy Quran, helps the Muslims to have the Quran the hole time in their phones to read , memorize and to search for specified verses on it. Also to test them self by auto memorization and evaluation.
Contains Plagarism checking, implemented with the concept of Longest common subsequence.
Learned as a part of Algorithm Design Course
Plagiarism Detection is a Python-based project that aims to identify potential cases of plagiarism in textual documents. This project provides a useful tool for educators, researchers, and content creators to detect and prevent academic and intellectual property violations.
This repository contains all my Algorithms and Data Structures projects
Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Building a plagiarism detector that examines a text file and performs binary classification labeling that file as either plagiarized or not, depending on how similar that text file is to a provided source text.
Model solving the Longest Common Subsequence problem with multiple sequences with decision diagrams
Add a description, image, and links to the longest-common-subsequence topic page so that developers can more easily learn about it.
To associate your repository with the longest-common-subsequence topic, visit your repo's landing page and select "manage topics."