Difference between revisions of "Local alignment"
From CoGepedia
(Created page with 'Local-local alignment is best for detecting remote homologs and identifying evolutionary conserved domains. The matches may have variable lengths and share only partial similarit...') |
|||
| (11 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
| − | Local | + | [[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 18:16, 28 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.
