Skip to main content
bioRxiv
  • Home
  • About
  • Submit
  • ALERTS / RSS
Advanced Search
New Results

The combinatorics of discrete time-trees: theory and open problems

View ORCID ProfileAlex Gavryushkin, View ORCID ProfileChris Whidden, View ORCID ProfileFrederick A Matsen IV
doi: https://doi.org/10.1101/063362
Alex Gavryushkin
1, ETH Z, 4058 B, S :
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
  • ORCID record for Alex Gavryushkin
  • For correspondence: alex@gavruskin.com
Chris Whidden
2, F H C R C, S, WA 98109 : , :
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
  • ORCID record for Chris Whidden
  • For correspondence: cwhidden@fredhutch.org matsen@fredhutch.org
Frederick A Matsen IV
2, F H C R C, S, WA 98109 : , :
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
  • ORCID record for Frederick A Matsen IV
  • For correspondence: cwhidden@fredhutch.org matsen@fredhutch.org
  • Abstract
  • Full Text
  • Info/History
  • Metrics
  • Preview PDF
Loading

ABSTRACT

A time-tree is a rooted phylogenetic tree such that all internal nodes are equipped with absolute divergence dates and all leaf nodes are equipped with sampling dates. Such time-trees have become a central object of study in phylogenetics but little is known about the parameter space of such objects. Here we introduce and study a hierarchy of discrete approximations of the space of time-trees from the graph-theoretic and algorithmic point of view. One of the basic and widely used phylogenetic graphs, the NNI graph, is the roughest approximation and bottom level of our hierarchy. More refined approximations discretize the relative timing of evolutionary divergence and sampling dates. We study basic graph-theoretic questions for these graphs, including the size of neighborhoods, diameter upper and lower bounds, and the problem of finding shortest paths. We settle many of these questions by extending the concept of graph grammars introduced by Sleator, Tarjan, and Thurston to our graphs. Although time values greatly increase the number of possible trees, we show that 1-neighborhood sizes remain linear, allowing for efficient local exploration and construction of these graphs. We also obtain upper bounds on the r-neighborhood sizes of these graphs, including a smaller bound than was previously known for NNI.

Our results open up a number of possible directions for theoretical investigation of graph-theoretic and algorithmic properties of the time-tree graphs. We discuss the directions that are most valuable for phylogenetic applications and give a list of prominent open problems for those applications. In particular, we conjecture that the split theorem applies to shortest paths in time-tree graphs, a property not shared in the general NNI case.

Footnotes

  • AG was supported by Marsden Fund of the Royal Society of New Zealand, grant UOA1324, through the Centre for Computational Evolution, the University of Auckland, where this work has been carried out. This work was done in part while AG was visiting Fred Hutchinson Cancer Research Center.

  • CW and FM were funded by National Science Foundation awards 1223057 and 1564137.

  • CW is a Simons Foundation Fellow of the Life Sciences Research Foundation.

  • FM supported in part by a Faculty Scholar grant from the Howard Hughes Medical Institute and the Simons Foundation.

Copyright 
The copyright holder for this preprint is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC 4.0 International license.
Back to top
PreviousNext
Posted July 17, 2017.
Download PDF
Email

Thank you for your interest in spreading the word about bioRxiv.

NOTE: Your email address is requested solely to identify you as the sender of this article.

Enter multiple addresses on separate lines or separate them with commas.
The combinatorics of discrete time-trees: theory and open problems
(Your Name) has forwarded a page to you from bioRxiv
(Your Name) thought you would like to see this page from the bioRxiv website.
CAPTCHA
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
Share
The combinatorics of discrete time-trees: theory and open problems
Alex Gavryushkin, Chris Whidden, Frederick A Matsen IV
bioRxiv 063362; doi: https://doi.org/10.1101/063362
Reddit logo Twitter logo Facebook logo LinkedIn logo Mendeley logo
Citation Tools
The combinatorics of discrete time-trees: theory and open problems
Alex Gavryushkin, Chris Whidden, Frederick A Matsen IV
bioRxiv 063362; doi: https://doi.org/10.1101/063362

Citation Manager Formats

  • BibTeX
  • Bookends
  • EasyBib
  • EndNote (tagged)
  • EndNote 8 (xml)
  • Medlars
  • Mendeley
  • Papers
  • RefWorks Tagged
  • Ref Manager
  • RIS
  • Zotero
  • Tweet Widget
  • Facebook Like
  • Google Plus One

Subject Area

  • Evolutionary Biology
Subject Areas
All Articles
  • Animal Behavior and Cognition (4237)
  • Biochemistry (9153)
  • Bioengineering (6793)
  • Bioinformatics (24045)
  • Biophysics (12147)
  • Cancer Biology (9557)
  • Cell Biology (13811)
  • Clinical Trials (138)
  • Developmental Biology (7650)
  • Ecology (11726)
  • Epidemiology (2066)
  • Evolutionary Biology (15530)
  • Genetics (10661)
  • Genomics (14343)
  • Immunology (9499)
  • Microbiology (22873)
  • Molecular Biology (9113)
  • Neuroscience (49076)
  • Paleontology (357)
  • Pathology (1487)
  • Pharmacology and Toxicology (2573)
  • Physiology (3851)
  • Plant Biology (8343)
  • Scientific Communication and Education (1473)
  • Synthetic Biology (2299)
  • Systems Biology (6201)
  • Zoology (1302)