Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
-
Updated
Jul 24, 2024 - C
Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Programs covered in DAA Lab during Semester 4
A parallel implementation in MPI of the longest common subsequence algorithm
Master’s Thesis: Parallel Variable Gapped Longest Common Sequence and Incremental Range Maximum Query
Dynamic vs Recursion implementation
C codes for standard algorithms
Implementation of a simple unix diff using longest common subsequence
Data Structures and Operations, Algorithms..
This is a university assignment of algorithm formation and analysis
Takes 2 lists of sequence of places and find the number and sequence of places that can be visited by both of them.
XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters
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."