@misc{9710, abstract = {Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects.}, author = {Barton, Nicholas H}, publisher = {Dryad}, title = {{Data from: How does epistasis influence the response to selection?}}, doi = {10.5061/dryad.s5s7r}, year = {2016}, } @misc{9720, abstract = {Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline.}, author = {Mcmahon, Dino and Fürst, Matthias and Caspar, Jesicca and Theodorou, Panagiotis and Brown, Mark and Paxton, Robert}, publisher = {Dryad}, title = {{Data from: A sting in the spit: widespread cross-infection of multiple RNA viruses across wild and managed bees}}, doi = {10.5061/dryad.4b565}, year = {2016}, } @misc{9862, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Simulation study to test the robustness of ABC in face of recent times of divergence}}, doi = {10.1371/journal.pbio.2000234.s016}, year = {2016}, } @misc{9863, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Accessions of surveyed individuals, geographic locations and summary statistics}}, doi = {10.1371/journal.pbio.2000234.s017}, year = {2016}, } @misc{9864, abstract = {Viral capsids are structurally constrained by interactions among the amino acids (AAs) of their constituent proteins. Therefore, epistasis is expected to evolve among physically interacting sites and to influence the rates of substitution. To study the evolution of epistasis, we focused on the major structural protein of the ϕX174 phage family by, first, reconstructing the ancestral protein sequences of 18 species using a Bayesian statistical framework. The inferred ancestral reconstruction differed at eight AAs, for a total of 256 possible ancestral haplotypes. For each ancestral haplotype and the extant species, we estimated, in silico, the distribution of free energies and epistasis of the capsid structure. We found that free energy has not significantly increased but epistasis has. We decomposed epistasis up to fifth order and found that higher-order epistasis sometimes compensates pairwise interactions making the free energy seem additive. The dN/dS ratio is low, suggesting strong purifying selection, and that structure is under stabilizing selection. We synthesized phages carrying ancestral haplotypes of the coat protein gene and measured their fitness experimentally. Our findings indicate that stabilizing mutations can have higher fitness, and that fitness optima do not necessarily coincide with energy minima.}, author = {Fernandes Redondo, Rodrigo A and de Vladar, Harold and Włodarski, Tomasz and Bollback, Jonathan P}, publisher = {The Royal Society}, title = {{Data from evolutionary interplay between structure, energy and epistasis in the coat protein of the ϕX174 phage family}}, doi = {10.6084/m9.figshare.4315652.v1}, year = {2016}, } @misc{9866, author = {Zagórski, Marcin P and Burda, Zdzisław and Wacław, Bartłomiej}, publisher = {Public Library of Science}, title = {{ZIP-archived directory containing all data and computer programs}}, doi = {10.1371/journal.pcbi.1005218.s009}, year = {2016}, } @misc{9867, abstract = {In the beginning of our experiment, subjects were asked to read a few pages on their computer screens that would explain the rules of the subsequent game. Here, we provide these instructions, translated from German.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental game instructions}}, doi = {10.1371/journal.pone.0163867.s008}, year = {2016}, } @misc{9868, abstract = {The raw data file containing the experimental decisions of all our study subjects.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental data}}, doi = {10.1371/journal.pone.0163867.s009}, year = {2016}, } @misc{9869, abstract = {A lower bound on the error of a positional estimator with limited positional information is derived.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Error bound on an estimator of position}}, doi = {10.1371/journal.pone.0163628.s001}, year = {2016}, } @misc{9870, abstract = {The effect of noise in the input field on an Ising model is approximated. Furthermore, methods to compute positional information in an Ising model by transfer matrices and Monte Carlo sampling are outlined.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in an Ising model}}, doi = {10.1371/journal.pone.0163628.s002}, year = {2016}, } @misc{9871, abstract = {The positional information in a discrete morphogen field with Gaussian noise is computed.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in a discrete morphogen field}}, doi = {10.1371/journal.pone.0163628.s003}, year = {2016}, } @misc{9873, author = {Boehm, Alex and Arnoldini, Markus and Bergmiller, Tobias and Röösli, Thomas and Bigosch, Colette and Ackermann, Martin}, publisher = {Public Library of Science}, title = {{Quantification of the growth rate reduction as a consequence of age-specific mortality}}, doi = {10.1371/journal.pgen.1005974.s015}, year = {2016}, } @article{1794, abstract = {We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights.}, author = {Kolmogorov, Vladimir and Takhanov, Rustem}, journal = {Algorithmica}, number = {1}, pages = {17 -- 46}, publisher = {Springer}, title = {{Inference algorithms for pattern-based CRFs on sequence data}}, doi = {10.1007/s00453-015-0017-7}, volume = {76}, year = {2016}, } @article{1833, abstract = {Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. }, author = {Klimova, Anna and Rudas, Tamás}, journal = {Journal of Multivariate Analysis}, pages = {440 -- 452}, publisher = {Elsevier}, title = {{On the closure of relational models}}, doi = {10.1016/j.jmva.2015.10.005}, volume = {143}, year = {2016}, } @article{1223, abstract = {We consider a random Schrödinger operator on the binary tree with a random potential which is the sum of a random radially symmetric potential, Qr, and a random transversally periodic potential, κQt, with coupling constant κ. Using a new one-dimensional dynamical systems approach combined with Jensen's inequality in hyperbolic space (our key estimate) we obtain a fractional moment estimate proving localization for small and large κ. Together with a previous result we therefore obtain a model with two Anderson transitions, from localization to delocalization and back to localization, when increasing κ. As a by-product we also have a partially new proof of one-dimensional Anderson localization at any disorder.}, author = {Froese, Richard and Lee, Darrick and Sadel, Christian and Spitzer, Wolfgang and Stolz, Günter}, journal = {Journal of Spectral Theory}, number = {3}, pages = {557 -- 600}, publisher = {EMS Press}, title = {{Localization for transversally periodic random potentials on binary trees}}, doi = {10.4171/JST/132}, volume = {6}, year = {2016}, } @article{1170, abstract = {The increasing complexity of dynamic models in systems and synthetic biology poses computational challenges especially for the identification of model parameters. While modularization of the corresponding optimization problems could help reduce the “curse of dimensionality,” abundant feedback and crosstalk mechanisms prohibit a simple decomposition of most biomolecular networks into subnetworks, or modules. Drawing on ideas from network modularization and multiple-shooting optimization, we present here a modular parameter identification approach that explicitly allows for such interdependencies. Interfaces between our modules are given by the experimentally measured molecular species. This definition allows deriving good (initial) estimates for the inter-module communication directly from the experimental data. Given these estimates, the states and parameter sensitivities of different modules can be integrated independently. To achieve consistency between modules, we iteratively adjust the estimates for inter-module communication while optimizing the parameters. After convergence to an optimal parameter set---but not during earlier iterations---the intermodule communication as well as the individual modules\' state dynamics agree with the dynamics of the nonmodularized network. Our modular parameter identification approach allows for easy parallelization; it can reduce the computational complexity for larger networks and decrease the probability to converge to suboptimal local minima. We demonstrate the algorithm\'s performance in parameter estimation for two biomolecular networks, a synthetic genetic oscillator and a mammalian signaling pathway.}, author = {Lang, Moritz and Stelling, Jörg}, journal = {SIAM Journal on Scientific Computing}, number = {6}, pages = {B988 -- B1008}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Modular parameter identification of biomolecular networks}}, doi = {10.1137/15M103306X}, volume = {38}, year = {2016}, } @article{1377, abstract = {We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programming to solve these problems. We treat both the convex and the nonconvex case and derive worst-case complexities that are equal to or better than existing methods. We show applications to total variation based two dimensional image processing and computer vision problems based on a Lagrangian decomposition approach. The resulting algorithms are very effcient, offer a high degree of parallelism, and come along with memory requirements which are only in the order of the number of image pixels.}, author = {Kolmogorov, Vladimir and Pock, Thomas and Rolinek, Michal}, journal = {SIAM Journal on Imaging Sciences}, number = {2}, pages = {605 -- 636}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Total variation on a tree}}, doi = {10.1137/15M1010257}, volume = {9}, year = {2016}, } @article{1272, abstract = {We study different means to extend offsetting based on skeletal structures beyond the well-known constant-radius and mitered offsets supported by Voronoi diagrams and straight skeletons, for which the orthogonal distance of offset elements to their respective input elements is constant and uniform over all input elements. Our main contribution is a new geometric structure, called variable-radius Voronoi diagram, which supports the computation of variable-radius offsets, i.e., offsets whose distance to the input is allowed to vary along the input. We discuss properties of this structure and sketch a prototype implementation that supports the computation of variable-radius offsets based on this new variant of Voronoi diagrams.}, author = {Held, Martin and Huber, Stefan and Palfrader, Peter}, journal = {Computer-Aided Design and Applications}, number = {5}, pages = {712 -- 721}, publisher = {Taylor & Francis}, title = {{Generalized offsetting of planar structures using skeletons}}, doi = {10.1080/16864360.2016.1150718}, volume = {13}, year = {2016}, } @article{1254, abstract = {We use rigorous numerical techniques to compute a lower bound for the exponent of expansivity outside a neighborhood of the critical point for thousands of intervals of parameter values in the quadratic family. We first compute a radius of the critical neighborhood outside which the map is uniformly expanding. This radius is taken as small as possible, yet large enough for our numerical procedure to succeed in proving that the expansivity exponent outside this neighborhood is positive. Then, for each of the intervals, we compute a lower bound for this expansivity exponent, valid for all the parameters in that interval. We illustrate and study the distribution of the radii and the expansivity exponents. The results of our computations are mathematically rigorous. The source code of the software and the results of the computations are made publicly available at http://www.pawelpilarczyk.com/quadratic/.}, author = {Golmakani, Ali and Luzzatto, Stefano and Pilarczyk, Pawel}, journal = {Experimental Mathematics}, number = {2}, pages = {116 -- 124}, publisher = {Taylor & Francis}, title = {{Uniform expansivity outside a critical neighborhood in the quadratic family}}, doi = {10.1080/10586458.2015.1048011}, volume = {25}, year = {2016}, } @article{1188, abstract = {We consider a population dynamics model coupling cell growth to a diffusion in the space of metabolic phenotypes as it can be obtained from realistic constraints-based modelling. In the asymptotic regime of slow diffusion, that coincides with the relevant experimental range, the resulting non-linear Fokker–Planck equation is solved for the steady state in the WKB approximation that maps it into the ground state of a quantum particle in an Airy potential plus a centrifugal term. We retrieve scaling laws for growth rate fluctuations and time response with respect to the distance from the maximum growth rate suggesting that suboptimal populations can have a faster response to perturbations.}, author = {De Martino, Daniele and Masoero, Davide}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, number = {12}, publisher = {IOP Publishing}, title = {{Asymptotic analysis of noisy fitness maximization, applied to metabolism & growth}}, doi = {10.1088/1742-5468/aa4e8f}, volume = {2016}, year = {2016}, }