phylogenetic trees iii maximum parsimony
play

Phylogenetic trees III Maximum Parsimony . Gerhard Jger ESSLLI - PowerPoint PPT Presentation

Apr 28, 2023 •440 likes •996 views

. Phylogenetic trees III Maximum Parsimony . Gerhard Jger ESSLLI 2016 Gerhard Jger Maximum Parsimony ESSLLI 2016 1 / 30 Background . Background . Gerhard Jger Maximum Parsimony ESSLLI 2016 2 / 30 Background Character-based

  1. . Phylogenetic trees III Maximum Parsimony . Gerhard Jäger ESSLLI 2016 Gerhard Jäger Maximum Parsimony ESSLLI 2016 1 / 30

  2. Background . Background . Gerhard Jäger Maximum Parsimony ESSLLI 2016 2 / 30

  3. Background Character-based tree estimation distance-based tree estimation has several drawbacks: very strong theoretical assumptions - e.g., all characters evolve at the same rate Neighbor Joining and UPGMA produce good but sub-optimal trees no solid statistical justification for those algorithms distances are black boxes — we get a tree, but we learn nothing about the history of individual characters character-based tree estimation estimates complete scenario (or distribution over scenarios) for each character finds the tree that best explains the observed variation in the data (at least in theory, that is...) Gerhard Jäger Maximum Parsimony ESSLLI 2016 3 / 30

  4. Parsimony . Parsimony . Gerhard Jäger Maximum Parsimony ESSLLI 2016 4 / 30

  5. Parsimony Parsimony of a tree background reading: Ewens and Grant (2005), 15.6 suppose a character matrix and a tree are given parsimony score: minimal number of mutations that has to be assumed to explain the character values at the tips, given the tree Gerhard Jäger Maximum Parsimony ESSLLI 2016 5 / 30

  6. Parsimony Parsimony of a tree Kopf kop head tête testa cap "head" "head" "head" "head" "head" "head" Gerhard Jäger Maximum Parsimony ESSLLI 2016 6 / 30

  7. Parsimony Parsimony of a tree Kopf kop head tête testa cap "head" "head" "head" "head" "head" "head" Gerhard Jäger Maximum Parsimony ESSLLI 2016 6 / 30

  8. Parsimony Parsimony of a tree ? ? ? "head" ? ? Kopf kop head tête testa cap "head" "head" "head" "head" "head" "head" Gerhard Jäger Maximum Parsimony ESSLLI 2016 6 / 30

  9. Parsimony Parsimony of a tree *kop testa "head" "head" Kopf kop head tête testa cap "head" "head" "head" "head" "head" "head" Gerhard Jäger Maximum Parsimony ESSLLI 2016 6 / 30

  10. Parsimony Parsimony of a tree *kaput- "head" *haubud- caput "head" "head" *kop testa "head" "head" Kopf kop head tête testa cap "head" "head" "head" "head" "head" "head" Gerhard Jäger Maximum Parsimony ESSLLI 2016 6 / 30

  11. Parsimony Parsimony reconstruction B Parsimony = 2 B B C A B A A C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 7 / 30

  12. Parsimony Parsimony reconstruction A Parsimony = 3 A B C A B A A C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 7 / 30

  13. Parsimony Parsimony reconstruction C Parsimony = 3 A C C A B A A C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 7 / 30

  14. Parsimony Weighted parsimony reconstruction B Weighted Weight matrix Parsimony = 3 A B C B B A 0 1 2 C B 1 0 2 A C 2 2 0 A A B C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 8 / 30

  15. Parsimony Weighted parsimony reconstruction A Weight matrix Weighted Parsimony = 4 A B C A B A 0 1 2 C B 1 0 2 A C 2 2 0 A A B C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 8 / 30

  16. Parsimony Weighted parsimony reconstruction C Weighted Weight matrix Parsimony = 5 A B C A C A 0 1 2 C B 1 0 2 A C 2 2 0 A A B C C B Gerhard Jäger Maximum Parsimony ESSLLI 2016 8 / 30

  17. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 9 / 30

  18. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 9 / 30

  19. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 9 / 30

  20. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 9 / 30

  21. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 10 / 30

  22. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 10 / 30

  23. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 10 / 30

  24. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 10 / 30

  25. Parsimony Dynamic Programming (Sankoff Algorithm) wp ( mother , s ) ∑ s ′ ∈ states ( w ( s, s ′ ) + wp ( d, s ′ )) min = d ∈ daughters 4 3 5 1 1 4 3 2 2 0 2 4 4 4 0 B C A A C B 0 ∞ ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 ∞ ∞ ∞ 0 0 0 Gerhard Jäger Maximum Parsimony ESSLLI 2016 10 / 30

  26. Parsimony Searching for the best tree total parsimony score of tree: sum over all characters note: if weight matrix is symmetric, location of the root doesn’t matter Sankoff algorithm efficiently computes parsimony score of a given tree goal: tree which minimizes parsimony score no efficient way to find the optimal tree → heuristic tree search Gerhard Jäger Maximum Parsimony ESSLLI 2016 11 / 30

  27. Searching the tree space . Searching the tree space . Gerhard Jäger Maximum Parsimony ESSLLI 2016 12 / 30

  28. Searching the tree space How many rooted tree topologies are there? n=2 1 2 Gerhard Jäger Maximum Parsimony ESSLLI 2016 13 / 30

  29. Searching the tree space How many rooted tree topologies are there? n=2 1 2 n=3 1 3 2 1 2 3 1 1 2 3 2 3 Gerhard Jäger Maximum Parsimony ESSLLI 2016 13 / 30

  30. Searching the tree space How many rooted tree topologies are there? n=2 1 2 n=3 1 3 2 1 2 3 1 1 2 3 2 3 n=4 1 4 3 2 1 3 4 2 1 3 4 2 1 3 4 2 1 3 2 4 Gerhard Jäger Maximum Parsimony ESSLLI 2016 13 / 30

  31. Searching the tree space How many rooted tree topologies are there? 2 1 3 3 4 15 5 105 6 945 7 10395 8 135135 9 2027025 10 34459425 11 654729075 12 13749310575 13 316234143225 14 7 . 9 e + 12 15 2 . 1 e + 14 16 6 . 1 e + 15 17 1 . 9 e + 17 f (2) = 1 18 6 . 3 e + 18 19 2 . 2 e + 20 20 8 . 2 e + 21 f ( n + 1) = (2 n − 3) f ( n ) 21 3 . 1 e + 23 22 1 . 3 e + 25 23 5 . 6 e + 26 (2 n − 3)! 24 2 . 5 e + 28 f ( n ) = 25 1 . 1 e + 30 26 5 . 8 e + 31 2 n − 2 ( n − 2)! 27 2 . 9 e + 33 28 1 . 5 e + 35 29 8 . 6 e + 36 30 4 . 9 e + 38 31 2 . 9 e + 40 32 1 . 7 e + 42 33 1 . 1 e + 44 34 7 . 2 e + 45 35 4 . 8 e + 47 36 3 . 3 e + 49 37 2 . 3 e + 51 38 1 . 7 e + 53 39 1 . 3 e + 55 40 1 . 0 e + 57 Gerhard Jäger Maximum Parsimony ESSLLI 2016 14 / 30

  32. Searching the tree space How many unrooted tree topologies are there? n=3 3 2 1 Gerhard Jäger Maximum Parsimony ESSLLI 2016 15 / 30

  33. Searching the tree space How many unrooted tree topologies are there? n=3 n=4 3 4 2 1 3 2 4 2 3 1 1 2 3 4 1 Gerhard Jäger Maximum Parsimony ESSLLI 2016 15 / 30

  34. Searching the tree space How many unrooted tree topologies are there? n=5 n=3 n=4 3 4 2 5 2 3 5 4 5 4 3 4 3 2 2 3 5 4 2 5 2 3 4 1 1 1 1 1 1 3 2 4 3 2 4 2 5 2 4 4 5 2 2 3 3 5 3 5 2 3 4 3 4 5 1 1 1 1 1 1 1 2 4 5 3 5 3 4 2 5 2 2 4 3 2 4 2 4 3 5 3 4 5 3 1 1 1 1 1 1 Gerhard Jäger Maximum Parsimony ESSLLI 2016 15 / 30

Recommend

Phylogenetic trees III Maximum Parsimony Gerhard Jger Words, Bones, Genes, Tools February 28,

Phylogenetic trees III Maximum Parsimony Gerhard Jger Words, Bones, Genes, Tools February 28,

Phylogenetic trees III Maximum Parsimony Gerhard Jger Words, Bones, Genes, Tools February 28, 2018 Gerhard Jger Maximum Parsimony WBGT 1 / 30 Background Background Gerhard Jger Maximum Parsimony WBGT 2 / 30 Background estimates

1.07k views • 54 slides
Inferring the Past: Phylogenetic Trees (chapter 12) The biological problem l Parsimony and

Inferring the Past: Phylogenetic Trees (chapter 12) The biological problem l Parsimony and

Inferring the Past: Phylogenetic Trees (chapter 12) The biological problem l Parsimony and distance methods l Models for mutations and estimation of distances l Maximum likelihood methods l Introduction to bioinformatics, Autumn 2007 143

288 views • 15 slides
CSCE 471/871 Lecture 5: Building Phylogenetic Trees Building trees from pairwise distances

CSCE 471/871 Lecture 5: Building Phylogenetic Trees Building trees from pairwise distances

Outline Phylogenetic trees CSCE 471/871 Lecture 5: Building Phylogenetic Trees Building trees from pairwise distances Parsimony Stephen D. Scott Simultaneous sequence alignment and phylogeny 1 2 Phylogenetic Trees

273 views • 5 slides
CSE 527 Lecture 10 Parsimony and Phylogenetic Footprinting Phylogenies (aka Evolutionary

CSE 527 Lecture 10 Parsimony and Phylogenetic Footprinting Phylogenies (aka Evolutionary

CSE 527 Lecture 10 Parsimony and Phylogenetic Footprinting Phylogenies (aka Evolutionary Trees) Nothing in biology makes sense, except in the light of evolution -- Dobzhansky A Complex Question: Given data (sequences, anatomy,

593 views • 17 slides
CSCE 471/871 Lecture 5: Phylogenetic Trees Building Phylogenetic Trees Stephen Scott

CSCE 471/871 Lecture 5: Phylogenetic Trees Building Phylogenetic Trees Stephen Scott

CSCE 471/871 Lecture 5: Building CSCE 471/871 Lecture 5: Phylogenetic Trees Building Phylogenetic Trees Stephen Scott Phylogenetic Trees Building Trees Stephen Scott Parsimony Heins Algorithm sscott@cse.unl.edu 1 / 26 Outline

281 views • 26 slides
Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational

Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational

Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein A quick review The parsimony principle: Find the tree that requires the fewest evolutionary changes! A

268 views • 8 slides
Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational

Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational

Phylogenetic trees Branch confidence Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein A quick review The parsimony principle: Find the tree that requires the fewest evolutionary changes! A

247 views • 9 slides
Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees

Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees

Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees Motivation Rooted and unrooted trees Rooted trees: Hierarchical clustering Drawing trees Unrooted trees: Neighbour joining Origin of

678 views • 34 slides
Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees

Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees

Phylogenetic tree Michael Schroeder Biotechnology Center TU Dresden Phylogenetic trees Motivation Rooted and unrooted trees Rooted trees: Hierarchical clustering Drawing trees Unrooted trees: Neighbour joining Distance

810 views • 31 slides
Phylogenetic trees IV Maximum Likelihood Gerhard Jger ESSLLI 2016 Gerhard Jger Maximum

Phylogenetic trees IV Maximum Likelihood Gerhard Jger ESSLLI 2016 Gerhard Jger Maximum

Phylogenetic trees IV Maximum Likelihood Gerhard Jger ESSLLI 2016 Gerhard Jger Maximum Likelihood ESSLLI 2016 1 / 50 Theory Theory Gerhard Jger Maximum Likelihood ESSLLI 2016 2 / 50 Theory Recap: Continuous time Markov model

835 views • 55 slides
Balance indices for phylogenetic trees under well-known probability models Universitat de les

Balance indices for phylogenetic trees under well-known probability models Universitat de les

Balance indices for phylogenetic trees under well-known probability models Universitat de les Illes Balears Toms M. Coronado 1 What is a phylogenetic tree? Balance 2 Probabilistic models for phylogenetic trees The Yule model The Uniform

1.53k views • 125 slides
Phylogenetic Trees in ACL2 Warren A. Hunt Jr. and Serita M. Nelesen The University of Texas at

Phylogenetic Trees in ACL2 Warren A. Hunt Jr. and Serita M. Nelesen The University of Texas at

Phylogenetic Trees in ACL2 Warren A. Hunt Jr. and Serita M. Nelesen The University of Texas at Austin Phylogenetic Trees in ACL2 p.1/14 Phylogenetic Trees Representation of the evolutionary relationship between species Very Long Ago

373 views • 20 slides
Phylogenetic trees IV Maximum Likelihood Gerhard Jger Words, Bones, Genes, Tools February 28,

Phylogenetic trees IV Maximum Likelihood Gerhard Jger Words, Bones, Genes, Tools February 28,

Phylogenetic trees IV Maximum Likelihood Gerhard Jger Words, Bones, Genes, Tools February 28, 2018 Gerhard Jger Maximum Likelihood WBGT 1 / 20 Theory Theory Gerhard Jger Maximum Likelihood WBGT 2 / 20 Theory Recap: Continuous

506 views • 21 slides
One Minute Responses Nucleotide vs. amino acid sequences Parsimony Genome 559: Introduction

One Minute Responses Nucleotide vs. amino acid sequences Parsimony Genome 559: Introduction

One Minute Responses Nucleotide vs. amino acid sequences Parsimony Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein A quick review Trees: Represent sequence relationships A phylogenetic tree

524 views • 27 slides
Outline Review of trees. Coun4ng features. Characterbased phylogeny Maximum

Outline Review of trees. Coun4ng features. Characterbased phylogeny Maximum

1/27/09 CSCI1950Z Computa4onal Methods for Biology Lecture 2 Ben Raphael January 26, 2009 hHp://cs.brown.edu/courses/csci1950z/ Outline Review of trees. Coun4ng features. Characterbased phylogeny Maximum parsimony

472 views • 30 slides
Maximum Likelihood properties Maximum parsimony Maximum likelihood Experimental design

Maximum Likelihood properties Maximum parsimony Maximum likelihood Experimental design

N. Salamin c Sept 2007 Lecture outline Maximum likelihood in phylogenetics Definition Phylogenetics and bioinformatics for evolution Maximum likelihood and models Likelihood of a tree Computational complexity Statistical Maximum

697 views • 30 slides
Navigating Phylogenetic Trees using Graphing Algorithms Giorlando Ramirez So...Whats the

Navigating Phylogenetic Trees using Graphing Algorithms Giorlando Ramirez So...Whats the

Navigating Phylogenetic Trees using Graphing Algorithms Giorlando Ramirez So...Whats the problem? -Phylogenetic trees can be huge, and calculating the distance in between species that are far away from each other in the tree can be

191 views • 7 slides
Small Phylogenetic Trees M. Casanellas, M. Contois, L. D. Garcia, S. Hosten, Y. Kim, D. Levy, S.

Small Phylogenetic Trees M. Casanellas, M. Contois, L. D. Garcia, S. Hosten, Y. Kim, D. Levy, S.

Small Phylogenetic Trees M. Casanellas, M. Contois, L. D. Garcia, S. Hosten, Y. Kim, D. Levy, S. Snir lgpuente@msri.org MSRI Algebraic Statistics for Computational Biology p.1 Objects Phylogenetic Trees with three, four, and five leaves.

595 views • 12 slides
Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick

Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick

Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick review Gene expression profiling Which molecular processes/functions are involved in a certain phenotype (e.g., disease, stress response,

565 views • 25 slides
Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick

Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick

Phylogenetic Trees Distance trees Genome 373 Genomic Informatics Elhanan Borenstein A quick review Significance of similarity scores (P-values) Empirical null score distribution Extreme value distribution Multiple-testing

522 views • 28 slides
Phylogenetic trees I Foundations, Distance-based inference Gerhard Jger Words, Bones, Genes,

Phylogenetic trees I Foundations, Distance-based inference Gerhard Jger Words, Bones, Genes,

Phylogenetic trees I Foundations, Distance-based inference Gerhard Jger Words, Bones, Genes, Tools February 28, 2018 Gerhard Jger Phylogenetic trees I WBGT 1 / 27 Background Background readings for this lecture Ewens and Grant (2005),

835 views • 59 slides
Gene Tree Parsimony for Incomplete Gene Trees Md. Shamsuzzoha Bayzid and Tandy Warnow

Gene Tree Parsimony for Incomplete Gene Trees Md. Shamsuzzoha Bayzid and Tandy Warnow

Gene Tree Parsimony for Incomplete Gene Trees Md. Shamsuzzoha Bayzid and Tandy Warnow Bangladesh University of Engineering and Technology Outline Background Gene trees and species trees Species tree estimation techniques GTP

951 views • 64 slides
Phylogenetic Methods Multiple Sequence Alignment Pairwise distance matrix Clustering algorithms:

Phylogenetic Methods Multiple Sequence Alignment Pairwise distance matrix Clustering algorithms:

Phylogenetic Methods Multiple Sequence Alignment Pairwise distance matrix Clustering algorithms: NJ, UPGMA - guide trees Phylogenetic trees 1 Nucleotide vs. amino acid sequences for phylogenies 1) Nucleotides: - Synonymous vs. nonsynonymous

455 views • 17 slides
Spaces of phylogenetic networks Jonathan Klawitter PhD Exam 5th March, 2020 2 - 1

Spaces of phylogenetic networks Jonathan Klawitter PhD Exam 5th March, 2020 2 - 1

1 Spaces of phylogenetic networks Jonathan Klawitter PhD Exam 5th March, 2020 2 - 1 Phylogenetic trees & networks 2 - 2 Phylogenetic trees & networks 2 - 3 Phylogenetic trees & networks T 1 2 3 4 5 6 2 - 4

604 views • 48 slides

More recommend