Bioinformatics part 7 How to perform Global alignment 1
421.6 هزار بار بازدید -
11 سال پیش
-
This Bioinformatics lecture explains how
This Bioinformatics lecture explains how to perform global sequence alignment with sample example problem. Watch this video to understand the process of sequence alignment in details.
For more information, log on to-
http://shomusbiology.weebly.com/
Download the study materials here-
http://shomusbiology.weebly.com/bio-m...
In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences. Aligned sequences of nucleotide or amino acid residues are typically represented as rows within a matrix. Gaps are inserted between the residues so that identical or similar characters are aligned in successive columns.
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.
Description Article source: Wikipedia
Link- http://en.wikipedia.org/wiki/Main_Page
Credit goes to original content developers.
For more information, log on to-
http://shomusbiology.weebly.com/
Download the study materials here-
http://shomusbiology.weebly.com/bio-m...
In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences. Aligned sequences of nucleotide or amino acid residues are typically represented as rows within a matrix. Gaps are inserted between the residues so that identical or similar characters are aligned in successive columns.
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.
Description Article source: Wikipedia
Link- http://en.wikipedia.org/wiki/Main_Page
Credit goes to original content developers.
11 سال پیش
در تاریخ 1392/08/07 منتشر شده
است.
421,646
بـار بازدید شده