Highly customizable, ambiguity-aware dotplots for visual sequence analyses

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.

Classification of bus trajectories using multiple classifiers and plotting them using gmplot.

Implementation of some important algorithms

A chess analytics tool that compares user-submitted games to a database of GM games, helping users learn stronger continuations by studying closest matches.

Python code for Implementation of Data Structures and Algorithms

This project applies bioinformatics techniques to analyze biological sequences, including protein structure prediction, sequence alignment, and comparative genomics using tools like BLASTP, AlphaFold3, and BioPython. It combines algorithmic methods with practical applications in computational genomics.

This Repository Containg all the basic concept of DP and pattern (01Knapsack,unbounded knapsack, LCS, Matrix chain Maniplication etc) and more than 80 question with their solution (Recursive, Memorization, Bottom Up) in 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.

Serializable diff applyer for files in Python - UAIC FII PYTHON

Dynamic Programming Practical Implementations.

Comparison of an exact method (DFS) and a metaheuristic (Tabu Search) to solve the Longest Common Subsequence (LCS) problem in Python.

This repo contains solutions to problems solved using dynamic programming with python.

理解最长公共子序列算法。Understanding Longest Common Subsequence algorithm.