The Complexity of the uspr Distance
|
|
- Chester Holland
- 5 years ago
- Views:
Transcription
1 The omplexity of the uspr istance Maria Luisa onet Universtidad Politecnica de atalunya arcelona, Spain Published in I/M T 2010 Joint work with Katherine St. John Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
2 When are two trees similar? Nicotiana ampanula Scaevola Stokesia imorphotheca Senecio erbera azania chinops elicia Tagetes hromolaena lennosperma oreopsis Vernonia acosmia ichorium chillea arthamnus laveria Piptocarpa Helianthus Tragopogon hrysanthemum upatorium Lactuca arnadesia asyphyllum Nicotiana ampanula Scaevola Stokesia imorphotheca Senecio azania erbera chinops elicia Tagetes hromolaena lennosperma oreopsis Vernonia acosmia ichorium chillea arthamnus laveria Piptocarpa Helianthus Tragopogon hrysanthemum upatorium Lactuca arnadesia asyphyllum Phylogenies for sunflowers. ob Jansen (UT ustin). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
3 istances etween Trees Robinson-oulds distance: # of branches that occur in only one tree. alculate in O(n) time using ay s lgorithm (1985). xtends naturally to weighted trees. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
4 TR istance Tree-isection-Reconnect (TR) Move: The TR distance between two trees is the minimal number of TR moves needed to transform the first tree into the second tree. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
5 TR istance Tree-isection-Reconnect (TR): TR is NP-hard. (llen & Steel 01) Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
6 SPR istance Subtree-prune-regraft (SPR): The SPR distance between two trees is the minimal number of SPR moves needed to transform the first tree into the second tree. d T R (T 1, T 2 ) d SP R (T 1, T 2 ) Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
7 SPR istance Subtree-prune-regraft (SPR): SPR for rooted trees is NP-hard. (ordewich & Semple 05) pproximation algorithm for SPR on rooted trees (onet, St. John, menta, & Mahindru 05) (orderwich, Mcartin, Semple). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
8 Reduction Rules: Subtree Rule a a pplying Subtree Rule preserves TR distance (llen & Steel 01), SPR distance (llen &Steel 01, orderwich & Semple 04) and Hybrid number (orderwich & Semple 07). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
9 Reduction Rules: hain Rule pplying the chain Rule preserves TR distance (llen & Steel 01), rspr distance (orderwich & Semple 04) and Hybrid number (orderwich & Semple 07). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
10 $100 Problem Mike Steel posed the following questions: oes shrinking common chains preserve SPR distance? alculating SPR distance is fixed parameter tractable? alculating TR (llen & Steel 01), rspr (orderwich & Semple 04), or Hybrid Number (orderwich & Semple 07) is fixed parameter tractable. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
11 Lower ounds for Subchain Reduction Hickey et al. showed that: alculating SPR distance is NP-hard. d usp R (T1 n, T2 n ) 2 d usp R (T1 3, T2 3 ). We improve this to: d usp R (T1 n, T2 n ) 1 d usp R (T1 3, T2 3 ) Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
12 SPR distance is PT We show that uspr is fixed parameter tractable with respect to parameter k: That is, for distance k, it can be decided in p(n)f(k) time that two trees are distance k, where p is a polynomial in n, the number of leaves in the tree, and f(k) does not depend on n. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
13 Sketch: TR distance is PT Input: Pair of trees (T 1, T 2 ) and distance parameter k. Obtain (T 1, T 2) applying subtree and clain reduction. d T R (T 1, T 2 ) = d T R (T 1, T 2) unknown for SPR T 1 c.d T R (T 1, T 2 ) (lemma in llen-steel 2001) if T 1 > c.k then d T R (T 1, T 2 ) > k and return no. else check all posible k TR-moves from T 1 to T 2 and return yes or no. This can be done in time O(( T 1 2 ) k ) = O((d k) 2k ) Total time is O(k 2k p(n)). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
14 New Reduction Rule: l-hain Rule l ck l Lemma: Let T 1 and T 2 be X-trees with SPR distance k. pplying the c k-chain Rule preserves SPR distance. ck Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
15 Size of Reduced Trees Lemma: Let T 1 and T 2 be X-trees with SPR distance k. Let T 1 and T 2 be the trees obtained from T 1 and T 2 applying subtree and c k-chain Rule. Then, T 1 dk 2. Proof: if d SP R (T 1, T 2 ) k then d T R (T 1, T 2 ) k. Show that if d T R (T 1, T 2 ) k, then T 1 dk 2 as in llen-steel 2001 but with c.k-chains instead of 3-chains. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
16 Sketch: SPR distance is PT Input: Pair of trees (T 1, T 2 ) and distance parameter k. Obtain (T 1, T 2) applying subtree and ck-clain reduction. If d SP R (T 1, T 2 ) k, T 1 d k 2 and d SP R (T 1, T 2 ) = d SP R (T 1, T 2) if T 1 > d k 2 then d SP R (T 1, T 2 ) > k and return no. else check all posible k SPR-moves from T 1 to T 2 and return yes or no. This can be done in time O(( T 1 2 ) k ) = O((d k 2 ) 2k ) Total time is O(k 4k p(n)). Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
17 Idea for Improving Lower ound d usp R (T n 1, T n 2 ) 1 d usp R (T 3 1, T 3 2 ) Idea inspired from Hickey et al: treat common chains as subtrees to get 2 bound. o carefully by cases on a minimal set of moves to improve the bound to 1. Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
18 Idea for Improving Lower ound Let T 1 and T 2 X-trees with common chain 1 l and SPR dist k. We show d SP R (T 3 1, T 3 2 ) k 1 by cases. ase sketch: the minimal number of moves breaks 2 or 3 pendant edges from the 3-chain T 1 l+2... l+2 m 0 T m, m,..., m 1 2 k+1 k +1 T m T l+2 2 l+2 l+2 l+1 l+2 l+1 Maria Luisa onet, Phylogenetics follow-up Workshop, INI, June
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 informationA 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 informationExploring Treespace. Katherine St. John. Lehman College & the Graduate Center. City University of New York. 20 June 2011
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,
More informationSPR 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 informationSolving 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 informationA 3-approximation algorithm for the subtree distance between phylogenies
JID:JDA AID:228 /FLA [m3sc+; v 1.87; Prn:5/02/2008; 10:04] P.1 (1-14) Journal of Discrete Algorithms ( ) www.elsevier.com/locate/jda A 3-approximation algorithm for the subtree distance between phylogenies
More informationA 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 informationNOTE 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 informationSubtree 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 informationDepartment 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 informationMolecular 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 informationTree Space: Algorithms & Applications Part I. Megan Owen University of Waterloo
Tree Space: lgorithms & pplications Part I Megan Owen University of Waterloo Phylogenetic Trees a phylogenetic tree: GTTTGT GTTGTT GTGT GGTTGTT? 7 5 1 6 questions: how do we infer a tree from data? how
More informationAnalysis of Uninformed Search Methods
nalysis of Uninformed earch Methods rian. Williams 16.410-13 ep 21 st, 2004 lides adapted from: 6.034 Tomas Lozano Perez, Russell and Norvig IM rian Williams, Fall 04 1 ssignments Remember: Problem et
More informationOn 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 informationPolynomial kernels for constant-factor approximable problems
1 Polynomial kernels for constant-factor approximable problems Stefan Kratsch November 11, 2010 2 What do these problems have in common? Cluster Edge Deletion, Cluster Edge Editing, Edge Dominating Set,
More informationFinding 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 informationNotes 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 informationALGORITHMIC 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 informationPhylogeny. 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 informationCharles Semple, Philip Daniel, Wim Hordijk, Roderic D M Page, and Mike Steel
SUPERTREE ALGORITHMS FOR ANCESTRAL DIVERGENCE DATES AND NESTED TAXA Charles Semple, Philip Daniel, Wim Hordijk, Roderic D M Page, and Mike Steel Department of Mathematics and Statistics University of Canterbury
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationA Cubic-Vertex Kernel for Flip Consensus Tree
To appear in Algorithmica A Cubic-Vertex Kernel for Flip Consensus Tree Christian Komusiewicz Johannes Uhlmann Received: date / Accepted: date Abstract Given a bipartite graph G = (V c, V t, E) and a nonnegative
More information(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/ / MET Day 000 NC1^ INRTL MNVR I E E PRE SLEEP K PRE SLEEP R E
05//0 5:26:04 09/6/0 (259) 6 7 8 9 20 2 22 2 09/7 0 02 0 000/00 0 02 0 04 05 06 07 08 09 0 2 ay 000 ^ 0 X Y / / / / ( %/ ) 2 /0 2 ( ) ^ 4 / Y/ 2 4 5 6 7 8 9 2 X ^ X % 2 // 09/7/0 (260) ay 000 02 05//0
More informationFPT is Characterized by Useful Obstruction Sets
FPT is Characterized by Useful Obstruction Sets Bart M. P. Jansen Joint work with Michael R. Fellows, Charles Darwin Univ. June 21st 2013, WG 2013, Lübeck A NEW CHARACTERIZATION OF FPT 2 Well-Quasi-Orders
More informationarxiv: 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 informationPhysical Mapping. Restriction Mapping. Lecture 12. A physical map of a DNA tells the location of precisely defined sequences along the molecule.
Computat onal iology Lecture 12 Physical Mapping physical map of a DN tells the location of precisely defined sequences along the molecule. Restriction mapping: mapping of restriction sites of a cutting
More informationParameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints Vikram Kamat 1 and Neeldhara Misra 2 1 University of Warsaw vkamat@mimuw.edu.pl 2 Indian Institute of Science, Bangalore neeldhara@csa.iisc.ernet.in
More informationParsimony 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 informationSupertree 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 informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationReconstructing 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 informationExact Algorithms for Dominating Induced Matching Based on Graph Partition
Exact Algorithms for Dominating Induced Matching Based on Graph Partition Mingyu Xiao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731,
More informationParameterized Domination in Circle Graphs
Parameterized Domination in Circle Graphs Nicolas Bousquet 1, Daniel Gonçalves 1, George B. Mertzios 2, Christophe Paul 1, Ignasi Sau 1, and Stéphan Thomassé 3 1 AlGCo project-team, CNRS, LIRMM, Montpellier,
More informationModern Phylogenetics. An Introduction to Phylogenetics. Phylogenetics and Systematics. Phylogenetic Tree of Whales
Modern Phylogenetics n Introduction to Phylogenetics ret Larget larget@stat.wisc.edu epartments of otany and of Statistics University of Wisconsin Madison January 27, 2010 Phylogenies are usually estimated
More informationChapter 3: Phylogenetics
Chapter 3: Phylogenetics 3. Computing Phylogeny Prof. Yechiam Yemini (YY) Computer Science epartment Columbia niversity Overview Computing trees istance-based techniques Maximal Parsimony (MP) techniques
More informationTree of Life iological Sequence nalysis Chapter http://tolweb.org/tree/ Phylogenetic Prediction ll organisms on Earth have a common ancestor. ll species are related. The relationship is called a phylogeny
More informationCS 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 informationarxiv: 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 informationLecture 2 September 4, 2014
CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 2 September 4, 2014 Scribe: David Liu 1 Overview In the last lecture we introduced the word RAM model and covered veb trees to solve the
More informationInference in Graphical Models Variable Elimination and Message Passing Algorithm
Inference in Graphical Models Variable Elimination and Message Passing lgorithm Le Song Machine Learning II: dvanced Topics SE 8803ML, Spring 2012 onditional Independence ssumptions Local Markov ssumption
More informationarxiv: 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 informationLecture 6 January 15, 2014
Advanced Graph Algorithms Jan-Apr 2014 Lecture 6 January 15, 2014 Lecturer: Saket Sourah Scrie: Prafullkumar P Tale 1 Overview In the last lecture we defined simple tree decomposition and stated that for
More informationJoin Ordering. 3. Join Ordering
3. Join Ordering Basics Search Space Greedy Heuristics IKKBZ MVP Dynamic Programming Generating Permutations Transformative Approaches Randomized Approaches Metaheuristics Iterative Dynamic Programming
More informationLet S be a set of n species. A phylogeny is a rooted tree with n leaves, each of which is uniquely
JOURNAL OF COMPUTATIONAL BIOLOGY Volume 8, Number 1, 2001 Mary Ann Liebert, Inc. Pp. 69 78 Perfect Phylogenetic Networks with Recombination LUSHENG WANG, 1 KAIZHONG ZHANG, 2 and LOUXIN ZHANG 3 ABSTRACT
More informationVariable Elimination: Basic Ideas
Variable Elimination: asic Ideas Sargur srihari@cedar.buffalo.edu 1 Topics 1. Types of Inference lgorithms 2. Variable Elimination: the asic ideas 3. Variable Elimination Sum-Product VE lgorithm Sum-Product
More informationEfficiency 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 informationarxiv: 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 informationCherry picking: a characterization of the temporal hybridization number for a set of phylogenies
Bulletin of Mathematical Biology manuscript No. (will be inserted by the editor) Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies Peter J. Humphries Simone
More informationClassification of Join Ordering Problems
Classification of Join Ordering Problems We distinguish four different dimensions: 1. query graph class: chain, cycle, star, and clique 2. join tree structure: left-deep, zig-zag, or bushy trees 3. join
More informationA Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback
A Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback Vincent Y. F. Tan (NUS) Joint work with Silas L. Fong (Toronto) 2017 Information Theory Workshop, Kaohsiung,
More informationPhylogenetic 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 informationTree-width and algorithms
Tree-width and algorithms Zdeněk Dvořák September 14, 2015 1 Algorithmic applications of tree-width Many problems that are hard in general become easy on trees. For example, consider the problem of finding
More informationTHE 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 informationON THE UNIQUENESS OF BALANCED MINIMUM EVOLUTION
ON THE UNIQUENESS OF LNE MINIMUM EVOLUTION RON KLEINMN ecember 3, 20 bstract. Minimum evolution is a class of parsimonious distance-based phylogenetic reconstruction methods. One noteworthy example is
More informationThe Budgeted Unique Coverage Problem and Color-Coding (Extended Abstract)
The Budgeted Unique Coverage Problem and Color-Coding (Extended Abstract) Neeldhara Misra 1, Venkatesh Raman 1, Saket Saurabh 2, and Somnath Sikdar 1 1 The Institute of Mathematical Sciences, Chennai,
More informationProperties 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 informationMaximum 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 informationThe essential numerical range and the Olsen problem
The essential numerical range and the Olsen problem Lille, 2010 Definition Let H be a Hilbert space, T B(H). The numerical range of T is the set W (T ) = { Tx, x : x H, x = 1}. Definition Let H be a Hilbert
More informationUNICYCLIC 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 informationIntractable Problems Part Two
Intractable Problems Part Two Announcements Problem Set Five graded; will be returned at the end of lecture. Extra office hours today after lecture from 4PM 6PM in Clark S250. Reminder: Final project goes
More informationB x1. Voronoi Tessellation, Decision Surfaces
Voronoi Tessellation, ecision Surfaces Lecture 2: lassification I Sam Roweis or continuous inputs, we can view the problem as one of segmenting the input space into regions which belong to a single class,
More informationSearch and Lookahead. Bernhard Nebel, Julien Hué, and Stefan Wölfl. June 4/6, 2012
Search and Lookahead Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 4/6, 2012 Search and Lookahead Enforcing consistency is one way of solving constraint networks:
More informationNotes for Lecture 27
U.C. Berkeley CS276: Cryptography Handout N27 Luca Trevisan April 30, 2009 Notes for Lecture 27 Scribed by Madhur Tulsiani, posted May 16, 2009 Summary In this lecture we begin the construction and analysis
More informationPhylogeny. 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 informationEfficient discovery of the top-k optimal dependency rules with Fisher s exact test of significance
Efficient discovery of the top-k optimal dependency rules with Fisher s exact test of significance Wilhelmiina Hämäläinen epartment of omputer Science University of Helsinki Finland whamalai@cs.helsinki.fi
More informationWorkshop 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 informationCOMPSCI 276 Fall 2007
Exact Inference lgorithms for Probabilistic Reasoning; OMPSI 276 Fall 2007 1 elief Updating Smoking lung ancer ronchitis X-ray Dyspnoea P lung cancer=yes smoking=no, dyspnoea=yes =? 2 Probabilistic Inference
More informationCS5238 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 informationB x1. Voronoi Tessellation, Decision Surfaces
Voronoi Tessellation, ecision Surfaces Lecture 2: lassification I Sam Roweis or continuous inputs, we can view the problem as one of segmenting the input space into regions which belong to a single class,
More informationRECOVERING A PHYLOGENETIC TREE USING PAIRWISE CLOSURE OPERATIONS
RECOVERING A PHYLOGENETIC TREE USING PAIRWISE CLOSURE OPERATIONS KT Huber, V Moulton, C Semple, and M Steel Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch,
More informationA 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 informationSearch Algorithms. Analysis of Algorithms. John Reif, Ph.D. Prepared by
Search Algorithms Analysis of Algorithms Prepared by John Reif, Ph.D. Search Algorithms a) Binary Search: average case b) Interpolation Search c) Unbounded Search (Advanced material) Readings Reading Selection:
More informationConsistency algorithms
Consistency algorithms Chapter SQ 00 rc-consistency X, Y, Z, T X Y Y = Z T Z X T X,, Y,,,,,, T = Z SQ 00 rc-consistency X, Y, Z, T X Y Y = Z T Z X T X T Y Z = SQ 00 rc-consistency Sound < < Incomplete
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More informationI can use properties of similar triangles to find segment lengths. I can apply proportionality and triangle angle bisector theorems.
Page! 1 of! 8 Attendance Problems. Solve each proportion. 12 1. 2. 3. 15 = AB 9.5 20 QR = 3.8 4.2 x 5 20 = x + 3 30 4.! y + 7 2y 4 = 3.5 2.8 I can use properties of similar triangles to find segment lengths.
More informationA fast algorithm to generate necklaces with xed content
Theoretical Computer Science 301 (003) 477 489 www.elsevier.com/locate/tcs Note A fast algorithm to generate necklaces with xed content Joe Sawada 1 Department of Computer Science, University of Toronto,
More informationTractable Approximations of Graph Isomorphism.
Tractable Approximations of Graph Isomorphism. Anuj Dawar University of Cambridge Computer Laboratory visiting RWTH Aachen joint work with Bjarki Holm Darmstadt, 5 February 2014 Graph Isomorphism Graph
More informationSTABILITY ANALYSIS AND CONTROL DESIGN
STABILITY ANALYSIS AND CONTROL DESIGN WITH IMPACTS AND FRICTION Michael Posa Massachusetts Institute of Technology Collaboration with Mark Tobenkin and Russ Tedrake ICRA Workshop on Robust Optimization-Based
More informationKernelization Lower Bounds: A Brief History
Kernelization Lower Bounds: A Brief History G Philip Max Planck Institute for Informatics, Saarbrücken, Germany New Developments in Exact Algorithms and Lower Bounds. Pre-FSTTCS 2014 Workshop, IIT Delhi
More informationPhylogenetics. 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 informationTheDisk-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 informationLecture 9 : Identifiability of Markov Models
Lecture 9 : Identifiability of Markov Models MATH285K - Spring 2010 Lecturer: Sebastien Roch References: [SS03, Chapter 8]. Previous class THM 9.1 (Uniqueness of tree metric representation) Let δ be a
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
More informationComputational Complexity and Intractability: An Introduction to the Theory of NP. Chapter 9
1 Computational Complexity and Intractability: An Introduction to the Theory of NP Chapter 9 2 Objectives Classify problems as tractable or intractable Define decision problems Define the class P Define
More informationClustering Perturbation Resilient
Clustering Perturbation Resilient Instances Maria-Florina Balcan Carnegie Mellon University Clustering Comes Up Everywhere Clustering news articles or web pages or search results by topic. Clustering protein
More information9/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 informationExact Algorithms and Experiments for Hierarchical Tree Clustering
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10) Exact Algorithms and Experiments for Hierarchical Tree Clustering Jiong Guo Universität des Saarlandes jguo@mmci.uni-saarland.de
More informationNotes for Lecture 21
U.C. Berkeley CS170: Intro to CS Theory Handout N21 Professor Luca Trevisan November 20, 2001 Notes for Lecture 21 1 Tractable and Intractable Problems So far, almost all of the problems that we have studied
More informationPitfalls 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 informationC4.5 - pruning decision trees
C4.5 - pruning decision trees Quiz 1 Quiz 1 Q: Is a tree with only pure leafs always the best classifier you can have? A: No. Quiz 1 Q: Is a tree with only pure leafs always the best classifier you can
More informationThe 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 informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationNP-Complete problems
NP-Complete problems NP-complete problems (NPC): A subset of NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial time solution. NP-complete languages
More informationConsistency Index (CI)
Consistency Index (CI) minimum number of changes divided by the number required on the tree. CI=1 if there is no homoplasy negatively correlated with the number of species sampled Retention Index (RI)
More informationParametrizing Above Guaranteed Values: MaxSat. and MaxCut. Meena Mahajan and Venkatesh Raman. The Institute of Mathematical Sciences,
ECCC TR97-033 FTP: WWW: Email: ftp.eccc.uni-trier.de:/pub/eccc/ http://www.eccc.uni-trier.de/eccc/ ftpmail@ftp.eccc.uni-trier.de with subject help eccc Parametrizing Above Guaranteed Values: MaxSat and
More informationCS Lecture 28 P, NP, and NP-Completeness. Fall 2008
CS 301 - Lecture 28 P, NP, and NP-Completeness Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata Equivalence of
More informationComponent structure of the vacant set induced by a random walk on a random graph. Colin Cooper (KCL) Alan Frieze (CMU)
Component structure of the vacant set induced by a random walk on a random graph Colin Cooper (KCL) Alan Frieze (CMU) Vacant set definition and results Introduction: random walks and cover time G n,p vacant
More informationChordal structure in computer algebra: Permanents
Chordal structure in computer algebra: Permanents Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint
More informationAlgorithms 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