Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sebastian Höhna

dblp:130/1181 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0001-6519-6292ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 87% Computational science and engineering · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.422016
TESS: an R package for efficiently simulating phylogenetic trees and performing Bayesian inference of lineage diversification rates · Bioinform. 2016
Fast simulation of reconstructed phylogenies under global time-dependent birth-death processes · Bioinform. 2013
Bioinformatics and computational biology
birth-and-death process model
0.112016
TESS: an R package for efficiently simulating phylogenetic trees and performing Bayesian inference of lineage diversification rates · Bioinform. 2016
Computational science and engineering
branching process models
0.112016
TESS: an R package for efficiently simulating phylogenetic trees and performing Bayesian inference of lineage diversification rates · Bioinform. 2016

Methods — techniques the papers use, named apart from their topics

bayesian inference · 0.4numerical methods · 0.2model comparison · 0.2likelihood derivation · 0.2
YearPublicationVenuePosition
2020 Locally adaptive Bayesian birth-death model successfully detects slow and rapid rate shifts
abstract
Birth-death processes have given biologists a model-based framework to answer questions about changes in the birth and death rates of lineages in a phylogenetic tree. Therefore birth-death models are central to macroevolutionary as well as phylodynamic analyses. Early approaches to studying temporal variation in birth and death rates using birth-death models faced difficulties due to the restrictive choices of birth and death rate curves through time. Sufficiently flexible time-varying birth-death models are still lacking. We use a piecewise-constant birth-death model, combined with both Gaussian Markov random field (GMRF) and horseshoe Markov random field (HSMRF) prior distributions, to approximate arbitrary changes in birth rate through time. We implement these models in the widely used statistical phylogenetic software platform RevBayes, allowing us to jointly estimate birth-death process parameters, phylogeny, and nuisance parameters in a Bayesian framework. We test both GMRF-based and HSMRF-based models on a variety of simulated diversification scenarios, and then apply them to both a macroevolutionary and an epidemiological dataset. We find that both models are capable of inferring variable birth rates and correctly rejecting variable models in favor of effectively constant models. In general the HSMRF-based model has higher precision than its GMRF counterpart, with little to no loss of accuracy. Applied to a macroevolutionary dataset of the Australian gecko family Pygopodidae (where birth rates are interpretable as speciation rates), the GMRF-based model detects a slow decrease whereas the HSMRF-based model detects a rapid speciation-rate decrease in the last 12 million years. Applied to an infectious disease phylodynamic dataset of sequences from HIV subtype A in Russia and Ukraine (where birth rates are interpretable as the rate of accumulation of new infections), our models detect a strongly elevated rate of infection in the 1990s.
Andrew F. Magee, Sebastian Höhna, Tetyana I. Vasylyeva, Adam D. Leaché, Volodymyr M. Minin
PLoS Comput. Biol.2
2016 TESS: an R package for efficiently simulating phylogenetic trees and performing Bayesian inference of lineage diversification rates
abstract
UNLABELLED: Many fundamental questions in evolutionary biology entail estimating rates of lineage diversification (speciation-extinction) that are modeled using birth-death branching processes. We leverage recent advances in branching-process theory to develop a flexible Bayesian framework for specifying diversification models-where rates are constant, vary continuously, or change episodically through time-and implement numerical methods to estimate parameters of these models from molecular phylogenies, even when species sampling is incomplete. We enable both statistical inference and efficient simulation under these models. We also provide robust methods for comparing the relative and absolute fit of competing branching-process models to a given tree, thereby providing rigorous tests of biological hypotheses regarding patterns and processes of lineage diversification. AVAILABILITY AND IMPLEMENTATION: The source code for TESS is freely available at http://cran.r-project.org/web/packages/TESS/ CONTACT: [email protected].
Sebastian Höhna, Michael R. May, Brian R. Moore
Bioinform.1
2013 Fast simulation of reconstructed phylogenies under global time-dependent birth-death processes
abstract
MOTIVATION: Diversification rates and patterns may be inferred from reconstructed phylogenies. Both the time-dependent and the diversity-dependent birth-death process can produce the same observed patterns of diversity over time. To develop and test new models describing the macro-evolutionary process of diversification, generic and fast algorithms to simulate under these models are necessary. Simulations are not only important for testing and developing models but play an influential role in the assessment of model fit. RESULTS: In the present article, I consider as the model a global time-dependent birth-death process where each species has the same rates but rates may vary over time. For this model, I derive the likelihood of the speciation times from a reconstructed phylogenetic tree and show that each speciation event is independent and identically distributed. This fact can be used to simulate efficiently reconstructed phylogenetic trees when conditioning on the number of species, the time of the process or both. I show the usability of the simulation by approximating the posterior predictive distribution of a birth-death process with decreasing diversification rates applied on a published bird phylogeny (family Cettiidae). AVAILABILITY: The methods described in this manuscript are implemented in the R package TESS, available from the repository CRAN (http://cran.r-project.org/web/packages/TESS/). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sebastian Höhna
Bioinform.1
2008 Clock-constrained tree proposal operators in Bayesian phylogenetic inference
abstract
Bayesian Markov chain Monte Carlo (MCMC) has become one of the principle methods of performing inference of phylogenetic trees. The MCMC algorithm requires the definition of a transition kernel over the state space, which depends on tree proposal operators. So, the precise form of these operators has a large impact on the computational efficiency of the algorithm. In this paper we investigate the efficiency of different tree proposals specialized on clock-constrained phylogenetic trees. Two new operators are developed and their efficiency is compared to five standard operators. Each of the seven operators is tested individually on three synthetic datasets and eleven real datasets. In addition, the single operators are compared to different mixtures of operators. Results show that our new operators perform better than their standard counterparts, but no operator alone achieved a high efficiency on the full panel of data sets tested. Finally, our new proposed mixture using all operators together provides better performance than current techniques.
Sebastian Höhna, Michael Defoin-Platel, Alexei J. Drummond
BIBE1