This is exactly how I would approach this.
Compare Two Sequence To Find The Maximum Similarity
We know BLAST can compare two sequences, however it compares sequences by lining up them. My question is can we shift one sequence then compare the other. Let me give you a simple example:the length is 15
GTTCCTAGTCTAGAC
TCCTAGTCTAGACTT
If we shift it and compare
GTTCCTAGTCTAGAC
|||||||||||||
TCCTAGTCTAGACTT
Then there are 11 letters hit, we define the score by 11/15=73%. Of course, we can shift to whatever we want. How to find the max score? Is there such a software to do it? Thanks.
• 5,702 views
•
link
2 answers
what about using a simple Smith & Waterman algorithm ? e.g: emboss water
• 1 views
•
link
Log in to answer this question.
With the above example, you are talking about sequence identity not similarity.
I think you need to read up on the concepts of global and local alignments, also BLAST does not do what you claim, it does not compare sequences, look up what the acronym stands for, http://en.wikipedia.org/wiki/Sequence_alignment#Global_and_local_alignments
Istvan is correct - strictly speaking BLAST does not compare two sequences. It is possible to align two sequences with BLAST - see Bl2Seq at http://blast.ncbi.nlm.nih.gov/Blast.cgi. Nonetheless, BLOAST is not a reliable tool for the goal you have in mind.