Distance-based Phylogenetic Methods Near a Polytomy
|
|
- Ira Gilmore
- 6 years ago
- Views:
Transcription
1 Distance-based Phylogenetic Methods Near a Polytomy Ruth Davidson and Seth Sullivant NCSU UIUC May 21, 2014
2 2 Phylogenetic trees model the common evolutionary history of a group of species Leaves = extant species from which we gather data (such as DNA sequences) Distance-based methods are one type of phylogenetic inference : Internal nodes = ancestral species inferred from data Least-Squares Phylogeny (LSP): NP-Hard UPGMA algorithm: O(n 2 ) Neighbor-Joining (NJ) algorithm: O(n 3 ) UPGMA and NJ are fundamental examples of distance-based algorithms and heuristics for LSP
3 3 Why study distance-based methods? Understand how well distance-based algorithms perform as polynomial-time heuristics for hard optimization problems Mathematical properties of input and output spaces give principled insight for design of phylogenetic methods Components of "divide-and-conquer" meta-methods for phylogeny estimation Associated to interesting geometry problems
4 4 Distance-based methods: inputs D vs. outputs d A dissimilarity map D on [n] = {1, 2,..., n} satisfies D(x, y) = D(y, x) for all {x, y} [n], and D(x, x) = 0. Pairwise path distances in a weighted tree induce a tree metric d on the leaves. D = 1, 2 1, 3 2, 3 (1, 3, 5) UPGMA 1, 2 1, 3 2, 3 d = (1, 4, 4) A distance-based method induces a partition of R (n 2) indexed by the combinatorial tree realizing the output of method. UPGMA and NJ send D to d according to linear inequalities, inducing a polyhedral subdivision.
5 UPGMA algorithm (Sokal and Michener) Step 1: Choose i, j minimizing D i,j, identify {i, j} as a single node, update distances D(1) given by D(1) (i,j),k = 1 2 (D i,k+d j,k ), D(1) l,m = D l,m if {l, m} {i, j} = D(1) (1,2),3 = 1 2 (D 1,3 + D 2,3 ) = 1 (3 + 5) = 4 2 D = 1, 2 1, 3 2, 3 (1, 3, 5) D(1) = (1, 2), 3 4 Step k: Choose A, B [n] minimizing D(k 1) A,B, identify A B as a single node, update distances D(k) given by D(k) (A B),C = A A + B D(k 1) A,C + B A + B D(k 1) B,C
6 6 D = UPGMA inputs and outputs in R (3 2) 1, 2 1, 3 2, 3 (1, 3, 5) 0 1, 2 1, 3 2, 3 d = (1, 4, 4) Polyhedral fan of equidistant tree metrics on [3] R (3 2) 0.
7 7 Distance-based algorithms are a heuristic for LSP Problem (Least-Squares Phylogeny). Given D R (n 2), minimize D d 2 subject to d a tree metric. Theorem (Day, 1987). LSP is NP-Hard. Theorem (Atteson, 1999). Let d be a tree metric such that the shortest edge length in a binary tree representation of d is w > 0. Suppose D R (n 2) satisfies D d < w/2. Then NJ (D) = ˆd, where ˆd and d are realized by trees with the same shape. What if we allow an edge weight to be zero? In a neighborhood of a tree metric with a polytomy, or unresolved vertex, will a distance-based algorithm choose the best tree shape?
8 Tritomy Tree Metrics A tritomy tree metric is a point at the intersection of 3 maximal cones in the fan of tree metrics with three binary resolutions. For n > 3, tritomies live at intersection of 3 maximal cones which share a common set K of extreme rays and each possess one unique ray r. Projections of the unique rays onto Span(K ) form a 1-dimensional fan spanning a 2-dimensional plane. LSP region ratios in the plane LSP region ratios in R (n 2) 0.
9 Formulae for Angles Between Tritomy Tree Cones Let a = A, b = B, c = C, and d = D. Theorem (D -Sullivant). The angle between the AC B tree and the ( BC A tree is ) c arccos. (a + c)(b + c) Theorem (D-Sullivant). The angle between the AC BD and AD BC trees is ( ) ab + cd arccos. (a + c)(b + c)(a + d)(b + d)
10 10 Geometry of the input space near a tritomy Theorem (D-Sullivant). The geometry of UPGMA (red) and LSP regions (blue) near a tritomy depends only on subtree sizes. UPGMA poorly approximates LSP in some cases. c a b a b c a b c d. LSP boundaries = angle bisectors. UPGMA boundaries = reflected tree rays.
11 1 Simulations show NJ regions depend on tree shape NJ and LSP near d 1 and d 2 Resolution LSP NJ : d 1 NJ: d 2 AB CD AC BD AD BC Percentages generated by running NJ on points sampled uniformly on small spheres around d 1 and d 2.
12 12 Summary and future work The polyhedral geometry of LSP and UPGMA regions near a tritomy depends only on the subclade sizes for the tritomy. Near tritomies, UPGMA and NJ often poorly match LSP. Size of NJ regions near a tritomy depends on the branching structure of the associated tree. What is the geometry of LSP, UPGMA, and NJ regions near higher-degree polytomies? Study decomposition of R (n 2) induced by BIONJ.
13 13 Thanks! www4.ncsu.edu/ redavids K. Atteson. The performance of the NJ method of phylogeny reconstruction. Algorithmica 25 (1999): W.M. Bruno, N.D. Socci, and A.L. Halpern. Weighted Neighbor Joining: a likelihood-based approach to distance- based phylogeny reconstruction. Molecular Biology and Evolution 17 (2000): R. Davidson and S. Sullivant. Distance-based phylogenetic methods around a polytomy. To appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics arxiv: R. Davidson and S. Sullivant. Polyhedral combinatorics of UPGMA cones. Advances in Applied Mathematics 50 (2013), no. 2: W. Day. Computational complexity of inferring phylogenies from dissimilarity matrices. Bulletin of Mathematical Biology. 49 (1987): O. Gascuel. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Molecular Biology and Evolution 14 (1997): N. Saitou and M. Nei. The neighbor joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 (1987), no. 4: R.R. Sokal and C. Michener. A statistical method for evaluating systematic relationships. University of Kansas Science Bulletin 38 (1958):
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 informationof the Balanced Minimum Evolution Polytope Ruriko Yoshida
Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope Ruriko Yoshida Figure 19.1 Genomes 3 ( Garland Science 2007) Origins of Species Tree (or web) of life eukarya
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 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 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 informationLecture 20: Clustering and Evolution
Lecture 20: Clustering and Evolution Study Chapter 10.4 10.8 11/12/2013 Comp 465 Fall 2013 1 Clique Graphs A clique is a graph where every vertex is connected via an edge to every other vertex A clique
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 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 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 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 informationAlgorithms for Computing Cluster Dissimilarity between Rooted Phylogenetic
Send Orders for Reprints to reprints@benthamscience.ae 8 The Open Cybernetics & Systemics Journal, 05, 9, 8-3 Open Access Algorithms for Computing Cluster Dissimilarity between Rooted Phylogenetic Trees
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 informationChapter 6.1 Medians. Geometry
Chapter 6.1 Medians Identify medians of triangles Find the midpoint of a line using a compass. A median is a segment that joins a vertex of the triangle and the midpoint of the opposite side. Median AD
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 informationCLC Phylogeny Module User manual
CLC Phylogeny Module User manual User manual for Phylogeny Module 1.0 Windows, Mac OS X and Linux September 13, 2013 This software is for research purposes only. CLC bio Silkeborgvej 2 Prismet DK-8000
More informationno triangle can have more than one right angle or obtuse angle.
Congruence Theorems in Action Isosceles Triangle Theorems.3 Learning Goals In this lesson, you will: Prove the Isosceles Triangle Base Theorem. Prove the Isosceles Triangle Vertex Angle Theorem. Prove
More informationUnit 1 Geometric Fundamentals
Honors Geometry Unit 1 Geometric Fundamentals Date Target Assignment Done! R 8-17 1.1a 1.1a Worksheet F 8-18 1.1b Pre-Assessment / 1.1b Worksheet M 8-21 1.1 1.2a Worksheet T 8-22 1.2a 1.2b Worksheet W
More informationGeometry - Chapter 1 - Corrective #1
Class: Date: Geometry - Chapter 1 - Corrective #1 Short Answer 1. Sketch a figure that shows two coplanar lines that do not intersect, but one of the lines is the intersection of two planes. 2. Name two
More informationThe combinatorics of CAT(0) cube complexes
The combinatorics of CAT() cube complexes (and moving discrete robots efficiently) Federico Ardila M. San Francisco State University, San Francisco, California. Universidad de Los Andes, Bogotá, Colombia.
More informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
More informationGeometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies
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 informationDownloaded from Class XI Chapter 12 Introduction to Three Dimensional Geometry Maths
A point is on the axis. What are its coordinates and coordinates? If a point is on the axis, then its coordinates and coordinates are zero. A point is in the XZplane. What can you say about its coordinate?
More informationGEOMETRY HONORS COORDINATE GEOMETRY PACKET
GEOMETRY HONORS COORDINATE GEOMETRY PACKET Name Period 1 Day 1 - Directed Line Segments DO NOW Distance formula 1 2 1 2 2 2 D x x y y Midpoint formula x x, y y 2 2 M 1 2 1 2 Slope formula y y m x x 2 1
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 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 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 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 informationYOU TRY NOW! 1. Draw and label 3 points that are collinear. Annotate Here Other Vocab: Postulate: Statement that is accepted to be true without proof.
2015-2016 Geometry 1.1 Geometry Essentials (Vocabulary) Target 1 Demonstrate knowledge of core definitions include: point, line, segment, ray, plane, angle, etc. Vocabulary (space provided to draw and
More informationLesson 2: Basic Concepts of Geometry
: Basic Concepts of Geometry Learning Target I can identify the difference between a figure notation and its measurements I can list collinear and non collinear points I can find the distance / length
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 informationAngle Bisectors in a Triangle- Teacher
Angle Bisectors in a Triangle- Teacher Concepts Relationship between an angle bisector and the arms of the angle Applying the Angle Bisector Theorem and its converse Materials TI-Nspire Math and Science
More informationGrade 9 Math Terminology
Unit 1 Basic Skills Review BEDMAS a way of remembering order of operations: Brackets, Exponents, Division, Multiplication, Addition, Subtraction Collect like terms gather all like terms and simplify as
More informationNote: Definitions are always reversible (converse is true) but postulates and theorems are not necessarily reversible.
Honors Math 2 Deductive ing and Two-Column Proofs Name: Date: Deductive reasoning is a system of thought in which conclusions are justified by means of previously assumed or proven statements. Every deductive
More informationMath 7 Glossary Terms
Math 7 Glossary Terms Absolute Value Absolute value is the distance, or number of units, a number is from zero. Distance is always a positive value; therefore, absolute value is always a positive value.
More informationDEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
More informationCONSTRUCTIONS Introduction Division of a Line Segment
216 MATHEMATICS CONSTRUCTIONS 11 111 Introduction In Class IX, you have done certain constructions using a straight edge (ruler) and a compass, eg, bisecting an angle, drawing the perpendicular bisector
More informationGeometry HR Date: 2/13/2013 ID Check 2nd Objective: SWBAT identify and use perpendicular and angle bisectors in triangles.
Geometry HR Date: 2/13/2013 ID Check 2nd Objective: SWBAT identify and use perpendicular and angle bisectors in triangles. Bell Ringer: 5 minute check 4.6/4.7 10 minutes HW Requests: Quadratics WS 2 nd
More informationPHYLOGENETIC RECONSTRUCTION methods attempt to find the evolutionary history of a given set of extant
JOURNAL OF COMPUTATIONAL BIOLOGY Volume 14, Number 1, 2007 c Mary Ann Liebert, Inc. Pp. 1 15 DOI: 10.1089/cmb.2006.0115 Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances ILAN GRONAU
More informationNeighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper nodes assignment.
Neighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper nodes assignment. Piotr Płoński 1ξ, Jan P. Radomski 2ξ 1 Institute of Radioelectronics, Warsaw University of Technology,
More informationarxiv: v1 [math.gr] 19 Dec 2018
GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V
More informationTerm: description named by notation (symbols) sketch an example. The intersection of two lines is a. Any determine a line.
Term: description named by notation (symbols) sketch an example point line plane Collinear points Examples: Non-collinear points Examples: Coplanar: Examples: Non-coplanar: Examples: The intersection of
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More information2-1 Transformations and Rigid Motions. ENGAGE 1 ~ Introducing Transformations REFLECT
2-1 Transformations and Rigid Motions Essential question: How do you identify transformations that are rigid motions? ENGAGE 1 ~ Introducing Transformations A transformation is a function that changes
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 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 informationIn what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.
Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery
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 informationGEOMETRY By Murney R. Bell
Hayes AM109R Mastering the Standards GEOMETRY By Murney R. Bell Grade 7 + Mastering the Standards Geometry By Murney R. Bell Illustrated by Reneé Yates Copyright 2008, Hayes School Publishing Co., Inc.,
More informationCLUSTERING IN BIOINFORMATICS
CLUSTERING IN BIOINFORMATICS CSE/BIMM/BENG 8 MAY 4, 0 OVERVIEW Define the clustering problem Motivation: gene expression and microarrays Types of clustering Clustering algorithms Other applications of
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 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 informationin interleaved format. The same data set in sequential format:
PHYML user's guide Introduction PHYML is a software implementing a new method for building phylogenies from sequences using maximum likelihood. The executables can be downloaded at: http://www.lirmm.fr/~guindon/phyml.html.
More informationMath 311. Trees Name: A Candel CSUN Math
1. A simple path in a graph is a path with no repeated edges. A simple circuit is a circuit without repeated edges. 2. Trees are special kinds of graphs. A tree is a connected graph with no simple circuits.
More informationComputing the All-Pairs Quartet Distance on a set of Evolutionary Trees
Journal of Bioinformatics and Computational Biology c Imperial College Press Computing the All-Pairs Quartet Distance on a set of Evolutionary Trees M. Stissing, T. Mailund, C. N. S. Pedersen and G. S.
More informationWriting Linear Equations
Complete ALL problems. Show your work. Check your answers on the back page! Writing Linear Equations Write the slope-intercept form of the equation of each line. 1. 3x 2y = 16 2. 4x y = 1 3. 6x + 5y =
More informationGeometry Pre AP Graphing Linear Equations
Geometry Pre AP Graphing Linear Equations Name Date Period Find the x- and y-intercepts and slope of each equation. 1. y = -x 2. x + 3y = 6 3. x = 2 4. y = 0 5. y = 2x - 9 6. 18x 42 y = 210 Graph each
More informationMrs. Daniel s Geometry Vocab List
Mrs. Daniel s Geometry Vocab List Geometry Definition: a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. Reflectional Symmetry
More informationAvailable online at Reconstructing Trees from Subtree Weights
Available online at www.sciencedirect.com ]~LSEVIER Applied Mathematics Letters 17 (2004) 615-621 Applied Mathematics Letters www.elsevier, com/loeat e/aml Reconstructing Trees from Subtree Weights L.
More informationFor all questions, E. NOTA means none of the above answers is correct. Diagrams are NOT drawn to scale.
For all questions, means none of the above answers is correct. Diagrams are NOT drawn to scale.. In the diagram, given m = 57, m = (x+ ), m = (4x 5). Find the degree measure of the smallest angle. 5. The
More informationIndiana State Math Contest Geometry
Indiana State Math Contest 018 Geometry This test was prepared by faculty at Indiana University - Purdue University Columbus Do not open this test booklet until you have been advised to do so by the test
More information7-4 Applying Properties of Similar Triangles 7-4. Warm Up Lesson Presentation Lesson Quiz. Holt McDougal Geometry
7-4 Applying Properties of Similar Triangles Warm Up Lesson Presentation Lesson Quiz Geometry Warm Up Solve each proportion. 1. AB = 16 2. QR = 10.5 3. x = 21 4. y = 8 Objectives Use properties of similar
More informationMath Interim Mini-Tests. 3rd Grade Mini-Tests
3rd Grade Mini-Tests Mini-Test Name Availability Area of Plane Figures-01 Gr 3_Model, Reason, & Solve Problems-04 Multiplicative Properties & Factors-01 Patterns & Using the Four Operations-01 Real-World
More information3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :
3. Voronoi Diagrams Examples : 1. Fire Observation Towers Imagine a vast forest containing a number of fire observation towers. Each ranger is responsible for extinguishing any fire closer to her tower
More informationCalculus With Analytic Geometry by SM. Yusaf & Prof.Muhammad Amin CHAPTER # 08 ANALYTIC GEOMETRY OF THREE DIMENSONS. Exercise #8.1
CHAPTER # 08 ANALYTIC GEOMETRY OF THREE DIMENSONS Exercise #8.1 Show that the three given points are the vertices of a right triangle, or the vertices of an isosceles triangle, or both. Q#: A 1, 5, 0,
More informationIntroduction to. Graph Theory. Second Edition. Douglas B. West. University of Illinois Urbana. ftentice iiilil PRENTICE HALL
Introduction to Graph Theory Second Edition Douglas B. West University of Illinois Urbana ftentice iiilil PRENTICE HALL Upper Saddle River, NJ 07458 Contents Preface xi Chapter 1 Fundamental Concepts 1
More informationMathematics For Class IX Lines and Angles
Mathematics For Class IX Lines and Angles (Q.1) In Fig, lines PQ and RS intersect each other at point O. If, find angle POR and angle ROQ (1 Marks) (Q.2) An exterior angle of a triangle is 110 and one
More informationPrentice Hall Pre-Algebra (c) 2007 Correlated to: WYOMING MATHEMATICS CONTENT AND PERFORMANCE STANDARDS (Grade 8)
GRADE 8 1. NUMBER OPERATIONS AND CONCEPTS Students use numbers, number sense, and number relationships in a problemsolving situation. 1. Students represent and apply numbers in a variety of equivalent
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
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 informationGeometry IB Date: 2/18/2013 ID Check Objective: Students will identify and use medians and altitudes in triangles. Bell Ringer: Complete Constructions
Geometry IB Date: 2/18/2013 ID Check Objective: Students will identify and use medians and altitudes in triangles. Bell Ringer: Complete Constructions HW Requests: pg 327 #17-25 odds 45, 46, pg 338 #11,
More informationGeometry 5-1 Bisector of Triangles- Live lesson
Geometry 5-1 Bisector of Triangles- Live lesson Draw a Line Segment Bisector: Draw an Angle Bisectors: Perpendicular Bisector A perpendicular bisector is a line, segment, or ray that is perpendicular to
More informationDistance Methods. "PRINCIPLES OF PHYLOGENETICS" Spring 2006
Integrative Biology 200A University of California, Berkeley "PRINCIPLES OF PHYLOGENETICS" Spring 2006 Distance Methods Due at the end of class: - Distance matrices and trees for two different distance
More informationGeometry Notes Chapter 4: Triangles
Geometry Notes Chapter 4: Triangles Name Date Assignment Questions I have Day 1 Section 4.1: Triangle Sum, Exterior Angles, and Classifying Triangles Day 2 Assign: Finish Ch. 3 Review Sheet, WS 4.1 Section
More informationChapter 7 Coordinate Geometry
Chapter 7 Coordinate Geometry 1 Mark Questions 1. Where do these following points lie (0, 3), (0, 8), (0, 6), (0, 4) A. Given points (0, 3), (0, 8), (0, 6), (0, 4) The x coordinates of each point is zero.
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 informationI can position figures in the coordinate plane for use in coordinate proofs. I can prove geometric concepts by using coordinate proof.
Page 1 of 14 Attendance Problems. 1. Find the midpoint between (0, x) and (y, z).. One leg of a right triangle has length 1, and the hypotenuse has length 13. What is the length of the other leg? 3. Find
More informationLeast Common Ancestor Based Method for Efficiently Constructing Rooted Supertrees
Least ommon ncestor ased Method for fficiently onstructing Rooted Supertrees M.. Hai Zahid, nkush Mittal, R.. Joshi epartment of lectronics and omputer ngineering, IIT-Roorkee Roorkee, Uttaranchal, INI
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 informationUnit 1 Geometric Fundamentals Target 1: Geometry Essentials Target 2: Determine the length, midpoint, and ratios of segments
Unit 1 Geometric Fundamentals Target 1: Essentials Target 2: Determine the length, midpoint, and ratios of segments Name Date Target Assignment Done! R 8-18 1.1a 1.1a Worksheet F 8-19 1.1b Pre-Assessment
More informationGeometry Vocabulary Math Fundamentals Reference Sheet Page 1
Math Fundamentals Reference Sheet Page 1 Acute Angle An angle whose measure is between 0 and 90 Acute Triangle A that has all acute Adjacent Alternate Interior Angle Two coplanar with a common vertex and
More informationDISCOVERING CONICS WITH. Dr Toh Pee Choon NIE 2 June 2016
DISCOVERING CONICS WITH Dr Toh Pee Choon MTC @ NIE 2 June 2016 Introduction GeoGebra is a dynamic mathematics software that integrates both geometry and algebra Open source and free to download www.geogebra.org
More informationPage 1 of 32. Website: Mobile:
Exercise 7.1 Question 1: Find the distance between the following pairs of points: (i) (2, 3), (4, 1) (ii) ( 5, 7), ( 1, 3) (iii) (a, b), ( a, b) (i) Distance between the two points is given by (ii) Distance
More informationScope and Sequence for the New Jersey Core Curriculum Content Standards
Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators
More information