Global alignment: Difference between revisions

From CoGepedia
Jump to navigation Jump to search
← Older edit
Ambz (talk | contribs)
221 edits
No edit summary
No edit summary
 
(2 intermediate revisions by one other user not shown)
Line 1: Line 1:
Global alignment allows sequences to be aligned from start to end. A scoring matrix is build with ''n'' sequences aligned on ''n ''axes. Each entry in a given cell is matched with corresponding entries in ''n'' dimensions. Consequently, each cell has a score depending upon the threshold values selected for registering a match or a mismatch. A pointer is drawn in a cell that indicates the direction from which the highest score was obtained. In the end, starting from bottom right of matrix the arrows are back tracked to the origin. This gives the best order in which ''n'' sequences should be globally aligned.
Global alignment between two or more sequences forces the sequences to be aligned from the beginning to end of all sequences. It gives the best possible alignment between the sequences based on the scores assigned to each possible alignment. [http://www.en.wikipedia.org/wiki/Needleman-Wunsch_algorithm Needleman-Wunsh] algorithm is often used for global alignments.

Latest revision as of 00:15, 29 September 2009

Global alignment between two or more sequences forces the sequences to be aligned from the beginning to end of all sequences. It gives the best possible alignment between the sequences based on the scores assigned to each possible alignment. Needleman-Wunsh algorithm is often used for global alignments.

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