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

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

Embed Size (px)

Citation preview

Page 1: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

1

Multiple Sequence Alignment

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

Page 2: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

2

What is a multiple alignment?

Page 3: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

3

Page 4: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

4

An alignment of ten I-set immunoglobin superfamily

Page 5: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

5

Motivation

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

cts; a common function; a common evolutionary source.

Page 6: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

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: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

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: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

8

Page 9: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

9

Page 10: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

10

Page 11: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

11

Page 12: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

12

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

this problem.

Page 13: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

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: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

14

Page 15: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

15

Page 16: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

16

Page 17: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

17

Page 18: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

18

Page 19: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

19

Page 20: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

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: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

21

Page 22: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

22

Page 23: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

23

Page 24: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

24

Page 25: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

25

Page 26: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

26

Page 27: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

27

Page 28: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

28

Page 29: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

29

Page 30: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

30

Page 31: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

31

Page 32: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

32

Page 33: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

33

Page 34: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

34

Page 35: 1 Multiple Sequence Alignment 暨南大學資訊工程學系 黃光璿 2004/05/31

35

參考資料及圖片出處

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

Cambridge University Press, 1998.