A easy and clear javascript solution of the smith-waterman algorithm.
Repository for the paper "Dotplots und Sequenzanalysen als Untersuchungsinstrumente für Überlieferungsgemeinschaften am Beispiel von Priameln"
Examples for SDAccel 2017.1+ on AWS F1 instances
AlnSeq runs a c coded Smith Waterman, Needleman Wunsch, and an Hirschberg. It can run as a standalone or as a library for python.
Implementation of K-means that categorizes sequences into groups based on similarity score derived from Smith-Waterman algorithm.
Bilkent University CS 481 Bioinformatics Algorithms assignments
Efficient and parallel implementation of Smith Waterman edit distance algorithm.
A Series of SW Parallelization for Genome Assemblies
🚀 R interface for SSW, a fast implementation of the Smith-Waterman algorithm using SIMD
Benchmark the performance of sequence alignment workflows
Expanded version of the traditional Smith Waterman algorithm for local alignment
Text Similarity Analysis, POS tagging, Hidden markov models, Dependency parser
Algorithms to solve bioinformatics problems
Fuzzy-finder written in Rust
Easy to use and modify implementation of Smith-Waterman Algorithm.
The first work to provide a comprehensive survey of a prominent set of algorithmic improvement and hardware acceleration efforts for the entire genome analysis pipeline used for the three most prominent sequencing data, short reads (Illumina), ultra-long reads (ONT), and accurate long reads (HiFi). Described in arXiv (2022) by Alser et al. https…
Showcase of parallelization technologies using sequence alignment algorithms
Lots of protein
Add a description, image, and links to the smith-waterman topic page so that developers can more easily learn about it.
To associate your repository with the smith-waterman topic, visit your repo's landing page and select "manage topics."