https://github.com/seb943/smith_waterman_py
Implementing the Smith-Waterman algorithm in Python
https://github.com/seb943/smith_waterman_py
bioinformatics bioinformatics-scripts bioinformatics-tool dynamic-programming python smith-waterman smith-waterman-algorithm
Last synced: 4 months ago
JSON representation
Implementing the Smith-Waterman algorithm in Python
- Host: GitHub
- URL: https://github.com/seb943/smith_waterman_py
- Owner: Seb943
- Created: 2020-01-16T11:12:31.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2021-01-12T09:24:18.000Z (over 4 years ago)
- Last Synced: 2025-02-02T09:41:19.344Z (8 months ago)
- Topics: bioinformatics, bioinformatics-scripts, bioinformatics-tool, dynamic-programming, python, smith-waterman, smith-waterman-algorithm
- Language: Python
- Homepage:
- Size: 13.7 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Smith_Waterman_Py
Implementing the Smith-Waterman algorithm in Python
https://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm
"The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences or protein sequences. Instead of looking at the entire sequence, the Smith–Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure."
Usage :
- You can define the two sequences to be aligned at the beginning of the code
- This program supports affine penalties for gap : simply define the gap penalty in the function at the very end of the script
- Run the code, it displays the substitution matrix and the alignement, along with a couple stats
:information_source: Please report any bug/issue in the *issues* section or directly at sebcararo@hotmail.fr. Any feedback is really appreciated :speech_balloon: :+1:.