Skip to content

Emanuele992/Smith-Waterman-Algorithm

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 

Repository files navigation

The Smith Waterman local alignment

  • Author: Slaviana Pavlovich
  • Acknowledgment: This code was submitted for the exam in the "Computing" module as part of MSc in Bioinformatics and Theoretical Systems Biology at Imperial College London
  • Date: April 19th 2020
  • Language: Python 3.7

This repository contains the Python script that implements the Smith Waterman algorithm to produce a sequence alignment. The program will read two sequences from two files and print the alignment to the screen. The algorithm is simplified in that it only needs to use a basic scoring method, regardless of the nature of the sequences being aligned. The scores are: match (+1), mismatch (-1) and gap (-1).

About

Python implementation of Smith Waterman Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages

  • Python 100.0%