longest-common-subsequence

Algorithm for ultra-scale multiple protein sequence alignments: 3 million ABC transporters analyzed in 5 minutes and 18 GB of RAM.

Highly customizable, ambiguity-aware dotplots for visual sequence analyses

✔ 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

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

High-performance fuzzy string matching for .NET with bit-parallel Levenshtein/Indel algorithms, FuzzyWuzzy-compatible scorers, and fast extraction APIs.

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

Go implementation of the Patience Diff algorithm

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

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.

String Comparision in C#.NET

Kotlin multiplatform library offering various algorithms to measure string similarity and distance

⚡ Fast, zero-dependency text diff & string comparison for JavaScript/TypeScript — Myers O(ND) shortest edit script on typed arrays. Word/char/line/grapheme modes, Unicode-safe (Korean, CJK, emoji), ~2.9 kB min+gzip, works in Node and browsers.

Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming

CPP codes for some popular algorithms

Here are some of my Data structures and algorithms created in Java Programming Language using IntelliJ IDE.

Edit distances, similarity scores, LCS, and diff for Gleam.

Minimalist, deterministic, lightweight, fast, and portable verification of AI-generated text: measure groundedness in a source as verbatim reuse (contiguous matching) or verbatim paraphrasing (LCS). Use as a decorator over generate(), a CLI or a CI gate. Useful for research and production purposes.