Tree-Building. Methods in Tree Building Phylogenetic trees can be constructed by: clustering method optimality method.

Slides:



Advertisements
Similar presentations
Introduction to Molecular Evolution
Advertisements

Parsimony Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.
Parsimony Small Parsimony and Search Algorithms Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.
DECISION TREES. Decision trees  One possible representation for hypotheses.
An Introduction to Phylogenetic Methods
Based on lectures by C-B Stewart, and by Tal Pupko Phylogenetic Analysis based on two talks, by Caro-Beth Stewart, Ph.D. Department of Biological Sciences.
Phylogenetic Analysis
IE68 - Biological databases Phylogenetic analysis
Molecular Evolution Revised 29/12/06
Tree Reconstruction.
Lecture 7 – Algorithmic Approaches Justification: Any estimate of a phylogenetic tree has a large variance. Therefore, any tree that we can demonstrate.
UPGMA and FM are distance based methods. UPGMA enforces the Molecular Clock Assumption. FM (Fitch-Margoliash) relieves that restriction, but still enforces.
Heuristic alignment algorithms and cost matrices
In addition to maximum parsimony (MP) and likelihood methods, pairwise distance methods form the third large group of methods to infer evolutionary trees.
Phylogenetic reconstruction
Maximum Parsimony.
NJ was originally described as a method for approximating a tree that minimizes the sum of least- squares branch lengths – the minimum – evolution criterion.
Lecture 24 Inferring molecular phylogeny Distance methods
Probabilistic methods for phylogenetic trees (Part 2)
Building Phylogenies Parsimony 2.
Phylogenetic Tree Construction and Related Problems Bioinformatics.
MAE 552 – Heuristic Optimization Lecture 25 March 22, 2002 Topic: Tabu Search.
What Is Phylogeny? The evolutionary history of a group.
Characterizing the Phylogenetic Tree-Search Problem Daniel Money And Simon Whelan ~Anusha Sura.
Phylogenetic analyses Kirsi Kostamo. The aim: To construct a visual representation (a tree) to describe the assumed evolution occurring between and among.
Phylogeny Estimation: Traditional and Bayesian Approaches Molecular Evolution, 2003
Terminology of phylogenetic trees
Molecular phylogenetics
Parsimony and searching tree-space Phylogenetics Workhop, August 2006 Barbara Holland.
Phylogenetics Alexei Drummond. CS Friday quiz: How many rooted binary trees having 20 labeled terminal nodes are there? (A) (B)
1 Dan Graur Molecular Phylogenetics Molecular phylogenetic approaches: 1. distance-matrix (based on distance measures) 2. character-state.
Models of sequence evolution GTR HKY Jukes-Cantor Felsenstein K2P Tree building methods: some examples Assessing phylogenetic data Popular phylogenetic.
Phylogenetic Analysis. General comments on phylogenetics Phylogenetics is the branch of biology that deals with evolutionary relatedness Uses some measure.
Molecular phylogenetics 1 Level 3 Molecular Evolution and Bioinformatics Jim Provan Page and Holmes: Sections
Bioinformatics 2011 Molecular Evolution Revised 29/12/06.
Parsimony-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2010.
Ben Stöver WS 2013/2014 Maximum parsimony with MEGA and PAUP* Molecular Phylogenetics – exercise.
Molecular phylogenetics 4 Level 3 Molecular Evolution and Bioinformatics Jim Provan Page and Holmes: Sections
MOLECULAR PHYLOGENETICS Four main families of molecular phylogenetic methods :  Parsimony  Distance methods  Maximum likelihood methods  Bayesian methods.
Calculating branch lengths from distances. ABC A B C----- a b c.
Bioinformatics Multiple Alignment. Overview Introduction Multiple Alignments Global multiple alignment –Introduction –Scoring –Algorithms.
Using traveling salesman problem algorithms for evolutionary tree construction Chantal Korostensky and Gaston H. Gonnet Presentation by: Ben Snider.
Cladogram construction Thanks to Leandro Gaetano.
Phylogeny and Genome Biology Andrew Jackson Wellcome Trust Sanger Institute Changes: Type program name to start Always Cd to phyml directory before starting.
Fabio Pardi PhD student in Goldman Group European Bioinformatics Institute and University of Cambridge, UK Joint work with: Barbara Holland, Mike Hendy,
Parsimony-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2015.
Maximum Likelihood Given competing explanations for a particular observation, which explanation should we choose? Maximum likelihood methodologies suggest.
SAN DIEGO SUPERCOMPUTER CENTER at the UNIVERSITY OF CALIFORNIA, SAN DIEGO Hybrid MPI/Pthreads Parallelization of the RAxML Phylogenetics Code Wayne Pfeiffer.
Doug Raiford Lesson 9.  3 Approaches  Distance  Parsimony  Maximum Likelihood  Have already seen a distance method 12/18/20152Phylogenetics Part.
Phylogenetic Trees - Parsimony Tutorial #13
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
CS 395T: Computational phylogenetics January 18, 2006 Tandy Warnow.
Maximum Parsimony Phenetic (distance based) methods are fast and often accurate but discard data and are not based on explicit character states at each.
What is phylogenetic analysis and why should we perform it? Phylogenetic analysis has two major components: (1) Phylogeny inference or “tree building”
394C: Algorithms for Computational Biology Tandy Warnow Jan 25, 2012.
Phylogenetic basis of systematics
Inferring a phylogeny is an estimation procedure.
Phylogenetic Inference
Clustering methods Tree building methods for distance-based trees
Multiple Alignment and Phylogenetic Trees
Goals of Phylogenetic Analysis
Systematics: Tree of Life
BNFO 602 Phylogenetics Usman Roshan.
Maximum parsimony with MEGA and PAUP
CS 581 Tandy Warnow.
Systematics: Tree of Life
Lecture 7 – Algorithmic Approaches
Phylogeny.
What is this course about?
Stochastic Methods.
Presentation transcript:

Tree-Building

Methods in Tree Building Phylogenetic trees can be constructed by: clustering method optimality method

Clustering Method -follows a set of steps (an algorithm) and arrives at a tree. -easy to implement and resulting in very fast computer programmes. -always produces a single tree.

Clustering Method

limitations: -the result obtained from simple clustering algorithms often depends on the order in which the taxa added in a growing tree. -do not allow us to evaluate competing hypotheses (they merely produce a tree).

Optimality Method -Chooses among the set of all possible trees. -each tree is assigned a ‘score’ or rank which is function of the relationship between tree and data.

Optimality Method

Advantages: -requires an explicit function that relates data and tree. -allows to evaluate the quality of any tree. Disadvantages: -time consuming (infeasible for a tree with more than 20 taxa). Overcome by heuristic approach.

Heuristic Approach -to explore some subset of all the possible trees, in the hope that the subset will contain the optimal tree. -to start with a tree and rearrange it, keeping any rearrangement that produces a better tree – ‘hill-climbing’. -if a set of possible trees contains more than one island, the heuristic search may land on a suboptimal island, and the optimal island goes undiscovered.

Heuristic Approach Island A Island B

Comparing Tree-Building Methods Type of data UPGMANeighbour-Joining Maximum Parsimony Maximum Likelihood Minimum evolution Distance Nucleotide sites Tree building Optimality criterion Clustering algorithm