search

Kumar-laxmi / Algorithms

A Repository for algorithms in C, C++, Python and Java
Apache License 2.0
321 stars 366 forks source link

Smith Waterman Algorithm #1605

Closed Mayureshd-18 closed 1 year ago

Mayureshd-18 commented 1 year ago

The Smith-Waterman algorithm is a dynamic programming algorithm used to perform sequence alignment, particularly in bioinformatics. It is an improvement over the Needleman-Wunsch algorithm, as it allows for local sequence alignments and can handle sequences with different lengths.

The algorithm takes two sequences as input and calculates a score that represents their similarity or dissimilarity.

image

Step1. Performance matrix Step2. Backtracking Step3. Finding out the start and the end index Step4 Testing

@Kumar-laxmi Pls assign me this issue.

Mayureshd-18 commented 1 year ago

@Kumar-laxmi Pls assign this to me.

Kumar-laxmi commented 1 year ago

Assigned! @Mayureshd-18 : C, C++, Python and Java