Global alignment: Difference between revisions
Jump to navigation
Jump to search
Created page with 'In the process of 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 ...' |
No edit summary |
||
| (8 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
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.