Local alignment: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
[[Image:lcs.png|thumb|500px|right]] | |||
Local alignment only aligns the most similar regions between the sequences. The measure of similarity will depend on the parameters used for registering a mismatch. [http://www.wikipedia.org/wiki/Smith-Waterman_algorithm Smith-Waterman] algorithm, a variation of Needleman Wunsch algorithm, is used for local alignment. Unlike global alignment, only sub-region of sequences is aligned in local alignment. | Local alignment only aligns the most similar regions between the sequences. The measure of similarity will depend on the parameters used for registering a mismatch. [http://www.wikipedia.org/wiki/Smith-Waterman_algorithm Smith-Waterman] algorithm, a variation of Needleman Wunsch algorithm, is used for local alignment. Unlike global alignment, only sub-region of sequences is aligned in local alignment. |
Revision as of 00:11, 26 September 2009

Local alignment only aligns the most similar regions between the sequences. The measure of similarity will depend on the parameters used for registering a mismatch. Smith-Waterman algorithm, a variation of Needleman Wunsch algorithm, is used for local alignment. Unlike global alignment, only sub-region of sequences is aligned in local alignment.