Difference between revisions of "Local alignment"

From CoGepedia
Jump to: navigation, search
 
(9 intermediate revisions by one other user not shown)
Line 1: Line 1:
−
Local alignment gives the alignment order in which only the most similar regions of ''n'' sequences are aligned in ''n'' dimensions. The measure of similarity differs between the parameters selected. The cells of scoring matrix are more homogeneous than those of global alignment matrix. No highest score less than zero is recorded and a pointer is only added when a score is greater than zero. In the end, trace-back begins from the maximum score and ends at the origin of matrix. This variation of assigning scores in a matrix 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 18:16, 28 September 2009

Lcs.png

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.

Retrieved from "https://genomevolution.org/wiki/index.php?title=Local_alignment&oldid=763"