msa_ppt - Sequence Comparison Introduction Comparison...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Sequence Comparison Introduction Comparison Homogy -- Analogy Identity -- Similarity Pairwise -- Multiple Scoring Matrixes Gap -- indel Global -- Local Manual alignment, dot plot visual inspection Dynamic programming Needleman-Wunsch exhaustive global alignment Smith-Waterman exhaustive local alignment Multiple alignment Database search BLAST FASTA
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Sequence Comparison Multiple alignment (Multiple sequence alignment: MSA) Application Procedure Extrapolation Allocation of an uncharacterized sequence to a protein family. Phylogenetic analysis Reconstruction of the history of closely related proteins and protein families. Pattern identification Identification of regions characteristic of a function by conserved positions. Domain identification Turning MSA into a domain or protein family specific profile may be useful in identifying new or remote family members. DNA regulatory elements Turning DNA-MSAs of a binding site into a weight matrix may be used in scanning other DNA sequences for potential similar binding sites. Structure prediction Good MSAs yield high quality prediction of secondary structure and help building 3D models. PCR analysis Identification of less degenerated regions of a protein family are useful in fishing out new members by PCR (primer design).
Background image of page 2
Multiple sequence alignment - Computational complexity V S N S A N S V S N S _ S N A Sequence Comparison Multiple alignment
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Alignment of protein sequences with 200 amino acids using dynamic programming # of sequences CPU time (approx.) 2 1 sec 4 10 4 sec – 2,8 hours 5 10 6 sec – 11,6 days 6 10 8 sec – 3,2 years 7 10 10 sec – 371 years Multiple sequence alignment - Computational complexity Sequence Comparison Multiple alignment
Background image of page 4
Approximate methods for MSA Sequence Comparison Multiple alignment Multidimensional dynamic programming (MSA, Lipman 1988) Progressive alignments (Clustalw, Higgins 1996; PileUp, Genetics Computer Group (GCG)) Local alignments (e.g. DiAlign, Morgenstern 1996; lots of others) Iterative methods  (e.g. PRRP, Gotoh 1996) Statistical methods  (e.g. Bayesian Hidden Markov Models)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Multiple sequence alignment - Programs Sequence Comparison Multiple alignment OMA Combalign DCA T-Coffee Clustal Dalign MSA Interalign Prrp Sam HMMER GA SAGA Multidimentional Dynamic programming Progressive Iterative HMMS GAs Non tree based Tree based
Background image of page 6
Multiple sequence alignment - Computational complexity Sequence Comparison Multiple alignment Program Seq type Alignment Methode Comment ClustalW Prot/DNA Global Progressive No format limitation Run on Windows too! PileUp
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 29

msa_ppt - Sequence Comparison Introduction Comparison...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online