Difference between revisions of "Local alignment"

From CoGepedia
Jump to: navigation, search
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_algorithm Smith-Waterman] algorithm, a variation of Needleman Wunsch algorithm, is used for local alignment that makes local alignment more stringent than global 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 17:48, 25 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.