of the Balanced Minimum Evolution Polytope Ruriko Yoshida
|
|
- Darcy Nash
- 6 years ago
- Views:
Transcription
1 Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope Ruriko Yoshida
2 Figure 19.1 Genomes 3 ( Garland Science 2007) Origins of Species
3 Tree (or web) of life eukarya History of life is written in the genes. bacteria archaea Mount DW (2001) Bioinformatics: sequence and genome analysis. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, New York
4 Goals of molecular phylogenetics Read the evolutionary history of organisms genes Stechmann A, Cavalier ST (2002) Rooting the eukaryote tree by using a derived gene fusion. Science 297: 89-91
5 Gene tree on a Species tree Maddison WP (1997) Gene trees in species trees. ( ) p Systematic Biology 46:
6 Phylogenetic tree reconstruction The maximum likelihood estimation (MLE) methods: These methods describe evolution in terms of a discrete-state continuous-time Markov process. The Balanced Minimum Evolution (BME) method: This is a distance based method and Weighted Least Square method. The Neighbor-Joining (NJ) method is a greedy algorithm of the BME method (Steel and Gasquel, 2006). Bayesian inference for trees: Use Bayes Theorem and MCMC to estimate the posterior distribution rather than obtaining the point estimation.
7 Distance Matrix A distance matrix for a tree T is a matrix D whose entry D ij stands A distance matrix for a tree T is a matrix D whose entry D ij stands for the mutation distance between i and j.
8 Distance matrix
9 Balanced Minimum Evolution BME is a weighted least squares distance based method which puts more emphasis on the shorter distances. Given a distance matrix D, the BME method can assign edge lengths to any binary tree topology T with n leaves BME = Goal of BME, given fixed D, is to find the binary tree T with the smallest sum of total branch lengths D (T) (assigned by BME). min D (T) for all (2n-5)!! tree topologies.
10 Balanced Minimum Evolution The BME is also a distance based method. A weighted LS method to find the closest tree metric such that the total branch lengths of the tree is the smallest. Based on Pauplin s formula, D (τ), which estimates the total length of a tree, based on: [Pauplin 2000 J Mol Evol 51] (1) its topology τ, (2) an estimated distance matrix D = (D ij ). The BME method is to find the tree topologyτ such that min D (τ t ) for τ t, t=1 1,,(2n 5)!! 5)!!.
11 Pauplin s formula Pauplin s formula is defined as: where D (τ) = Σ i<j W ij (τ)d ij, j j j W ij (τ) = (2)(1 # of branches between i and j) for a particular tree topology τ.
12 Example For the tree topology above, we have W (τ ) = (1/2, 1/4, 1/4, 1/8, 1/8, 1/4, 1/8, 1/8, 1/4, 1/2).
13 Pauplin s formula Note that Pauplin s formula can be seen as a linear programming problem such that min D x such that x P ME n where P ME n = conv{wτ 1,,, Wτ (2n-5)!! }. We call P ME n a BME polytope (Eickmeyer, Huggins, Pachter, and Y., 2008). Thus, the set of all D such that the topology τ t is minimal is the normal cone at a vertex Wτ t. We call this BME cone for a topology τ t.
14 Combinatorics of the BME polytopes For up to n = 7 taxa, we computed BME polytopes and studied their structure. n dimension of BME polytope F-vector 4 2 (3, 3) 5 5 (15, 105, 250, 210, 52) 6 9 (105, 5460,?,?,?, 90262) 7 14 (945, ,?,?,?,?,?) For n = 5,6, the number of edges is n choose 2, so all pairs of bifurcating tree topologies τ 1, τ 2 on n 6 taxa can be cooptimal for BME, which we found surprising. But for n = 7, there is one combinatorial type of non-edge.
15 Combinatorial type of non-edge with n = 7.
16 Edges and non-edges of the BME polytope p We still do not understand which pairs of trees will form edges on the BME polytope. If we did understand the edges, then we might be able to devise a competitive alternative to FastME that improves trees by walking along edges on the BME polytope, rather than performing tree moves. Edge walking is called the simplex algorithm in linear Edge-walking is called the simplex algorithm in linear programming, and it works very well in practice.
17 SPR move adjacency Theorem [Haws, Hodge, and Y. (2011)] If a pair of bifurcating tree topologies τ 1, τ 2 on n taxa are adjacent by a subtree prune regraft (SPR) move then W τ1 and W τ2 are on an edge of the BME polytope p P ME n. n This means that a pair of bifurcating tree topologies τ 1, τ 2 on n taxa adjacent by a SPR move implies they are adjacent by an edge on the BME polytope.
18 Subtree Prune Regraft (SPR) moves First, select a subtree of the given tree. Next, we detach the selected subtree. Then we attempt to regraft it onto another branch of the remaining tree, in such a way that a new tree is formed.
19 NNI move adjacency Corollary [Haws, Hodge, and Y. (2011)] If a pair of bifurcating tree topologies τ 1, τ 2 on n taxa are adjacent by a Nearest Neighbor Interchange (NNI) move then W τ1 and W τ2 are on an edge of the BME polytope P ME n. Thus we know that the software FASTME attempts to find an optimal solution via edge moves over BME polytope.
20 Balanced minimum evolution cones For each bifurcating tree topology τ, the BME cone of τ is the set of all choices of pairwise distances D = (D ij ) for which τ minimizes the dot-product D Wτ. The edges of the BME polytope emanating from the vertex Wτ determine the facets (flat sides) of the BME cone of τ. The facets of the BME polytope that contain Wτ determine the extreme rays of the BME cone of τ. (This is a perfect example of duality.) BME cones are convex. Thus the BME method is convex: If the BME method outputs tree topology τ for two inputs D, D, then BME will also output τ on the input (D + D )/2.
21 Comparing NJ and BME cones Neighbor-joining ihb jii (NJ) method: hdthis is the most popular distance based method. hd It computes a tree from all pair-wise distances obtained which are easily obtained. (Saito and Nei (1987), Studier and Keppler (1988)) by picking cherries. Fact: The NJ algorithm is a greedy algorithm to find the BME tree (Gascuel and Steel (2006)). From this point of view, NJ is optimal whenever the NJ algorithm outputs the tree which minimizes the BME criterion. Question: Given a tree T with any particular order of picking its pairs of leaves, is there a dissimilarity map such that the NJ Algorithm returns the BME tree T?
22 Neighbor joining: Fast and consistent Neighbor joining is a popular algorithm for phylogenetic reconstruction. Input is pairwise distances D = (D ij ), presumed to arise as a perturbed tree metric. Output is a tree topology which induces a tree metric that is hopefully close to D. Intuition: Find two nodes which are close, and join them as siblings (a cherry ) in the tree. Quantitatively neighbor joining joins nodes a, b which have minimal Q-value: Q ab =D ab (Σ k D ak + Σ k D bk ) / (n 2)
23 Neighbor joining: Fast and consistent Nodes a, b are then replaced by a single new node z which is the root of the cherry (a, b), and distances D zk are defined as D zk = D ak + D bk 2D ab. Then neighbor joining is applied recursively on the remaining nodes, until a tree is obtained. Using Q matrix instead of the original distance matrix compensates for short internal edges. In fact neighbor joining based on Q is consistent: Given a tree metric D = D T as input, NJ will correctly output tree T.
24 Neighbor joining cones Notice that all elements in Q are linear in the distances, so picking a cherry (a, b) in the tree means that the distances satisfy linear inequalities. Also, after picking cherry (a, b) and replacing it with a new node z, the new distances D zk are linear in the old distances: D zk = D ak + D bk 2D ab. Thus NJ will output a particular tree topology T, and pick cherries in a particular order, iff the original distances D ij satisfy certain linear inequalities. The inequalitiesdefine a cone (apex 0) in R n(n-1)/2, which we call a NJ cone. S NJ ill t t ti l t t l T iff th i i So NJ will output a particular tree topology T iff the pairwise distances D R n(n-1)/2 lie in a union of NJ cones.
25 Issues with neighbor joining Neighbor joining is fast and consistent, but it isn t based on an evolutionary model. Until recently, it hasn t been very clear what NJ is optimizing if anything at all. (NJ is a greedy algorithm of the BME, Gascuel and Steel) Neighbor joining outputs a tree topology T iff the data lies in a union of cones. Unions of cones need not be convex. In fact neighbor joining is not convex: There are distance matrices D, D, such that NJ produces the same tree T 1 when run on input D or D, but NJ produces a different tree T 2 not equal to T 1 when run on the input (D + D )/2
26 NJ and BME cones Theorem [Haws, Hodge, and Y. (2011)] Given a tree T with any number of taxa and any particular order σ of picking its pairs of leaves, the BME cone and every NJ cone associated to a tree $T$ and for any order σ have an intersection of positive measure. This result is particularly important in phylogenetics since this shows that even though the NJ Algorithm is a greedy algorithm, with any order to pick leaf pairs, the NJ Algorithm will return the BME tree for some dissimilarity map.
27 Faces of BME Polytope A clade of a binary tree T is the subtree given by an internal node and all its decendents. Blue and red boxes are clades, while green is not a clade.
28 Clade-Faces of the BME Polytope Theorem [Haws, Hodge, and Y. (2011)] Every disjoint collection of clades C 1,C 2,,C k gives a face of the BME polytope, F(C 1,C 2,,C k ) = { T C 1,C 2,,C k T } We can now describe a large class of faces of the BME polytope. Note: Clade-face is a smaller dimensional BME polytope.
29 Future work Want to show if two trees are adjacent with a Tree Bisection and Reconnection (TBR) move, then they can be cooptimal in terms of Pauplin s formula for BME. Is there a combinatorial criterion (or at least sufficient conditions) for when two tree topologies form an edge on the BME polytope? Can this be used as a better way to move through tree space? (Bordewich et al, 2009) showed that the hill climbing algorithm with SPR moves, one can achieve the BME optimal solution with any input dissimilarity map. This shows that BME method is consistent with SPR moves (since TBR moves are generalization of SPR, this implies BME method is consistent with TBR moves). We would like to show if BME method is consistent with NNI moves.
30 Acknowledgments D. Haws, T. Hodge and R. Yoshida. "Optimality of the Neighbor Joining i Algorithm and Faces of the Balanced Minimum Evolution Polytope 2011, Bulletin of Mathematical Biology. Published on-line DOI: /s x Available at UK Phylogenomics group: NIGMS NSF
31 UK Phylogenomic Group Collaborators: - Jerzy W. Jaromczyk (UK) - Chris Schardl (UK) - David Haws (UK) - David Weisrock (UK) - Eric O Niell (UK) - Peter Huggins (UK) - Arny Stromberg (UK) - Pat Calie (EKU) - Stephen Richter (EKU) - Jinze Liu (UK) - etc NIGMS NSF
32 Are you done yet? Thank you Thank you for your attention!
On the Optimality of the Neighbor Joining Algorithm
On the Optimality of the Neighbor Joining Algorithm Ruriko Yoshida Dept. of Statistics University of Kentucky Joint work with K. Eickmeyer, P. Huggins, and L. Pachter www.ms.uky.edu/ ruriko Louisville
More informationDistance-based Phylogenetic Methods Near a Polytomy
Distance-based Phylogenetic Methods Near a Polytomy Ruth Davidson and Seth Sullivant NCSU UIUC May 21, 2014 2 Phylogenetic trees model the common evolutionary history of a group of species Leaves = extant
More informationParsimony Least squares Minimum evolution Balanced minimum evolution Maximum likelihood (later in the course)
Tree Searching We ve discussed how we rank trees Parsimony Least squares Minimum evolution alanced minimum evolution Maximum likelihood (later in the course) So we have ways of deciding what a good tree
More informationMolecular Evolution & Phylogenetics Complexity of the search space, distance matrix methods, maximum parsimony
Molecular Evolution & Phylogenetics Complexity of the search space, distance matrix methods, maximum parsimony Basic Bioinformatics Workshop, ILRI Addis Ababa, 12 December 2017 Learning Objectives understand
More informationDistance based tree reconstruction. Hierarchical clustering (UPGMA) Neighbor-Joining (NJ)
Distance based tree reconstruction Hierarchical clustering (UPGMA) Neighbor-Joining (NJ) All organisms have evolved from a common ancestor. Infer the evolutionary tree (tree topology and edge lengths)
More informationCSE 549: Computational Biology
CSE 549: Computational Biology Phylogenomics 1 slides marked with * by Carl Kingsford Tree of Life 2 * H5N1 Influenza Strains Salzberg, Kingsford, et al., 2007 3 * H5N1 Influenza Strains The 2007 outbreak
More informationDIMACS Tutorial on Phylogenetic Trees and Rapidly Evolving Pathogens. Katherine St. John City University of New York 1
DIMACS Tutorial on Phylogenetic Trees and Rapidly Evolving Pathogens Katherine St. John City University of New York 1 Thanks to the DIMACS Staff Linda Casals Walter Morris Nicole Clark Katherine St. John
More informationEVOLUTIONARY DISTANCES INFERRING PHYLOGENIES
EVOLUTIONARY DISTANCES INFERRING PHYLOGENIES Luca Bortolussi 1 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste luca@dmi.units.it Trieste, 28 th November 2007 OUTLINE 1 INFERRING
More informationIntroduction to Trees
Introduction to Trees Tandy Warnow December 28, 2016 Introduction to Trees Tandy Warnow Clades of a rooted tree Every node v in a leaf-labelled rooted tree defines a subset of the leafset that is below
More informationOlivier Gascuel Arbres formels et Arbre de la Vie Conférence ENS Cachan, septembre Arbres formels et Arbre de la Vie.
Arbres formels et Arbre de la Vie Olivier Gascuel Centre National de la Recherche Scientifique LIRMM, Montpellier, France www.lirmm.fr/gascuel 10 permanent researchers 2 technical staff 3 postdocs, 10
More informationML phylogenetic inference and GARLI. Derrick Zwickl. University of Arizona (and University of Kansas) Workshop on Molecular Evolution 2015
ML phylogenetic inference and GARLI Derrick Zwickl University of Arizona (and University of Kansas) Workshop on Molecular Evolution 2015 Outline Heuristics and tree searches ML phylogeny inference and
More informationScaling species tree estimation methods to large datasets using NJMerge
Scaling species tree estimation methods to large datasets using NJMerge Erin Molloy and Tandy Warnow {emolloy2, warnow}@illinois.edu University of Illinois at Urbana Champaign 2018 Phylogenomics Software
More informationPhylogenetics on CUDA (Parallel) Architectures Bradly Alicea
Descent w/modification Descent w/modification Descent w/modification Descent w/modification CPU Descent w/modification Descent w/modification Phylogenetics on CUDA (Parallel) Architectures Bradly Alicea
More informationCodon models. In reality we use codon model Amino acid substitution rates meet nucleotide models Codon(nucleotide triplet)
Phylogeny Codon models Last lecture: poor man s way of calculating dn/ds (Ka/Ks) Tabulate synonymous/non- synonymous substitutions Normalize by the possibilities Transform to genetic distance K JC or K
More informationLecture: Bioinformatics
Lecture: Bioinformatics ENS Sacley, 2018 Some slides graciously provided by Daniel Huson & Celine Scornavacca Phylogenetic Trees - Motivation 2 / 31 2 / 31 Phylogenetic Trees - Motivation Motivation -
More informationCS 581. Tandy Warnow
CS 581 Tandy Warnow This week Maximum parsimony: solving it on small datasets Maximum Likelihood optimization problem Felsenstein s pruning algorithm Bayesian MCMC methods Research opportunities Maximum
More informationEvolution of Tandemly Repeated Sequences
University of Canterbury Department of Mathematics and Statistics Evolution of Tandemly Repeated Sequences A thesis submitted in partial fulfilment of the requirements of the Degree for Master of Science
More informationThe SNPR neighbourhood of tree-child networks
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 22, no. 2, pp. 29 55 (2018) DOI: 10.7155/jgaa.00472 The SNPR neighbourhood of tree-child networks Jonathan Klawitter Department of Computer
More informationSeeing the wood for the trees: Analysing multiple alternative phylogenies
Seeing the wood for the trees: Analysing multiple alternative phylogenies Tom M. W. Nye, Newcastle University tom.nye@ncl.ac.uk Isaac Newton Institute, 17 December 2007 Multiple alternative phylogenies
More informationEvolutionary tree reconstruction (Chapter 10)
Evolutionary tree reconstruction (Chapter 10) Early Evolutionary Studies Anatomical features were the dominant criteria used to derive evolutionary relationships between species since Darwin till early
More informationA Statistical Test for Clades in Phylogenies
A STATISTICAL TEST FOR CLADES A Statistical Test for Clades in Phylogenies Thurston H. Y. Dang 1, and Elchanan Mossel 2 1 Department of Electrical Engineering and Computer Sciences, University of California,
More informationSequence clustering. Introduction. Clustering basics. Hierarchical clustering
Sequence clustering Introduction Data clustering is one of the key tools used in various incarnations of data-mining - trying to make sense of large datasets. It is, thus, natural to ask whether clustering
More informationStat 547 Assignment 3
Stat 547 Assignment 3 Release Date: Saturday April 16, 2011 Due Date: Wednesday, April 27, 2011 at 4:30 PST Note that the deadline for this assignment is one day before the final project deadline, and
More informationPrior Distributions on Phylogenetic Trees
Prior Distributions on Phylogenetic Trees Magnus Johansson Masteruppsats i matematisk statistik Master Thesis in Mathematical Statistics Masteruppsats 2011:4 Matematisk statistik Juni 2011 www.math.su.se
More informationEfficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees Downloaded 01/19/18 to 140.107.151.5. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
More informationGenetics/MBT 541 Spring, 2002 Lecture 1 Joe Felsenstein Department of Genome Sciences Phylogeny methods, part 1 (Parsimony and such)
Genetics/MBT 541 Spring, 2002 Lecture 1 Joe Felsenstein Department of Genome Sciences joe@gs Phylogeny methods, part 1 (Parsimony and such) Methods of reconstructing phylogenies (evolutionary trees) Parsimony
More informationDesigning parallel algorithms for constructing large phylogenetic trees on Blue Waters
Designing parallel algorithms for constructing large phylogenetic trees on Blue Waters Erin Molloy University of Illinois at Urbana Champaign General Allocation (PI: Tandy Warnow) Exploratory Allocation
More informationMain Reference. Marc A. Suchard: Stochastic Models for Horizontal Gene Transfer: Taking a Random Walk through Tree Space Genetics 2005
Stochastic Models for Horizontal Gene Transfer Dajiang Liu Department of Statistics Main Reference Marc A. Suchard: Stochastic Models for Horizontal Gene Transfer: Taing a Random Wal through Tree Space
More informationWhat is a phylogenetic tree? Algorithms for Computational Biology. Phylogenetics Summary. Di erent types of phylogenetic trees
What is a phylogenetic tree? Algorithms for Computational Biology Zsuzsanna Lipták speciation events Masters in Molecular and Medical Biotechnology a.a. 25/6, fall term Phylogenetics Summary wolf cat lion
More informationSequence length requirements. Tandy Warnow Department of Computer Science The University of Texas at Austin
Sequence length requirements Tandy Warnow Department of Computer Science The University of Texas at Austin Part 1: Absolute Fast Convergence DNA Sequence Evolution AAGGCCT AAGACTT TGGACTT -3 mil yrs -2
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationConfidence Regions and Averaging for Trees
Confidence Regions and Averaging for Trees 1 Susan Holmes Statistics Department, Stanford and INRA- Biométrie, Montpellier,France susan@stat.stanford.edu http://www-stat.stanford.edu/~susan/ Joint Work
More informationA Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony Jean-Michel Richer 1 and Adrien Goëffon 2 and Jin-Kao Hao 1 1 University of Angers, LERIA, 2 Bd Lavoisier, 49045 Anger Cedex 01,
More informationSPR-BASED TREE RECONCILIATION: NON-BINARY TREES AND MULTIPLE SOLUTIONS
1 SPR-BASED TREE RECONCILIATION: NON-BINARY TREES AND MULTIPLE SOLUTIONS C. THAN and L. NAKHLEH Department of Computer Science Rice University 6100 Main Street, MS 132 Houston, TX 77005, USA Email: {cvthan,nakhleh}@cs.rice.edu
More informationUnderstanding Spaces of Phylogenetic Trees
Understanding Spaces of Phylogenetic Trees Williams College SMALL REU 2012 September 25, 2012 Trees Which Tell an Evolutionary Story The Tree of Life Problem Given data (e.g. nucleotide sequences) on n
More informationToric Ideals of Homogeneous Phylogenetic Models
Toric Ideals of Homogeneous Phylogenetic Models Nicholas Eriksson Department of Mathematics University of California, Berkeley Berkeley, CA 947-384 eriksson@math.berkeley.edu ABSTRACT We consider the model
More informationEvolution Module. 6.1 Phylogenetic Trees. Bob Gardner and Lev Yampolski. Integrated Biology and Discrete Math (IBMS 1300)
Evolution Module 6.1 Phylogenetic Trees Bob Gardner and Lev Yampolski Integrated Biology and Discrete Math (IBMS 1300) Fall 2008 1 INDUCTION Note. The natural numbers N is the familiar set N = {1, 2, 3,...}.
More informationAlgorithms for Bioinformatics
Adapted from slides by Leena Salmena and Veli Mäkinen, which are partly from http: //bix.ucsd.edu/bioalgorithms/slides.php. 582670 Algorithms for Bioinformatics Lecture 6: Distance based clustering and
More informationAnswer Set Programming or Hypercleaning: Where does the Magic Lie in Solving Maximum Quartet Consistency?
Answer Set Programming or Hypercleaning: Where does the Magic Lie in Solving Maximum Quartet Consistency? Fathiyeh Faghih and Daniel G. Brown David R. Cheriton School of Computer Science, University of
More informationOptimal Region for Binary Search Tree, Rotation and Polytope
Optimal Region for Binary Search Tree, Rotation and Polytope Kensuke Onishi Mamoru Hoshi 2 Department of Mathematical Sciences, School of Science Tokai University, 7 Kitakaname, Hiratsuka, Kanagawa, 259-292,
More informationIntroduction to Computational Phylogenetics
Introduction to Computational Phylogenetics Tandy Warnow The University of Texas at Austin No Institute Given This textbook is a draft, and should not be distributed. Much of what is in this textbook appeared
More informationParsimony-Based Approaches to Inferring Phylogenetic Trees
Parsimony-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 www.biostat.wisc.edu/bmi576.html Mark Craven craven@biostat.wisc.edu Fall 0 Phylogenetic tree approaches! three general types! distance:
More informationPhylogenetic networks that display a tree twice
Bulletin of Mathematical Biology manuscript No. (will be inserted by the editor) Phylogenetic networks that display a tree twice Paul Cordue Simone Linz Charles Semple Received: date / Accepted: date Abstract
More informationParallel Implementation of a Quartet-Based Algorithm for Phylogenetic Analysis
Parallel Implementation of a Quartet-Based Algorithm for Phylogenetic Analysis B. B. Zhou 1, D. Chu 1, M. Tarawneh 1, P. Wang 1, C. Wang 1, A. Y. Zomaya 1, and R. P. Brent 2 1 School of Information Technologies
More informationImprovement of Distance-Based Phylogenetic Methods by a Local Maximum Likelihood Approach Using Triplets
Improvement of Distance-Based Phylogenetic Methods by a Local Maximum Likelihood Approach Using Triplets Vincent Ranwez and Olivier Gascuel Département Informatique Fondamentale et Applications, LIRMM,
More informationRecent Research Results. Evolutionary Trees Distance Methods
Recent Research Results Evolutionary Trees Distance Methods Indo-European Languages After Tandy Warnow What is the purpose? Understand evolutionary history (relationship between species). Uderstand how
More informationL-Infinity Optimization in Tropical Geometry and Phylogenetics
L-Infinity Optimization in Tropical Geometry and Phylogenetics Daniel Irving Bernstein* and Colby Long North Carolina State University dibernst@ncsu.edu https://arxiv.org/abs/1606.03702 October 19, 2016
More informationFastJoin, an improved neighbor-joining algorithm
Methodology FastJoin, an improved neighbor-joining algorithm J. Wang, M.-Z. Guo and L.L. Xing School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang, P.R. China
More informationAlignment of Trees and Directed Acyclic Graphs
Alignment of Trees and Directed Acyclic Graphs Gabriel Valiente Algorithms, Bioinformatics, Complexity and Formal Methods Research Group Technical University of Catalonia Computational Biology and Bioinformatics
More informationLecture 12 March 4th
Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 12 March 4th Lecturer: Lior Pachter Scribe/ Editor: Wenjing Zheng/ Shaowei Lin 12.1 Alignment Polytopes Recall that the alignment
More informationarxiv: v3 [cs.ds] 26 Apr 2017
Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees Chris Whidden 1 and Frederick A. Matsen IV 2 arxiv:1606.08893v3 [cs.ds] 26 Apr 2017 1 Program in Computational
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationA New Algorithm for the Reconstruction of Near-Perfect Binary Phylogenetic Trees
A New Algorithm for the Reconstruction of Near-Perfect Binary Phylogenetic Trees Kedar Dhamdhere, Srinath Sridhar, Guy E. Blelloch, Eran Halperin R. Ravi and Russell Schwartz March 17, 2005 CMU-CS-05-119
More informationNotes 4 : Approximating Maximum Parsimony
Notes 4 : Approximating Maximum Parsimony MATH 833 - Fall 2012 Lecturer: Sebastien Roch References: [SS03, Chapters 2, 5], [DPV06, Chapters 5, 9] 1 Coping with NP-completeness Local search heuristics.
More informationGeneration of distancebased phylogenetic trees
primer for practical phylogenetic data gathering. Uconn EEB3899-007. Spring 2015 Session 12 Generation of distancebased phylogenetic trees Rafael Medina (rafael.medina.bry@gmail.com) Yang Liu (yang.liu@uconn.edu)
More informationRotation Distance is Fixed-Parameter Tractable
Rotation Distance is Fixed-Parameter Tractable Sean Cleary Katherine St. John September 25, 2018 arxiv:0903.0197v1 [cs.ds] 2 Mar 2009 Abstract Rotation distance between trees measures the number of simple
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationHeterotachy models in BayesPhylogenies
Heterotachy models in is a general software package for inferring phylogenetic trees using Bayesian Markov Chain Monte Carlo (MCMC) methods. The program allows a range of models of gene sequence evolution,
More informationA Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony Jean-Michel Richer 1,AdrienGoëffon 2, and Jin-Kao Hao 1 1 University of Angers, LERIA, 2 Bd Lavoisier, 49045 Anger Cedex 01, France
More informationSEEING THE TREES AND THEIR BRANCHES IN THE NETWORK IS HARD
1 SEEING THE TREES AND THEIR BRANCHES IN THE NETWORK IS HARD I A KANJ School of Computer Science, Telecommunications, and Information Systems, DePaul University, Chicago, IL 60604-2301, USA E-mail: ikanj@csdepauledu
More information4/4/16 Comp 555 Spring
4/4/16 Comp 555 Spring 2016 1 A clique is a graph where every vertex is connected via an edge to every other vertex A clique graph is a graph where each connected component is a clique The concept of clustering
More information1 Matching in Non-Bipartite Graphs
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: September 30, 2010 Scribe: David Tobin 1 Matching in Non-Bipartite Graphs There are several differences
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationA Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem
A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem Gang Wu Jia-Huai You Guohui Lin January 17, 2005 Abstract A lookahead branch-and-bound algorithm is proposed for solving
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationIntroduction to Triangulated Graphs. Tandy Warnow
Introduction to Triangulated Graphs Tandy Warnow Topics for today Triangulated graphs: theorems and algorithms (Chapters 11.3 and 11.9) Examples of triangulated graphs in phylogeny estimation (Chapters
More informationGeneralized Neighbor-Joining: More Reliable Phylogenetic Tree Reconstruction
Generalized Neighbor-Joining: More Reliable Phylogenetic Tree Reconstruction William R. Pearson, Gabriel Robins,* and Tongtong Zhang* *Department of Computer Science and Department of Biochemistry, University
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationLecture 20: Clustering and Evolution
Lecture 20: Clustering and Evolution Study Chapter 10.4 10.8 11/11/2014 Comp 555 Bioalgorithms (Fall 2014) 1 Clique Graphs A clique is a graph where every vertex is connected via an edge to every other
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationSemi-Supervised Learning with Trees
Semi-Supervised Learning with Trees Charles Kemp, Thomas L. Griffiths, Sean Stromsten & Joshua B. Tenenbaum Department of Brain and Cognitive Sciences, MIT, Cambridge, MA 0139 {ckemp,gruffydd,sean s,jbt}@mit.edu
More informationLinear Programming and its Applications
Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear
More informationSTATISTICS IN THE BILLERA-HOLMES- VOGTMANN TREESPACE
University of Kentucky UKnowledge Theses and Dissertations--Statistics Statistics 2015 STATISTICS IN THE BILLERA-HOLMES- VOGTMANN TREESPACE Grady S. Weyenberg University of Kentucky, gradysw@gmail.com
More informationIdentifiability of Large Phylogenetic Mixture Models
Identifiability of Large Phylogenetic Mixture Models John Rhodes and Seth Sullivant University of Alaska Fairbanks and NCSU April 18, 2012 Seth Sullivant (NCSU) Phylogenetic Mixtures April 18, 2012 1 /
More informationDynamic Programming for Phylogenetic Estimation
1 / 45 Dynamic Programming for Phylogenetic Estimation CS598AGB Pranjal Vachaspati University of Illinois at Urbana-Champaign 2 / 45 Coalescent-based Species Tree Estimation Find evolutionary tree for
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 29
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 29 CS 473: Algorithms, Spring 2018 Simplex and LP Duality Lecture 19 March 29, 2018
More informationFrom Trees to Networks and Back
From Trees to Networks and Back Sarah Bastkowski Supervisor: Prof. Vincent Moulton Co-supervisor: Dr. Geoffrey Mckeown A thesis submitted for the degree of Doctor of Philosophy at the University of East
More informationLesson 05. Mid Phase. Collision Detection
Lesson 05 Mid Phase Collision Detection Lecture 05 Outline Problem definition and motivations Generic Bounding Volume Hierarchy (BVH) BVH construction, fitting, overlapping Metrics and Tandem traversal
More informationBig Data Analytics. Special Topics for Computer Science CSE CSE Feb 11
Big Data Analytics Special Topics for Computer Science CSE 4095-001 CSE 5095-005 Feb 11 Fei Wang Associate Professor Department of Computer Science and Engineering fei_wang@uconn.edu Clustering II Spectral
More informationPhylogenetics. Introduction to Bioinformatics Dortmund, Lectures: Sven Rahmann. Exercises: Udo Feldkamp, Michael Wurst
Phylogenetics Introduction to Bioinformatics Dortmund, 16.-20.07.2007 Lectures: Sven Rahmann Exercises: Udo Feldkamp, Michael Wurst 1 Phylogenetics phylum = tree phylogenetics: reconstruction of evolutionary
More informationPhylogenetic Trees and Their Analysis
City University of New York (CUNY) CUNY Academic Works Dissertations, Theses, and Capstone Projects Graduate Center 2-2014 Phylogenetic Trees and Their Analysis Eric Ford Graduate Center, City University
More informationSCORE EQUIVALENCE & POLYHEDRAL APPROACHES TO LEARNING BAYESIAN NETWORKS
SCORE EQUIVALENCE & POLYHEDRAL APPROACHES TO LEARNING BAYESIAN NETWORKS David Haws*, James Cussens, Milan Studeny IBM Watson dchaws@gmail.com University of York, Deramore Lane, York, YO10 5GE, UK The Institute
More informationPhylogenetic Trees Lecture 12. Section 7.4, in Durbin et al., 6.5 in Setubal et al. Shlomo Moran, Ilan Gronau
Phylogenetic Trees Lecture 12 Section 7.4, in Durbin et al., 6.5 in Setubal et al. Shlomo Moran, Ilan Gronau. Maximum Parsimony. Last week we presented Fitch algorithm for (unweighted) Maximum Parsimony:
More informationDistances Between Phylogenetic Trees: A Survey
TSINGHUA SCIENCE AND TECHNOLOGY ISSNll1007-0214ll07/11llpp490-499 Volume 18, Number 5, October 2013 Distances Between Phylogenetic Trees: A Survey Feng Shi, Qilong Feng, Jianer Chen, Lusheng Wang, and
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationThe History Bound and ILP
The History Bound and ILP Julia Matsieva and Dan Gusfield UC Davis March 15, 2017 Bad News for Tree Huggers More Bad News Far more convincingly even than the (also highly convincing) fossil evidence, the
More information11/17/2009 Comp 590/Comp Fall
Lecture 20: Clustering and Evolution Study Chapter 10.4 10.8 Problem Set #5 will be available tonight 11/17/2009 Comp 590/Comp 790-90 Fall 2009 1 Clique Graphs A clique is a graph with every vertex connected
More informationCS 441 Discrete Mathematics for CS Lecture 26. Graphs. CS 441 Discrete mathematics for CS. Final exam
CS 441 Discrete Mathematics for CS Lecture 26 Graphs Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Final exam Saturday, April 26, 2014 at 10:00-11:50am The same classroom as lectures The exam
More informationDISTANCE BASED METHODS IN PHYLOGENTIC TREE CONSTRUCTION
DISTANCE BASED METHODS IN PHYLOGENTIC TREE CONSTRUCTION CHUANG PENG DEPARTMENT OF MATHEMATICS MOREHOUSE COLLEGE ATLANTA, GA 30314 Abstract. One of the most fundamental aspects of bioinformatics in understanding
More informationAlgebraic statistics for network models
Algebraic statistics for network models Connecting statistics, combinatorics, and computational algebra Part One Sonja Petrović (Statistics Department, Pennsylvania State University) Applied Mathematics
More informationbe a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that
( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices
More informationLinear Programming. Linear Programming. Linear Programming. Example: Profit Maximization (1/4) Iris Hui-Ru Jiang Fall Linear programming
Linear Programming 3 describes a broad class of optimization tasks in which both the optimization criterion and the constraints are linear functions. Linear Programming consists of three parts: A set of
More informationMarkovian Models of Genetic Inheritance
Markovian Models of Genetic Inheritance Elchanan Mossel, U.C. Berkeley mossel@stat.berkeley.edu, http://www.cs.berkeley.edu/~mossel/ 6/18/12 1 General plan Define a number of Markovian Inheritance Models
More information1. Meshes. D7013E Lecture 14
D7013E Lecture 14 Quadtrees Mesh Generation 1. Meshes Input: Components in the form of disjoint polygonal objects Integer coordinates, 0, 45, 90, or 135 angles Output: A triangular mesh Conforming: A triangle
More informationTerminology. A phylogeny is the evolutionary history of an organism
Phylogeny Terminology A phylogeny is the evolutionary history of an organism A taxon (plural: taxa) is a group of (one or more) organisms, which a taxonomist adjudges to be a unit. A definition? from Wikipedia
More informationINFERENCE OF PARSIMONIOUS SPECIES TREES FROM MULTI-LOCUS DATA BY MINIMIZING DEEP COALESCENCES CUONG THAN AND LUAY NAKHLEH
INFERENCE OF PARSIMONIOUS SPECIES TREES FROM MULTI-LOCUS DATA BY MINIMIZING DEEP COALESCENCES CUONG THAN AND LUAY NAKHLEH Abstract. One approach for inferring a species tree from a given multi-locus data
More information9/29/13. Outline Data mining tasks. Clustering algorithms. Applications of clustering in biology
9/9/ I9 Introduction to Bioinformatics, Clustering algorithms Yuzhen Ye (yye@indiana.edu) School of Informatics & Computing, IUB Outline Data mining tasks Predictive tasks vs descriptive tasks Example
More informationStudy of a Simple Pruning Strategy with Days Algorithm
Study of a Simple Pruning Strategy with ays Algorithm Thomas G. Kristensen Abstract We wish to calculate all pairwise Robinson Foulds distances in a set of trees. Traditional algorithms for doing this
More information6. Algorithm Design Techniques
6. Algorithm Design Techniques 6. Algorithm Design Techniques 6.1 Greedy algorithms 6.2 Divide and conquer 6.3 Dynamic Programming 6.4 Randomized Algorithms 6.5 Backtracking Algorithms Malek Mouhoub, CS340
More informationDecision trees. Decision trees are useful to a large degree because of their simplicity and interpretability
Decision trees A decision tree is a method for classification/regression that aims to ask a few relatively simple questions about an input and then predicts the associated output Decision trees are useful
More information