Global alignment: Difference between revisions

From CoGepedia
Jump to navigation Jump to search
Ambz (talk | contribs)
No edit summary
No edit summary
 
(6 intermediate revisions by one other user not shown)
Line 1: Line 1:
In the process of global-global alignment, a DNA or a query sequence dictates the length of putative [[homologs]]. Based on sequence similarity to query, the top matches are generated by a given algorithm. The entire length of a given match must bear similarity to the entire length of query sequence. Any sequence having partial similarity to query is excluded from the matches.
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.
In case of global-local alignment, the word "global" applies to the query and "local" applies to the hit. A given match has only partial similarity to the query such that the entire length of a match aligns partially with query.

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.