Exploring Treespace. Katherine St. John. Lehman College & the Graduate Center. City University of New York. 20 June 2011

Size: px
Start display at page:

Download "Exploring Treespace. Katherine St. John. Lehman College & the Graduate Center. City University of New York. 20 June 2011"

Transcription

1 Exploring Treespace Katherine St. John Lehman College & the Graduate Center City University of New York 20 June 2011 (Joint work with the Treespace Working Group, CUNY: Ann Marie Alcocer, Kadian Brown, Alan Joseph Caceres, Juan Castillo, Samantha Daley, John De Jesus, Eric Ford, Kaitlin Hansen, Michael Hintze, Daniele Ippolito, Jinnie Lee, Oliver Mendez, & Diquan Moore)

2 Phylogenetic Trees leaves represent extant (living) species Charles Darwin, 1837 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

3 Phylogenetic Trees leaves represent extant (living) species internal nodes represent extinct species Charles Darwin, 1837 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

4 Phylogenetic Trees leaves represent extant (living) species internal nodes represent extinct species if rooted, the root represents the ancestor of all the species Charles Darwin, 1837 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

5 Some Uses of Evolutionary Trees David Hillis, 2002 classifying species building the Tree of Life designing the flu vaccine and other drugs determining the origins of HIV infection Katherine St. John (CUNY) Exploring Treespace 20 June / 19

6 How Many Phylogenetic Trees? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

7 How Many Phylogenetic Trees? Semple & Steel 2003: # of trees = (2n 5) = (2n 5)!! 1 2 n 2 n!n 5 2 Π ( 2 e )n n n 2 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

8 How Many Phylogenetic Trees? Semple & Steel 2003: # of trees = (2n 5) = (2n 5)!! 1 2 n 2 n!n 5 2 Π ( 2 e )n n n 2 (For n 50, more possible tree topologies than there are atoms in the universe.) Katherine St. John (CUNY) Exploring Treespace 20 June / 19

9 Searching for Optimal Trees Local search techniques prevail: NNI Treespace for n = 6 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

10 Searching for Optimal Trees Local search techniques prevail: at each step, choose the next tree from its neighbors NNI Treespace for n = 6 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

11 Searching for Optimal Trees Local search techniques prevail: at each step, choose the next tree from its neighbors Many different ways to define neighbors. NNI Treespace for n = 6 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

12 Searching for Optimal Trees NNI Treespace for n = 6 Local search techniques prevail: at each step, choose the next tree from its neighbors Many different ways to define neighbors. Most rely on an underlying metric between trees. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

13 Popular Metrics Focus on three popular metrics: A B Nearest Neighbor Interchange (NNI) C D E G F Subtree Prune and Regraft (SPR) Tree Bisection and Reconnection (TBR) Katherine St. John (CUNY) Exploring Treespace 20 June / 19

14 Popular Metrics Focus on three popular metrics: A B Nearest Neighbor Interchange (NNI) C D E G F Subtree Prune and Regraft (SPR) Tree Bisection and Reconnection (TBR) Note that NNI SPR TBR. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

15 NNI Metric A B A B C D E G F C F G D E The NNI distance between two trees is the minimal number of moves needed to transform one to the other (NP-hard, DasGupta et al. 1997). Katherine St. John (CUNY) Exploring Treespace 20 June / 19

16 SPR Distance A B A B C C G D F D E E G F C D A B G F E SPR distance is the minimal number of moves that transforms one tree into the other. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

17 SPR Distance A B A B C C G D F D E E G F C D A B G F E SPR distance is the minimal number of moves that transforms one tree into the other. SPR for rooted trees is NP-hard. (Bordewich & Semple 05) SPR for unrooted trees is NP-hard. (Hickey et al. 08) Katherine St. John (CUNY) Exploring Treespace 20 June / 19

18 TBR Distance A B C D E G F A B C D E G F A B A B C D E G F C D G E F TBR distance is the minimal number of moves that transforms one tree into the other. TBR for rooted trees is NP-hard. (Allen & Steel 01) Katherine St. John (CUNY) Exploring Treespace 20 June / 19

19 Treespace For every n, treespace is the space of all phylogenetic trees on a n taxa, under a fixed metric. Treespace for n = 5 under NNI Bastert et al., 2002 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

20 Treespace For every n, treespace is the space of all phylogenetic trees on a n taxa, under a fixed metric. The size of neighborhoods varies by metric (Allen & Steel, 2001): Treespace for n = 5 under NNI Bastert et al., 2002 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

21 Treespace For every n, treespace is the space of all phylogenetic trees on a n taxa, under a fixed metric. The size of neighborhoods varies by metric (Allen & Steel, 2001): Treespace for n = 5 under NNI Bastert et al., 2002 General n = 5 NNI 2n 6 4 SPR 2(n 3)(2n 7) 12 TBR < (2n 3)(n 3) 2 12 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

22 Bryant s Challenge: Walking Through Trees Combinatorial Challenge I: An NNI-walk is a sequencet 1, T 2,..., T k of unrooted binary phylogenetic trees where each consecutive pair of trees differ by a single NNI. David Bryant Katherine St. John (CUNY) Exploring Treespace 20 June / 19

23 Bryant s Challenge: Walking Through Trees Combinatorial Challenge I: An NNI-walk is a sequencet 1, T 2,..., T k of unrooted binary phylogenetic trees where each consecutive pair of trees differ by a single NNI. What is the shortest NNI walk that passes through all binary trees on n leaves? David Bryant Katherine St. John (CUNY) Exploring Treespace 20 June / 19

24 Bryant s Challenge: Walking Through Trees David Bryant Combinatorial Challenge I: An NNI-walk is a sequencet 1, T 2,..., T k of unrooted binary phylogenetic trees where each consecutive pair of trees differ by a single NNI. What is the shortest NNI walk that passes through all binary trees on n leaves? Suppose we are given a tree T. What is the shortest NNI walk that passes through all the trees that lie at most one SPR (subtree prune and regraft) move from T? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

25 Hamiltonicity Recall that a graph is Hamiltonian if there exists a path that visits every node exactly once. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

26 Hamiltonicity Recall that a graph is Hamiltonian if there exists a path that visits every node exactly once. Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

27 Hamiltonicity Recall that a graph is Hamiltonian if there exists a path that visits every node exactly once. Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

28 Hamiltonicity Recall that a graph is Hamiltonian if there exists a path that visits every node exactly once. Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. Open: What is the shortest path for the NNI treespace for n 8? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

29 Proof Sketch of Walks of Treespace: By induction on n. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

30 Proof Sketch of Walks of Treespace: By induction on n. Assume there is a path for treespace of n taxa trees, and build from it a path for treespace of n + 1-taxa trees. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

31 Proof Sketch of Walks of Treespace: By induction on n. Assume there is a path for treespace of n taxa trees, and build from it a path for treespace of n + 1-taxa trees. Expand each n-taxa tree into 2(n 3) (n + 1)-taxa trees. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

32 Proof Sketch of Walks of Treespace: By induction on n. Assume there is a path for treespace of n taxa trees, and build from it a path for treespace of n + 1-taxa trees. Expand each n-taxa tree into 2(n 3) (n + 1)-taxa trees. For SPR (and TBR), there is a Hamiltonian path in each such group. (Not true for NNI only a 2-walk) Katherine St. John (CUNY) Exploring Treespace 20 June / 19

33 Proof Sketch of Walks of Treespace: By induction on n. Assume there is a path for treespace of n taxa trees, and build from it a path for treespace of n + 1-taxa trees. Expand each n-taxa tree into 2(n 3) (n + 1)-taxa trees. For SPR (and TBR), there is a Hamiltonian path in each such group. (Not true for NNI only a 2-walk) Glue the paths together to make a path for the whole space. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

34 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

35 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? An SPR-neighborhood for n = 6: Katherine St. John (CUNY) Exploring Treespace 20 June / 19

36 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? An SPR-neighborhood for n = 6: Theorem: n 6, there exists SPR-neighborhoods where the NNI-walk cannot be a Hamiltonian path. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

37 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? An SPR-neighborhood for n = 6: Theorem: n 6, there exists SPR-neighborhoods where the NNI-walk cannot be a Hamiltonian path. Proof Idea: The SPR-neighborhood of caterpillars all have 4 isolated triangles. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

38 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

39 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? The SPR-neighborhoods for n = 7: caterpillar tree other tree topology Katherine St. John (CUNY) Exploring Treespace 20 June / 19

40 SPR Neighborhoods Bryant s Conjecture: What is the shortest NNI-walk on a SPR-neighborhood? The SPR-neighborhoods for n = 7: caterpillar tree other tree topology Shortest paths are +8 and +6 more than the minimal Hamiltonian path. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

41 Summary Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. NNI Treespace for n = 6 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

42 Summary Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. Open: What is the shortest path for the NNI treespace for n 8? NNI Treespace for n = 6 Katherine St. John (CUNY) Exploring Treespace 20 June / 19

43 Summary NNI Treespace for n = 6 Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. Open: What is the shortest path for the NNI treespace for n 8? Theorem: n 6, the minimal NNI-walk of an SPR-neighborhood is not Hamiltonian. Katherine St. John (CUNY) Exploring Treespace 20 June / 19

44 Summary NNI Treespace for n = 6 Caceres, Daley, De Jesus, Hintze, Moore, & St. John, 2011: Theorem: n, treespace is Hamiltonian for the SPR and TBR metrics. Theorem: n 7, treespace is Hamiltonian for the NNI metric. Open: What is the shortest path for the NNI treespace for n 8? Theorem: n 6, the minimal NNI-walk of an SPR-neighborhood is not Hamiltonian. Open: What is the shortest NNI-walk of an SPR-neighborhood? Katherine St. John (CUNY) Exploring Treespace 20 June / 19

45 Treespace Working Group A team of undergraduate students in mathematics and computer science contributed to this work: Ann Marie Alcocer, Kadian Brown, Alan Caceres, Samantha Daley, John De Jesus, Kaitlin Hansen, Michael Hintze, Daniele Ippolito, Jinnie Lee, Oliver Mendez, and Diquan Moore Katherine St. John (CUNY) Exploring Treespace 20 June / 19

46 Acknowledgments The organizers and the Isaac Newton Institute The US National Science Foundation for their generous support The New York Louis Stokes Alliance for Minority Participation in Research for student funding Katherine St. John (CUNY) Exploring Treespace 20 June / 19

47 Acknowledgments The organizers and Isaac Newton Institute The National Science Foundation for their generous support The New York Louis Stokes Alliance for Minority Participation in Research for student funding And last, but not least, Sean Katherine St. John (CUNY) Exploring Treespace 20 June / 19

Walks in Phylogenetic Treespace

Walks in Phylogenetic Treespace Walks in Phylogenetic Treespace lan Joseph aceres Samantha aley John ejesus Michael Hintze iquan Moore Katherine St. John bstract We prove that the spaces of unrooted phylogenetic trees are Hamiltonian

More information

Finding the best tree by heuristic search

Finding the best tree by heuristic search Chapter 4 Finding the best tree by heuristic search If we cannot find the best trees by examining all possible trees, we could imagine searching in the space of possible trees. In this chapter we will

More information

SPR Distance Computation for Unrooted Trees

SPR Distance Computation for Unrooted Trees ORIGINAL RESEARCH SPR Distance Computation for Unrooted Trees Glenn Hickey, Frank Dehne, Andrew Rau-Chaplin and Christian Blouin School of Computer Science, Carleton University, Ottawa, Canada KS 5B. School

More information

Molecular Evolution & Phylogenetics

Molecular Evolution & Phylogenetics Molecular Evolution & Phylogenetics Heuristics based on tree alterations, maximum likelihood, Bayesian methods, statistical confidence measures Jean-Baka Domelevo Entfellner Learning Objectives know basic

More information

Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees

Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees nnals of Combinatorics 5 (2001) 1-15 0218-0006/01/010001-15$1.50+0.20/0 c Birkhäuser Verlag, Basel, 2001 nnals of Combinatorics Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees

More information

On the Subnet Prune and Regraft distance

On the Subnet Prune and Regraft distance On the Subnet Prune and Regraft distance Jonathan Klawitter and Simone Linz Department of Computer Science, University of Auckland, New Zealand jo. klawitter@ gmail. com, s. linz@ auckland. ac. nz arxiv:805.07839v

More information

NOTE ON THE HYBRIDIZATION NUMBER AND SUBTREE DISTANCE IN PHYLOGENETICS

NOTE ON THE HYBRIDIZATION NUMBER AND SUBTREE DISTANCE IN PHYLOGENETICS NOTE ON THE HYBRIDIZATION NUMBER AND SUBTREE DISTANCE IN PHYLOGENETICS PETER J. HUMPHRIES AND CHARLES SEMPLE Abstract. For two rooted phylogenetic trees T and T, the rooted subtree prune and regraft distance

More information

Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand

Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand COMPUTING THE ROOTED S UBTREE PRUNE AND DISTANCE IS NP-HARD M Bordewich and C Semple Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand Report

More information

(Stevens 1991) 1. morphological characters should be assumed to be quantitative unless demonstrated otherwise

(Stevens 1991) 1. morphological characters should be assumed to be quantitative unless demonstrated otherwise Bot 421/521 PHYLOGENETIC ANALYSIS I. Origins A. Hennig 1950 (German edition) Phylogenetic Systematics 1966 B. Zimmerman (Germany, 1930 s) C. Wagner (Michigan, 1920-2000) II. Characters and character states

More information

A CLUSTER REDUCTION FOR COMPUTING THE SUBTREE DISTANCE BETWEEN PHYLOGENIES

A CLUSTER REDUCTION FOR COMPUTING THE SUBTREE DISTANCE BETWEEN PHYLOGENIES A CLUSTER REDUCTION FOR COMPUTING THE SUBTREE DISTANCE BETWEEN PHYLOGENIES SIMONE LINZ AND CHARLES SEMPLE Abstract. Calculating the rooted subtree prune and regraft (rspr) distance between two rooted binary

More information

arxiv: v1 [q-bio.pe] 16 Aug 2007

arxiv: v1 [q-bio.pe] 16 Aug 2007 MAXIMUM LIKELIHOOD SUPERTREES arxiv:0708.2124v1 [q-bio.pe] 16 Aug 2007 MIKE STEEL AND ALLEN RODRIGO Abstract. We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger supertree.

More information

arxiv: v1 [q-bio.pe] 1 Jun 2014

arxiv: v1 [q-bio.pe] 1 Jun 2014 THE MOST PARSIMONIOUS TREE FOR RANDOM DATA MAREIKE FISCHER, MICHELLE GALLA, LINA HERBST AND MIKE STEEL arxiv:46.27v [q-bio.pe] Jun 24 Abstract. Applying a method to reconstruct a phylogenetic tree from

More information

Solving the Maximum Agreement Subtree and Maximum Comp. Tree problems on bounded degree trees. Sylvain Guillemot, François Nicolas.

Solving the Maximum Agreement Subtree and Maximum Comp. Tree problems on bounded degree trees. Sylvain Guillemot, François Nicolas. Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees LIRMM, Montpellier France 4th July 2006 Introduction The Mast and Mct problems: given a set of evolutionary

More information

Parsimony via Consensus

Parsimony via Consensus Syst. Biol. 57(2):251 256, 2008 Copyright c Society of Systematic Biologists ISSN: 1063-5157 print / 1076-836X online DOI: 10.1080/10635150802040597 Parsimony via Consensus TREVOR C. BRUEN 1 AND DAVID

More information

Evolutionary Trees. Evolutionary tree. To describe the evolutionary relationship among species A 3 A 2 A 4. R.C.T. Lee and Chin Lung Lu

Evolutionary Trees. Evolutionary tree. To describe the evolutionary relationship among species A 3 A 2 A 4. R.C.T. Lee and Chin Lung Lu Evolutionary Trees R.C.T. Lee and Chin Lung Lu CS 5313 Algorithms for Molecular Biology Evolutionary Trees p.1 Evolutionary tree To describe the evolutionary relationship among species Root A 3 Bifurcating

More information

Maximum Agreement Subtrees

Maximum Agreement Subtrees Maximum Agreement Subtrees Seth Sullivant North Carolina State University March 24, 2018 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, 2018 1 / 23 Phylogenetics Problem Given a collection

More information

Phylogenetics. BIOL 7711 Computational Bioscience

Phylogenetics. BIOL 7711 Computational Bioscience Consortium for Comparative Genomics! University of Colorado School of Medicine Phylogenetics BIOL 7711 Computational Bioscience Biochemistry and Molecular Genetics Computational Bioscience Program Consortium

More information

A 3-APPROXIMATION ALGORITHM FOR THE SUBTREE DISTANCE BETWEEN PHYLOGENIES. 1. Introduction

A 3-APPROXIMATION ALGORITHM FOR THE SUBTREE DISTANCE BETWEEN PHYLOGENIES. 1. Introduction A 3-APPROXIMATION ALGORITHM FOR THE SUBTREE DISTANCE BETWEEN PHYLOGENIES MAGNUS BORDEWICH 1, CATHERINE MCCARTIN 2, AND CHARLES SEMPLE 3 Abstract. In this paper, we give a (polynomial-time) 3-approximation

More information

RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION

RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION MAGNUS BORDEWICH, KATHARINA T. HUBER, VINCENT MOULTON, AND CHARLES SEMPLE Abstract. Phylogenetic networks are a type of leaf-labelled,

More information

Inferring phylogeny. Today s topics. Milestones of molecular evolution studies Contributions to molecular evolution

Inferring phylogeny. Today s topics. Milestones of molecular evolution studies Contributions to molecular evolution Today s topics Inferring phylogeny Introduction! Distance methods! Parsimony method!"#$%&'(!)* +,-.'/01!23454(6!7!2845*0&4'9#6!:&454(6 ;?@AB=C?DEF Overview of phylogenetic inferences Methodology Methods

More information

More on NP and Reductions

More on NP and Reductions Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data

More information

NJMerge: A generic technique for scaling phylogeny estimation methods and its application to species trees

NJMerge: A generic technique for scaling phylogeny estimation methods and its application to species trees NJMerge: A generic technique for scaling phylogeny estimation methods and its application to species trees Erin Molloy and Tandy Warnow {emolloy2, warnow}@illinois.edu University of Illinois at Urbana

More information

Evolutionary Tree Analysis. Overview

Evolutionary Tree Analysis. Overview CSI/BINF 5330 Evolutionary Tree Analysis Young-Rae Cho Associate Professor Department of Computer Science Baylor University Overview Backgrounds Distance-Based Evolutionary Tree Reconstruction Character-Based

More information

Phylogeny. November 7, 2017

Phylogeny. November 7, 2017 Phylogeny November 7, 2017 Phylogenetics Phylon = tribe/race, genetikos = relative to birth Phylogenetics: study of evolutionary relationships among organisms, sequences, or anything in between Related

More information

The Complexity of the uspr Distance

The Complexity of the uspr Distance The omplexity of the uspr istance Maria Luisa onet Universtidad Politecnica de atalunya arcelona, Spain bonet@lsi.upc.edu Published in I/M T 2010 Joint work with Katherine St. John Maria Luisa onet, Phylogenetics

More information

July 18, Approximation Algorithms (Travelling Salesman Problem)

July 18, Approximation Algorithms (Travelling Salesman Problem) Approximation Algorithms (Travelling Salesman Problem) July 18, 2014 The travelling-salesman problem Problem: given complete, undirected graph G = (V, E) with non-negative integer cost c(u, v) for each

More information

Phylogenetic Trees. What They Are Why We Do It & How To Do It. Presented by Amy Harris Dr Brad Morantz

Phylogenetic Trees. What They Are Why We Do It & How To Do It. Presented by Amy Harris Dr Brad Morantz Phylogenetic Trees What They Are Why We Do It & How To Do It Presented by Amy Harris Dr Brad Morantz Overview What is a phylogenetic tree Why do we do it How do we do it Methods and programs Parallels

More information

Who Has Heard of This Problem? Courtesy: Jeremy Kun

Who Has Heard of This Problem? Courtesy: Jeremy Kun P vs. NP 02-201 Who Has Heard of This Problem? Courtesy: Jeremy Kun Runtime Analysis Last time, we saw that there is no solution to the Halting Problem. Halting Problem: Determine if a program will halt.

More information

arxiv: v2 [q-bio.pe] 4 Feb 2016

arxiv: v2 [q-bio.pe] 4 Feb 2016 Annals of the Institute of Statistical Mathematics manuscript No. (will be inserted by the editor) Distributions of topological tree metrics between a species tree and a gene tree Jing Xi Jin Xie Ruriko

More information

The maximum agreement subtree problem

The maximum agreement subtree problem The maximum agreement subtree problem arxiv:1201.5168v5 [math.co] 20 Feb 2013 Daniel M. Martin Centro de Matemática, Computação e Cognição Universidade Federal do ABC, Santo André, SP 09210-170 Brasil.

More information

Phylogeny. Properties of Trees. Properties of Trees. Trees represent the order of branching only. Phylogeny: Taxon: a unit of classification

Phylogeny. Properties of Trees. Properties of Trees. Trees represent the order of branching only. Phylogeny: Taxon: a unit of classification Multiple sequence alignment global local Evolutionary tree reconstruction Pairwise sequence alignment (global and local) Substitution matrices Gene Finding Protein structure prediction N structure prediction

More information

Improved Approximations for Cubic Bipartite and Cubic TSP

Improved Approximations for Cubic Bipartite and Cubic TSP Improved Approximations for Cubic Bipartite and Cubic TSP Anke van Zuylen Department of Mathematics The College of William and Mary, Williamsburg, VA, 23185, USA anke@wm.edu Abstract We show improved approximation

More information

Phylogenetic Tree Reconstruction

Phylogenetic Tree Reconstruction I519 Introduction to Bioinformatics, 2011 Phylogenetic Tree Reconstruction Yuzhen Ye (yye@indiana.edu) School of Informatics & Computing, IUB Evolution theory Speciation Evolution of new organisms is driven

More information

BIOL 1010 Introduction to Biology: The Evolution and Diversity of Life. Spring 2011 Sections A & B

BIOL 1010 Introduction to Biology: The Evolution and Diversity of Life. Spring 2011 Sections A & B BIOL 1010 Introduction to Biology: The Evolution and Diversity of Life. Spring 2011 Sections A & B Steve Thompson: stthompson@valdosta.edu http://www.bioinfo4u.net 1 ʻTree of Life,ʼ ʻprimitive,ʼ ʻprogressʼ

More information

Hamiltonian Cycle. Hamiltonian Cycle

Hamiltonian Cycle. Hamiltonian Cycle Hamiltonian Cycle Hamiltonian Cycle Hamiltonian Cycle Problem Hamiltonian Cycle Given a directed graph G, is there a cycle that visits every vertex exactly once? Such a cycle is called a Hamiltonian cycle.

More information

CS 581 Paper Presentation

CS 581 Paper Presentation CS 581 Paper Presentation Muhammad Samir Khan Recovering the Treelike Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis by Sebastien Roch and Sagi Snir Overview Introduction

More information

Phylogenetic trees 07/10/13

Phylogenetic trees 07/10/13 Phylogenetic trees 07/10/13 A tree is the only figure to occur in On the Origin of Species by Charles Darwin. It is a graphical representation of the evolutionary relationships among entities that share

More information

9/30/11. Evolution theory. Phylogenetic Tree Reconstruction. Phylogenetic trees (binary trees) Phylogeny (phylogenetic tree)

9/30/11. Evolution theory. Phylogenetic Tree Reconstruction. Phylogenetic trees (binary trees) Phylogeny (phylogenetic tree) I9 Introduction to Bioinformatics, 0 Phylogenetic ree Reconstruction Yuzhen Ye (yye@indiana.edu) School of Informatics & omputing, IUB Evolution theory Speciation Evolution of new organisms is driven by

More information

A Fitness Distance Correlation Measure for Evolutionary Trees

A Fitness Distance Correlation Measure for Evolutionary Trees A Fitness Distance Correlation Measure for Evolutionary Trees Hyun Jung Park 1, and Tiffani L. Williams 2 1 Department of Computer Science, Rice University hp6@cs.rice.edu 2 Department of Computer Science

More information

Beyond Galled Trees Decomposition and Computation of Galled Networks

Beyond Galled Trees Decomposition and Computation of Galled Networks Beyond Galled Trees Decomposition and Computation of Galled Networks Daniel H. Huson & Tobias H.Kloepper RECOMB 2007 1 Copyright (c) 2008 Daniel Huson. Permission is granted to copy, distribute and/or

More information

Notes 3 : Maximum Parsimony

Notes 3 : Maximum Parsimony Notes 3 : Maximum Parsimony MATH 833 - Fall 2012 Lecturer: Sebastien Roch References: [SS03, Chapter 5], [DPV06, Chapter 8] 1 Beyond Perfect Phylogenies Viewing (full, i.e., defined on all of X) binary

More information

Applications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee)

Applications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee) Applications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee) Michael Fuchs Department of Applied Mathematics National Chiao Tung University

More information

Properties of normal phylogenetic networks

Properties of normal phylogenetic networks Properties of normal phylogenetic networks Stephen J. Willson Department of Mathematics Iowa State University Ames, IA 50011 USA swillson@iastate.edu August 13, 2009 Abstract. A phylogenetic network is

More information

From graph classes to phylogenetic networks Philippe Gambette

From graph classes to phylogenetic networks Philippe Gambette 40 années d'algorithmique de graphes 40 Years of Graphs and Algorithms 11/10/2018 - Paris From graph classes to phylogenetic networks Philippe Gambette Outline Discovering graph classes with Michel An

More information

BINF6201/8201. Molecular phylogenetic methods

BINF6201/8201. Molecular phylogenetic methods BINF60/80 Molecular phylogenetic methods 0-7-06 Phylogenetics Ø According to the evolutionary theory, all life forms on this planet are related to one another by descent. Ø Traditionally, phylogenetics

More information

UNICYCLIC NETWORKS: COMPATIBILITY AND ENUMERATION

UNICYCLIC NETWORKS: COMPATIBILITY AND ENUMERATION UNICYCLIC NETWORKS: COMPATIBILITY AND ENUMERATION CHARLES SEMPLE AND MIKE STEEL Abstract. Graphs obtained from a binary leaf labelled ( phylogenetic ) tree by adding an edge so as to introduce a cycle

More information

Algorithms for Picture Analysis. Lecture 07: Metrics. Axioms of a Metric

Algorithms for Picture Analysis. Lecture 07: Metrics. Axioms of a Metric Axioms of a Metric Picture analysis always assumes that pictures are defined in coordinates, and we apply the Euclidean metric as the golden standard for distance (or derived, such as area) measurements.

More information

DNA Phylogeny. Signals and Systems in Biology Kushal EE, IIT Delhi

DNA Phylogeny. Signals and Systems in Biology Kushal EE, IIT Delhi DNA Phylogeny Signals and Systems in Biology Kushal Shah @ EE, IIT Delhi Phylogenetics Grouping and Division of organisms Keeps changing with time Splitting, hybridization and termination Cladistics :

More information

THE THREE-STATE PERFECT PHYLOGENY PROBLEM REDUCES TO 2-SAT

THE THREE-STATE PERFECT PHYLOGENY PROBLEM REDUCES TO 2-SAT COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2009 International Press Vol. 9, No. 4, pp. 295-302, 2009 001 THE THREE-STATE PERFECT PHYLOGENY PROBLEM REDUCES TO 2-SAT DAN GUSFIELD AND YUFENG WU Abstract.

More information

DISTRIBUTIONS OF CHERRIES FOR TWO MODELS OF TREES

DISTRIBUTIONS OF CHERRIES FOR TWO MODELS OF TREES DISTRIBUTIONS OF CHERRIES FOR TWO MODELS OF TREES ANDY McKENZIE and MIKE STEEL Biomathematics Research Centre University of Canterbury Private Bag 4800 Christchurch, New Zealand No. 177 May, 1999 Distributions

More information

Bounds on the Traveling Salesman Problem

Bounds on the Traveling Salesman Problem Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,

More information

CS5238 Combinatorial methods in bioinformatics 2003/2004 Semester 1. Lecture 8: Phylogenetic Tree Reconstruction: Distance Based - October 10, 2003

CS5238 Combinatorial methods in bioinformatics 2003/2004 Semester 1. Lecture 8: Phylogenetic Tree Reconstruction: Distance Based - October 10, 2003 CS5238 Combinatorial methods in bioinformatics 2003/2004 Semester 1 Lecture 8: Phylogenetic Tree Reconstruction: Distance Based - October 10, 2003 Lecturer: Wing-Kin Sung Scribe: Ning K., Shan T., Xiang

More information

Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction

Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction Daniel Štefankovič Eric Vigoda June 30, 2006 Department of Computer Science, University of Rochester, Rochester, NY 14627, and Comenius

More information

CS/COE

CS/COE CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ P vs NP But first, something completely different... Some computational problems are unsolvable No algorithm can be written that will always produce the correct

More information

D1 Discrete Mathematics The Travelling Salesperson problem. The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm

D1 Discrete Mathematics The Travelling Salesperson problem. The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm 1 iscrete Mathematics The Travelling Salesperson problem The Nearest Neighbour lgorithm The Lower ound lgorithm The Tour Improvement lgorithm The Travelling Salesperson: Typically a travelling salesperson

More information

Splits and Phylogenetic Networks. Daniel H. Huson

Splits and Phylogenetic Networks. Daniel H. Huson Splits and Phylogenetic Networks Daniel H. Huson aris, June 21, 2005 1 2 Contents 1. Phylogenetic trees 2. Splits networks 3. Consensus networks 4. Hybridization and reticulate networks 5. Recombination

More information

Phylogeny: building the tree of life

Phylogeny: building the tree of life Phylogeny: building the tree of life Dr. Fayyaz ul Amir Afsar Minhas Department of Computer and Information Sciences Pakistan Institute of Engineering & Applied Sciences PO Nilore, Islamabad, Pakistan

More information

A (short) introduction to phylogenetics

A (short) introduction to phylogenetics A (short) introduction to phylogenetics Thibaut Jombart, Marie-Pauline Beugin MRC Centre for Outbreak Analysis and Modelling Imperial College London Genetic data analysis with PR Statistics, Millport Field

More information

Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers

Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers Discrete Mathematics and Theoretical Computer Science DMTCS vol. subm., by the authors, 1 1 Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers Christopher Eagle 1 and

More information

What is Phylogenetics

What is Phylogenetics What is Phylogenetics Phylogenetics is the area of research concerned with finding the genetic connections and relationships between species. The basic idea is to compare specific characters (features)

More information

SAT, Coloring, Hamiltonian Cycle, TSP

SAT, Coloring, Hamiltonian Cycle, TSP 1 SAT, Coloring, Hamiltonian Cycle, TSP Slides by Carl Kingsford Apr. 28, 2014 Sects. 8.2, 8.7, 8.5 2 Boolean Formulas Boolean Formulas: Variables: x 1, x 2, x 3 (can be either true or false) Terms: t

More information

Ant Colony Optimization: an introduction. Daniel Chivilikhin

Ant Colony Optimization: an introduction. Daniel Chivilikhin Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling

More information

Preliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}

Preliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)

More information

Bioinformatics 1. Sepp Hochreiter. Biology, Sequences, Phylogenetics Part 4. Bioinformatics 1: Biology, Sequences, Phylogenetics

Bioinformatics 1. Sepp Hochreiter. Biology, Sequences, Phylogenetics Part 4. Bioinformatics 1: Biology, Sequences, Phylogenetics Bioinformatics 1 Biology, Sequences, Phylogenetics Part 4 Sepp Hochreiter Klausur Mo. 30.01.2011 Zeit: 15:30 17:00 Raum: HS14 Anmeldung Kusss Contents Methods and Bootstrapping of Maximum Methods Methods

More information

Supertree Algorithms for Ancestral Divergence Dates and Nested Taxa

Supertree Algorithms for Ancestral Divergence Dates and Nested Taxa Supertree Algorithms for Ancestral Divergence Dates and Nested Taxa Charles Semple 1, Philip Daniel 1, Wim Hordijk 1, Roderic D. M. Page 2, and Mike Steel 1 1 Biomathematics Research Centre, Department

More information

Balanced Allocation Through Random Walk

Balanced Allocation Through Random Walk Balanced Allocation Through Random Walk Alan Frieze Samantha Petti November 25, 2017 Abstract We consider the allocation problem in which m (1 ε)dn items are to be allocated to n bins with capacity d.

More information

Data Mining. Preamble: Control Application. Industrial Researcher s Approach. Practitioner s Approach. Example. Example. Goal: Maintain T ~Td

Data Mining. Preamble: Control Application. Industrial Researcher s Approach. Practitioner s Approach. Example. Example. Goal: Maintain T ~Td Data Mining Andrew Kusiak 2139 Seamans Center Iowa City, Iowa 52242-1527 Preamble: Control Application Goal: Maintain T ~Td Tel: 319-335 5934 Fax: 319-335 5669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak

More information

Lassoing phylogenetic trees

Lassoing phylogenetic trees Katharina Huber, University of East Anglia, UK January 3, 22 www.kleurplatenwereld.nl/.../cowboy-lasso.gif Darwin s tree Phylogenetic tree T = (V,E) on X X={a,b,c,d,e} a b 2 (T;w) 5 6 c 3 4 7 d e i.e.

More information

Efficiency of Markov Chain Monte Carlo Tree Proposals in Bayesian Phylogenetics

Efficiency of Markov Chain Monte Carlo Tree Proposals in Bayesian Phylogenetics Syst. Biol. 57(1):86 103, 2008 Copyright c Society of Systematic Biologists ISSN: 1063-5157 print / 1076-836X online DOI: 10.1080/10635150801886156 Efficiency of Markov Chain Monte Carlo Tree Proposals

More information

Tight Bounds on the Diameter of Gaussian Cubes

Tight Bounds on the Diameter of Gaussian Cubes Tight Bounds on the Diameter of Gaussian Cubes DING-MING KWAI AND BEHROOZ PARHAMI Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106 9560, USA Email: parhami@ece.ucsb.edu

More information

Navigation in the Space of Hierarchies using NNI Moves

Navigation in the Space of Hierarchies using NNI Moves ESE TECHNICAL REPORT - MAY 3, 203 Navigation in the Space of Hierarchies using NNI Moves Omur Arslan, Dan P. Guralnik and Daniel E. Koditschek Abstract A fundamental classification problem common to both

More information

A Geometric Approach to Tree Shape Statistics

A Geometric Approach to Tree Shape Statistics Syst. Biol. 55(4):652 661, 2006 Copyright c Society of Systematic Biologists ISSN: 1063-5157 print / 1076-836X online DOI: 10.1080/10635150600889617 A Geometric Approach to Tree Shape Statistics FREDERICK

More information

Bioinformatics 1 -- lecture 9. Phylogenetic trees Distance-based tree building Parsimony

Bioinformatics 1 -- lecture 9. Phylogenetic trees Distance-based tree building Parsimony ioinformatics -- lecture 9 Phylogenetic trees istance-based tree building Parsimony (,(,(,))) rees can be represented in "parenthesis notation". Each set of parentheses represents a branch-point (bifurcation),

More information

Fast Hash-Based Algorithms for Analyzing Tens of Thousands of Evolutionary Trees

Fast Hash-Based Algorithms for Analyzing Tens of Thousands of Evolutionary Trees Fast Hash-Based Algorithms for Analyzing Tens of Thousands of Evolutionary Trees Tiffani L. Williams Department of Computer Science & Engineering Texas A&M University http://faculty.cs.tamu.edu/tlw What

More information

A Phylogenetic Network Construction due to Constrained Recombination

A Phylogenetic Network Construction due to Constrained Recombination A Phylogenetic Network Construction due to Constrained Recombination Mohd. Abdul Hai Zahid Research Scholar Research Supervisors: Dr. R.C. Joshi Dr. Ankush Mittal Department of Electronics and Computer

More information

Evolution, University of Auckland, New Zealand PLEASE SCROLL DOWN FOR ARTICLE

Evolution, University of Auckland, New Zealand PLEASE SCROLL DOWN FOR ARTICLE This article was downloaded by:[university of Canterbury] On: 9 April 2008 Access Details: [subscription number 788779126] Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered

More information

Algorithms in Bioinformatics

Algorithms in Bioinformatics Algorithms in Bioinformatics Sami Khuri Department of Computer Science San José State University San José, California, USA khuri@cs.sjsu.edu www.cs.sjsu.edu/faculty/khuri Distance Methods Character Methods

More information

ALGORITHMIC STRATEGIES FOR ESTIMATING THE AMOUNT OF RETICULATION FROM A COLLECTION OF GENE TREES

ALGORITHMIC STRATEGIES FOR ESTIMATING THE AMOUNT OF RETICULATION FROM A COLLECTION OF GENE TREES ALGORITHMIC STRATEGIES FOR ESTIMATING THE AMOUNT OF RETICULATION FROM A COLLECTION OF GENE TREES H. J. Park and G. Jin and L. Nakhleh Department of Computer Science, Rice University, 6 Main Street, Houston,

More information

Spanning trees with minimum weighted degrees

Spanning trees with minimum weighted degrees Spanning trees with minimum weighted degrees Mohammad Ghodsi Hamid Mahini Kian Mirjalali Shayan Oveis Gharan Amin S. Sayedi R. Morteza Zadimoghaddam Abstract Given a metric graph G, we are concerned with

More information

Finding a gene tree in a phylogenetic network Philippe Gambette

Finding a gene tree in a phylogenetic network Philippe Gambette LRI-LIX BioInfo Seminar 19/01/2017 - Palaiseau Finding a gene tree in a phylogenetic network Philippe Gambette Outline Phylogenetic networks Classes of phylogenetic networks The Tree Containment Problem

More information

Limitations of Markov Chain Monte Carlo Algorithms for Bayesian Inference of Phylogeny

Limitations of Markov Chain Monte Carlo Algorithms for Bayesian Inference of Phylogeny Limitations of Markov Chain Monte Carlo Algorithms for Bayesian Inference of Phylogeny Elchanan Mossel Eric Vigoda July 5, 2005 Abstract Markov Chain Monte Carlo algorithms play a key role in the Bayesian

More information

Phylogenetic Networks, Trees, and Clusters

Phylogenetic Networks, Trees, and Clusters Phylogenetic Networks, Trees, and Clusters Luay Nakhleh 1 and Li-San Wang 2 1 Department of Computer Science Rice University Houston, TX 77005, USA nakhleh@cs.rice.edu 2 Department of Biology University

More information

K-center Hardness and Max-Coverage (Greedy)

K-center Hardness and Max-Coverage (Greedy) IOE 691: Approximation Algorithms Date: 01/11/2017 Lecture Notes: -center Hardness and Max-Coverage (Greedy) Instructor: Viswanath Nagarajan Scribe: Sentao Miao 1 Overview In this lecture, we will talk

More information

Workshop III: Evolutionary Genomics

Workshop III: Evolutionary Genomics Identifying Species Trees from Gene Trees Elizabeth S. Allman University of Alaska IPAM Los Angeles, CA November 17, 2011 Workshop III: Evolutionary Genomics Collaborators The work in today s talk is joint

More information

Reconstructing Trees from Subtree Weights

Reconstructing Trees from Subtree Weights Reconstructing Trees from Subtree Weights Lior Pachter David E Speyer October 7, 2003 Abstract The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree

More information

Intro to Contemporary Math

Intro to Contemporary Math Intro to Contemporary Math Hamiltonian Circuits and Nearest Neighbor Algorithm Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Hamiltonian Circuits and the Traveling Salesman

More information

Nearest Neighbor Search with Keywords

Nearest Neighbor Search with Keywords Nearest Neighbor Search with Keywords Yufei Tao KAIST June 3, 2013 In recent years, many search engines have started to support queries that combine keyword search with geography-related predicates (e.g.,

More information

Theory of Evolution Charles Darwin

Theory of Evolution Charles Darwin Theory of Evolution Charles arwin 858-59: Origin of Species 5 year voyage of H.M.S. eagle (83-36) Populations have variations. Natural Selection & Survival of the fittest: nature selects best adapted varieties

More information

On the complexity of approximate multivariate integration

On the complexity of approximate multivariate integration On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 USA ioannis.koutis@cs.cmu.edu January 11, 2005 Abstract

More information

Estimating Phylogenies (Evolutionary Trees) II. Biol4230 Thurs, March 2, 2017 Bill Pearson Jordan 6-057

Estimating Phylogenies (Evolutionary Trees) II. Biol4230 Thurs, March 2, 2017 Bill Pearson Jordan 6-057 Estimating Phylogenies (Evolutionary Trees) II Biol4230 Thurs, March 2, 2017 Bill Pearson wrp@virginia.edu 4-2818 Jordan 6-057 Tree estimation strategies: Parsimony?no model, simply count minimum number

More information

TheDisk-Covering MethodforTree Reconstruction

TheDisk-Covering MethodforTree Reconstruction TheDisk-Covering MethodforTree Reconstruction Daniel Huson PACM, Princeton University Bonn, 1998 1 Copyright (c) 2008 Daniel Huson. Permission is granted to copy, distribute and/or modify this document

More information

Pattern Popularity in 132-Avoiding Permutations

Pattern Popularity in 132-Avoiding Permutations Pattern Popularity in 132-Avoiding Permutations The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Rudolph,

More information

Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction

Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction DANIEL ŠTEFANKOVIČ 1 AND ERIC VIGODA 2 1 Department of Computer Science, University of Rochester, Rochester, New York 14627, USA; and

More information

arxiv: v1 [cs.cc] 9 Oct 2014

arxiv: v1 [cs.cc] 9 Oct 2014 Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees Leo van Iersel, Steven Kelk, Nela Lekić, Simone Linz May 7, 08 arxiv:40.7v [cs.cc] 9 Oct 04 Abstract A ternary

More information

Characterization of Fixed Points in Sequential Dynamical Systems

Characterization of Fixed Points in Sequential Dynamical Systems Characterization of Fixed Points in Sequential Dynamical Systems James M. W. Duvall Virginia Polytechnic Institute and State University Department of Mathematics Abstract Graph dynamical systems are central

More information

Algorithms for efficient phylogenetic tree construction

Algorithms for efficient phylogenetic tree construction Graduate Theses and Dissertations Graduate College 2009 Algorithms for efficient phylogenetic tree construction Mukul Subodh Bansal Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/etd

More information

Traveling Salesman Problem

Traveling Salesman Problem Traveling Salesman Problem Zdeněk Hanzálek hanzalek@fel.cvut.cz CTU in Prague April 17, 2017 Z. Hanzálek (CTU) Traveling Salesman Problem April 17, 2017 1 / 33 1 Content 2 Solved TSP instances in pictures

More information

Kei Takahashi and Masatoshi Nei

Kei Takahashi and Masatoshi Nei Efficiencies of Fast Algorithms of Phylogenetic Inference Under the Criteria of Maximum Parsimony, Minimum Evolution, and Maximum Likelihood When a Large Number of Sequences Are Used Kei Takahashi and

More information

Combinatorial Aspects of Tropical Geometry and its interactions with phylogenetics

Combinatorial Aspects of Tropical Geometry and its interactions with phylogenetics Combinatorial Aspects of Tropical Geometry and its interactions with phylogenetics María Angélica Cueto Department of Mathematics Columbia University Rabadan Lab Metting Columbia University College of

More information

Determining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments

Determining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments Determining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments Alex Beckwith Department of Mathematics, Kenyon College, Gambier, Ohio Aleesha Moran

More information