David Kainer

Dr. David Kainer


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2014 in BMC Ecology and Evolution
Verified
Journal Article
Open access
PDF file
RLRobert Lanfear
Robert Lanfear
BCBrett Calcott
Brett Calcott
DKDavid Kainer
David Kainer
CMChristoph Mayer
Christoph Mayer
ASAlexandros Stamatakis
Alexandros Stamatakis
Partitioning involves estimating independent models of molecular evolution for different subsets of sites in a sequence alignment, and has been shown to improve phylogenetic inference. Current methods for estimating best-fit partitioning schemes, however, are only computationally feasible with datasets of fewer than 100 loci. This is a problem because datasets with thousands of loci are increasingly common in phylogenetics.

1 March 2017 in Trends in Biotechnology
Verified
Journal Article
Closed access
RMRitesh Mewalal
Ritesh Mewalal
DRDurgesh K. Rai
Durgesh K. Rai
DKDavid Kainer
David Kainer
FCFeng Chen
Feng Chen
CKCarsten Külheim
Carsten Külheim
GTGerald A. Tuskan
Gerald A. Tuskan

6 February 2015 in Molecular Biology and Evolution
Verified
Journal Article
Closed access
PDF file
DKDavid Kainer
David Kainer
RLRobert Lanfear
Robert Lanfear
Partitioning is a commonly used method in phylogenetics that aims to accommodate variation in substitution patterns among sites. Despite its popularity, there have been few systematic studies of its effects on phylogenetic inference, and there have been no studies that compare the effects of different approaches to partitioning across many empirical datasets. In this study, we applied four commonly-used approaches to partitioning to each of 34 empirical datasets, and then compared the resulting tree topologies, branch-lengths, and bootstrap support estimated using each approach. We find that the choice of partitioning scheme often affects tree topology, particularly when partitioning is omitted. Most notably, we find occasional instances where the use of a sub-optimal partitioning scheme produces highly supported but incorrect nodes in the tree. Branch-lengths and bootstrap support are also affected by the choice of partitioning scheme, sometimes dramatically so. We discuss the reasons for these effects and make some suggestions for best practice.

29 December 2018 in BMC Genomics
Verified
Journal Article
Open access
PDF file
WWWeiwen Wang
Weiwen Wang
MSMiriam Schalamun
Miriam Schalamun
AMAlejandro Morales-Suarez
Alejandro Morales-Suarez
DKDavid Kainer
David Kainer
BSBenjamin Schwessinger
Benjamin Schwessinger
RLRobert Lanfear
Robert Lanfear
Chloroplasts are organelles that conduct photosynthesis in plant and algal cells. The information chloroplast genome contained is widely used in agriculture and studies of evolution and ecology. Correctly assembling chloroplast genomes can be challenging because the chloroplast genome contains a pair of long inverted repeats (10–30 kb). Typically, it is simply assumed that the gross structure of the chloroplast genome matches the most commonly observed structure of two single-copy regions separated by a pair of inverted repeats. The advent of long-read sequencing technologies should remove the need to make this assumption by providing sufficient information to completely span the inverted repeat regions. Yet, long-reads tend to have higher error rates than short-reads, and relatively little is known about the best way to combine long- and short-reads to obtain the most accurate chloroplast genome assemblies. Using Eucalyptus pauciflora, the snow gum, as a test case, we evaluated the effect of multiple parameters, such as different coverage of long-(Oxford nanopore) and short-(Illumina) reads, different long-read lengths, different assembly pipelines, with a view to determining the most accurate and efficient approach to chloroplast genome assembly. Hybrid assemblies combining at least 20x coverage of both long-reads and short-reads generated a single contig spanning the entire chloroplast genome with few or no detectable errors. Short-read-only assemblies generated three contigs (the long single copy, short single copy and inverted repeat regions) of the chloroplast genome. These contigs contained few single-base errors but tended to exclude several bases at the beginning or end of each contig. Long-read-only assemblies tended to create multiple contigs with a much higher single-base error rate. The chloroplast genome of Eucalyptus pauciflora is 159,942 bp, contains 131 genes of known function. Our results suggest that very accurate assemblies of chloroplast genomes can be achieved using a combination of at least 20x coverage of long- and short-reads respectively, provided that the long-reads contain at least ~5x coverage of reads longer than the inverted repeat region. We show that further increases in coverage give little or no improvement in accuracy, and that hybrid assemblies are more accurate than long-read-only or short-read-only assemblies.

11 March 2020 in Proceedings Of The Royal Society B-Biological Sciences
Verified
Journal Article
Open access
AOAdam J. Orr
Adam J. Orr
APAmanda Padovan
Amanda Padovan
DKDavid Kainer
David Kainer
CKCarsten Külheim
Carsten Külheim
LBLindell Bromham
Lindell Bromham
RLRobert Lanfear
Robert Lanfear
Somatic mutations can have important effects on the life history, ecology, and evolution of plants, but the rate at which they accumulate is poorly understood and difficult to measure directly. Here, we develop a method to measure somatic mutations in individual plants and use it to estimate the somatic mutation rate in a large, long-lived, phenotypically mosaicEucalyptus melliodoratree. Despite being 100 times larger thanArabidopsis,this tree has a per-generation mutation rate only ten times greater, which suggests that this species may have evolved mechanisms to reduce the mutation rate per unit of growth. This adds to a growing body of evidence that illuminates the correlated evolutionary shifts in mutation rate and life history in plants.

22 June 2022 in Computational and Structural Biotechnology Journal
Verified
Journal Article
Open access
AWAngelica M. Walker
Angelica M. Walker
ACAshley Cliff
Ashley Cliff
JRJonathon Romero
Jonathon Romero
MSManesh B. Shah
Manesh B. Shah
PJPiet Jones
Piet Jones
DKDavid Kainer
David Kainer
Gene-to-gene networks, such as Gene Regulatory Networks (GRN) and Predictive Expression Networks (PEN) capture relationships between genes and are beneficial for use in downstream biological analyses. There exists multiple network inference tools to produce these gene-to-gene networks from matrices of gene expression data. Random Forest-Leave One Out Prediction (RF-LOOP) is a method that has been shown to be efficient at producing these gene-to-gene networks, frequently known as GEne Network Inference with Ensemble of trees (GENIE3). Random Forest can be replaced in this process by iterative Random Forest (iRF), which performs variable selection and boosting. Here we validate that iterative Random Forest-Leave One Out Prediction (iRF-LOOP) produces higher quality networks than GENIE3 (RF-LOOP). We use both synthetic and empirical networks from the Dialogue for Reverse Engineering Assessment and Methods (DREAM) Challenges by Sage Bionetworks, as well as two additional empirical networks created from Arabidopsis thaliana and Populus trichocarpa expression data.