Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
-
Updated
Jul 20, 2025 - C++
Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
✔ My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera ( University of California San Diego ) With "Go In Depth" Part Which Contains More Details With Each of The Course Topics
Highly customizable, ambiguity-aware dotplots for visual sequence analyses
A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..
super fast cpp implementation of longest common subsequence/substring
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Time series distance measures
Go implementation of the Patience Diff algorithm
String Comparision in C#.NET
This repo consists codes of Aditya Verma - Dynamic Programming Playlist
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming
CPP codes for some popular algorithms
Python implementation of several sequence alignment algorithms such as Waterman-Smith-Beyer, Gotoh, and Needleman-Wunsch intended to calculate distance, show alignment, and display the underlying matrices.
Here are some of my Data structures and algorithms created in Java Programming Language using IntelliJ IDE.
Step is a C++17, header-only library of STL-like algorithms and data structures
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
An end-to-end plagiarism classification model, deployed to SageMaker.
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."