You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This program determines the optimal alignment of two nucleotide sequences using the Smith–Waterman algorithm. Optimality, of course, is determined by the values of the gap penalty g and the weight matrix (that lists all of the s(ai , bj )). Finally the program outputs the optimal similarity score along with the optimal alignment.
Narrowly, Find sequences including nucleotide(or amino acid) spacers (Broadly, you can find the speific sequences of front and back while ignoring the middle sequences), and Write the result of finding them to csv files.(Language: Python3.9)
BIAP - A website that serves as a tool to analyze biological data (nucleotide and aminoacid sequences) and provide biology-related information in one place.