Youtor
Bioinformatics part 10 How to perform local alignment
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=IatoWOsJ35Q
For more information, log on to- • http://shomusbiology.weebly.com/ • Download the study materials here- • http://shomusbiology.weebly.com/bio-m... • Global alignments, which attempt to align every residue in every sequence, are most useful when the sequences in the query set are similar and of roughly equal size. (This does not mean global alignments cannot end in gaps.) A general global alignment technique is the Needleman--Wunsch algorithm, which is based on dynamic programming. Local alignments are more useful for dissimilar sequences that are suspected to contain regions of similarity or similar sequence motifs within their larger sequence context. The Smith--Waterman algorithm is a general local alignment method also based on dynamic programming. • Hybrid methods, known as semiglobal or glocal (short for global-local) methods, attempt to find the best possible alignment that includes the start and end of one or the other sequence. This can be especially useful when the downstream part of one sequence overlaps with the upstream part of the other sequence. In this case, neither global nor local alignment is entirely appropriate: a global alignment would attempt to force the alignment to extend beyond the region of overlap, while a local alignment might not fully cover the region of overlap.[5] Another case where semiglobal alignment is useful is when one sequence is short (for example a gene sequence) and the other is very long (for example a chromosome sequence). In that case, the short sequence should be globally aligned but only a local alignment is desired for the long sequence. Source of the article published in description is Wikipedia. I am sharing their material. Copyright by original content developers. • Link- http://en.wikipedia.org/wiki/Main_Page
#############################
