Global alignment: Difference between revisions

From CoGepedia
Jump to navigation Jump to search
Ambz (talk | contribs)
No edit summary
Ambz (talk | contribs)
No edit summary
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 allows sequences to be aligned from beginning to end. It gives the best possible alignment between the sequences based on the scores assigned to each possible alignment. [[Needleman-Wunsh]] algorithm is used for constructing the scoring the global alignments between the sequences.

Revision as of 23:21, 25 September 2009

Global alignment allows sequences to be aligned from beginning to end. It gives the best possible alignment between the sequences based on the scores assigned to each possible alignment. Needleman-Wunsh algorithm is used for constructing the scoring the global alignments between the sequences.