35
1 Multiple Sequence Alignment 暨暨暨暨暨暨暨暨暨暨 暨暨暨 2004/05/31

Multiple Sequence Alignment

  • Upload
    nerice

  • View
    60

  • Download
    0

Embed Size (px)

DESCRIPTION

Multiple Sequence Alignment. 暨南大學資訊工程學系 黃光璿 2004/05/31. What is a multiple alignment?. An alignment of ten I-set immunoglobin superfamily. Motivation. A multiple alignment may suggest a common structure of the protein products; a common function; a common evolutionary source. Issues. - PowerPoint PPT Presentation

Citation preview

Page 1: Multiple Sequence Alignment

1

Multiple Sequence Alignment

暨南大學資訊工程學系黃光璿2004/05/31

Page 2: Multiple Sequence Alignment

2

What is a multiple alignment?

Page 3: Multiple Sequence Alignment

3

Page 4: Multiple Sequence Alignment

4

An alignment of ten I-set immunoglobin superfamily

Page 5: Multiple Sequence Alignment

5

Motivation

A multiple alignment may suggest a common structure of the protein produ

cts; a common function; a common evolutionary source.

Page 6: Multiple Sequence Alignment

6

Issues

How to define meaningful scoring function for an alignment? evolutionary correct alignment --- more difficult! structure alignment

How to find the best alignment? by algorithms

Page 7: Multiple Sequence Alignment

7

Three types of alignment problems DNA protein

joined by disulfide bond RNA

more difficult due to long-range correlation

We focus on alignment problems of sequences of DNAs or proteins.

Page 8: Multiple Sequence Alignment

8

Page 9: Multiple Sequence Alignment

9

Page 10: Multiple Sequence Alignment

10

Page 11: Multiple Sequence Alignment

11

Page 12: Multiple Sequence Alignment

12

To prove that a computational problem is NP-hard, we need to reduce an NP-complete (hard) problem to

this problem.

Page 13: Multiple Sequence Alignment

13

When a computational problem is NP-hard, we deal with it by heuristic: convince other people by experiment

s approximation: how to analyze the performanc

e? randomization: how to design a reasonable alg

orithm

Page 14: Multiple Sequence Alignment

14

Page 15: Multiple Sequence Alignment

15

Page 16: Multiple Sequence Alignment

16

Page 17: Multiple Sequence Alignment

17

Page 18: Multiple Sequence Alignment

18

Page 19: Multiple Sequence Alignment

19

Page 20: Multiple Sequence Alignment

20

Branch & bound heuristic for the DP algorithm of the Sum-of-pairs Carrillo & Lipman (1988) The idea was implemented in the famous p

roblem MSA. Lipman, Altshul, Kececiogly, 1989

MSA can align 6 sequences of length ~200 in reasonable time.

Page 21: Multiple Sequence Alignment

21

Page 22: Multiple Sequence Alignment

22

Page 23: Multiple Sequence Alignment

23

Page 24: Multiple Sequence Alignment

24

Page 25: Multiple Sequence Alignment

25

Page 26: Multiple Sequence Alignment

26

Page 27: Multiple Sequence Alignment

27

Page 28: Multiple Sequence Alignment

28

Page 29: Multiple Sequence Alignment

29

Page 30: Multiple Sequence Alignment

30

Page 31: Multiple Sequence Alignment

31

Page 32: Multiple Sequence Alignment

32

Page 33: Multiple Sequence Alignment

33

Page 34: Multiple Sequence Alignment

34

Page 35: Multiple Sequence Alignment

35

參考資料及圖片出處

1. Biological Sequence Analysis – Probabilistic Models of Proteins and Nucleic AcidsR. Durbin, S. Eddy, A. Krogh, and G. Mitchison,

Cambridge University Press, 1998.