Skip to content
#

smith-waterman-algorithm

Here are 23 public repositories matching this topic...

smith-waterman-algorithm

A C++ implementation of the Smith - Waterman algorithm. The system consists of 3 different implementations: the one is sequential, while the other two parallelize the execution in a coarse and a fine level respectively, with the use of multithreading.

  • Updated Jan 16, 2023
  • C++

A C++ project to detect mutations on DNA sequence, comparing two DNA samples. This project was built based on a Supercomputing subject and some classic algorithms are used in this project, such as Smith Waterman, Random Local Search and Exaustive Search

  • Updated Jun 5, 2022
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the smith-waterman-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the smith-waterman-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy