bme 130 – genomes lecture 26 molecular phylogenies i

22
BME 130 – Genomes Lecture 26 Molecular phylogenies I

Post on 20-Dec-2015

223 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: BME 130 – Genomes Lecture 26 Molecular phylogenies I

BME 130 – Genomes

Lecture 26

Molecular phylogenies I

Page 2: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Cacao genome sequenced

http://www.cacaogenomedb.org/

Page 3: BME 130 – Genomes Lecture 26 Molecular phylogenies I

A phylogeny

Page 4: BME 130 – Genomes Lecture 26 Molecular phylogenies I

How can we construct a phylogeny?

Page 5: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Convergent evolution (homoplasy)

Page 6: BME 130 – Genomes Lecture 26 Molecular phylogenies I

apomorphicplesiomorphicplesiomorphic

Page 7: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Molecular phylogenies with sequence data

Benefits?

Page 8: BME 130 – Genomes Lecture 26 Molecular phylogenies I
Page 9: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Number of trees# taxa # unrooted

trees# rooted trees

3 1 3

4 3 15

5 15 105

6 105 945

7 945 10395

8 10395 135135

9 135135 2027025

10 2027025 34459425

Page 10: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Outgroup can root a tree

Page 11: BME 130 – Genomes Lecture 26 Molecular phylogenies I
Page 12: BME 130 – Genomes Lecture 26 Molecular phylogenies I
Page 13: BME 130 – Genomes Lecture 26 Molecular phylogenies I
Page 14: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Anc: ACGTCGAGTTATTA

A: ATGTCGGGTTATTA

B: ACGTCGAGTCATTC

C: ACGCTGAGTCATTA

Page 15: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Patterson and Reich (2006) Nature

441(7097):1103

Page 16: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Sequence alignment is necessary for phylogenetic analysis

Page 17: BME 130 – Genomes Lecture 26 Molecular phylogenies I
Page 18: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Distance methods for phylogenetic reconstruction:UPGMA: pick two closest nodes, collapse, continueNeighbor-joining (NJ): pick two nodes that minimize total branch length, collapse, continue

Page 19: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Bootstrapping to measure robustness of phylogenetic tree

Page 20: BME 130 – Genomes Lecture 26 Molecular phylogenies I

Phylogenetic methods that search tree-space

Maximum parsimony: correct tree is the one requiring the fewest changes

Maximum-likelihood: p(D|tree, M)

Page 21: BME 130 – Genomes Lecture 26 Molecular phylogenies I

The molecular clock

Page 22: BME 130 – Genomes Lecture 26 Molecular phylogenies I