137 research outputs found
Fat or Carbohydrate Oxidation during the Alpha Cardio Focus T25 Workout: A Pilot Study
Please view abstract in the attached PDF fil
Effects of Different Muscle Recovery Techniques following a Delayed Onset Muscle Soreness-Inducing Exercise Protocol
Accuracy and Practicality of a NIRS Device on Blood Lactate Levels
Please see the pdf version of the abstract
The Effects of a Six-Week HIIT Program on CVD Risk Factors in Sedentary Individuals
Please see the pdf version of the abstract
The Effects of Essential Oils on Perception of Exertion, Task Pleasantness and Time on Task
Click the PDF icon to download the abstract
The Effects of Creatine Monohydrate and Creatine Hydrochloride Supplementation on Power in Trained Individuals
Please refer to the pdf version of the abstract located adjacent to the title
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set
We show that the problem of computing the hybridization number of two rooted
binary phylogenetic trees on the same set of taxa X has a constant factor
polynomial-time approximation if and only if the problem of computing a
minimum-size feedback vertex set in a directed graph (DFVS) has a constant
factor polynomial-time approximation. The latter problem, which asks for a
minimum number of vertices to be removed from a directed graph to transform it
into a directed acyclic graph, is one of the problems in Karp's seminal 1972
list of 21 NP-complete problems. However, despite considerable attention from
the combinatorial optimization community it remains to this day unknown whether
a constant factor polynomial-time approximation exists for DFVS. Our result
thus places the (in)approximability of hybridization number in a much broader
complexity context, and as a consequence we obtain that hybridization number
inherits inapproximability results from the problem Vertex Cover. On the
positive side, we use results from the DFVS literature to give an O(log r log
log r) approximation for hybridization number, where r is the value of an
optimal solution to the hybridization number problem
19 Dubious Ways to Compute the Marginal Likelihood of a Phylogenetic Tree Topology.
The marginal likelihood of a model is a key quantity for assessing the evidence provided by the data in support of a model. The marginal likelihood is the normalizing constant for the posterior density, obtained by integrating the product of the likelihood and the prior with respect to model parameters. Thus, the computational burden of computing the marginal likelihood scales with the dimension of the parameter space. In phylogenetics, where we work with tree topologies that are high-dimensional models, standard approaches to computing marginal likelihoods are very slow. Here, we study methods to quickly compute the marginal likelihood of a single fixed tree topology. We benchmark the speed and accuracy of 19 different methods to compute the marginal likelihood of phylogenetic topologies on a suite of real data sets under the JC69 model. These methods include several new ones that we develop explicitly to solve this problem, as well as existing algorithms that we apply to phylogenetic models for the first time. Altogether, our results show that the accuracy of these methods varies widely, and that accuracy does not necessarily correlate with computational burden. Our newly developed methods are orders of magnitude faster than standard approaches, and in some cases, their accuracy rivals the best established estimators
Systematic Exploration of the High Likelihood Set of Phylogenetic Tree Topologies.
Bayesian Markov chain Monte Carlo explores tree space slowly, in part because it frequently returns to the same tree topology. An alternative strategy would be to explore tree space systematically, and never return to the same topology. In this article, we present an efficient parallelized method to map out the high likelihood set of phylogenetic tree topologies via systematic search, which we show to be a good approximation of the high posterior set of tree topologies on the data sets analyzed. Here, "likelihood" of a topology refers to the tree likelihood for the corresponding tree with optimized branch lengths. We call this method "phylogenetic topographer" (PT). The PT strategy is very simple: starting in a number of local topology maxima (obtained by hill-climbing from random starting points), explore out using local topology rearrangements, only continuing through topologies that are better than some likelihood threshold below the best observed topology. We show that the normalized topology likelihoods are a useful proxy for the Bayesian posterior probability of those topologies. By using a nonblocking hash table keyed on unique representations of tree topologies, we avoid visiting topologies more than once across all concurrent threads exploring tree space. We demonstrate that PT can be used directly to approximate a Bayesian consensus tree topology. When combined with an accurate means of evaluating per-topology marginal likelihoods, PT gives an alternative procedure for obtaining Bayesian posterior distributions on phylogenetic tree topologies
Effects of Static and Dynamic Hamstring Stretching on Anaerobic Exercise Performance
Please view abstract in the attached PDF file
- …