Local alignment: Difference between revisions

From CoGepedia
Jump to navigation Jump to search
Ambz (talk | contribs)
No edit summary
No edit summary
 
(4 intermediate revisions by one other user not shown)
Line 1: Line 1:
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 Smith-Waterman] algorithm, a variation of Needleman Wunsch algorithm, is used for local alignment that makes local alignment more stringent than global alignment.
[[Image:lcs.png|thumb|500px|right]]
 
Local alignment algorithms only aligns the most similar regions between sequences. [http://www.wikipedia.org/wiki/Smith-Waterman_algorithm Smith-Waterman] algorithm, a variation of Needleman Wunsch algorithm, is often used for local alignments. Unlike global alignment, only sub-region of sequences is aligned in local alignment.

Latest revision as of 00:16, 29 September 2009

Local alignment algorithms only aligns the most similar regions between sequences. Smith-Waterman algorithm, a variation of Needleman Wunsch algorithm, is often used for local alignments. Unlike global alignment, only sub-region of sequences is aligned in local alignment.