@misc{9714,
  author       = {Gómez Sicilia, Àngel and Sikora, Mateusz K and Cieplak, Marek and Carrión Vázquez, Mariano},
  publisher    = {Public Library of Science },
  title        = {{An exploration of the universe of polyglutamine structures - submission to PLOS journals}},
  doi          = {10.1371/journal.pcbi.1004541.s001},
  year         = {2015},
}

@misc{9715,
  author       = {Trubenova, Barbora and Novak, Sebastian and Hager, Reinmar},
  publisher    = {Public Library of Science},
  title        = {{Mathematical inference of the results}},
  doi          = {10.1371/journal.pone.0126907.s001},
  year         = {2015},
}

@misc{9718,
  author       = {Friedlander, Tamar and Mayo, Avraham E. and Tlusty, Tsvi and Alon, Uri},
  publisher    = {Public Library of Science},
  title        = {{Supporting information text}},
  doi          = {10.1371/journal.pcbi.1004055.s001},
  year         = {2015},
}

@misc{9719,
  abstract     = {Parasitism creates selection for resistance mechanisms in host populations and is hypothesized to promote increased host evolvability. However, the influence of these traits on host evolution when parasites are no longer present is unclear. We used experimental evolution and whole-genome sequencing of Escherichia coli to determine the effects of past and present exposure to parasitic viruses (phages) on the spread of mutator alleles, resistance, and bacterial competitive fitness. We found that mutator alleles spread rapidly during adaptation to any of four different phage species, and this pattern was even more pronounced with multiple phages present simultaneously. However, hypermutability did not detectably accelerate adaptation in the absence of phages and recovery of fitness costs associated with resistance. Several lineages evolved phage resistance through elevated mucoidy, and during subsequent evolution in phage-free conditions they rapidly reverted to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this phenotypic reversion was achieved by additional genetic changes rather than by genotypic reversion of the initial resistance mutations. Insertion sequence (IS) elements played a key role in both the acquisition of resistance and adaptation in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions were not more frequent in mutator lineages. Our results provide a genetic explanation for rapid reversion of mucoidy, a phenotype observed in other bacterial species including human pathogens. Moreover, this demonstrates that the types of genetic change underlying adaptation to fitness costs, and consequently the impact of evolvability mechanisms such as increased point-mutation rates, depend critically on the mechanism of resistance.},
  author       = {Wielgoss, Sébastien and Bergmiller, Tobias and Bischofberger, Anna M. and Hall, Alex R.},
  publisher    = {Dryad},
  title        = {{Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria}},
  doi          = {10.5061/dryad.cj910},
  year         = {2015},
}

@misc{9721,
  abstract     = {To prevent epidemics, insect societies have evolved collective disease defences that are highly effective at curing exposed individuals and limiting disease transmission to healthy group members. Grooming is an important sanitary behaviour—either performed towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious agents from the body surface of exposed individuals, but at the risk of disease contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal pathogen Metarhizium as a model system to study how pathogen presence affects self-grooming and allogrooming between exposed and healthy individuals. We develop an epidemiological SIS model to explore how experimentally observed grooming patterns affect disease spread within the colony, thereby providing a direct link between the expression and direction of sanitary behaviours, and their effects on colony-level epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously decreasing allogrooming. This behavioural modulation seems universally adaptive and is predicted to contain disease spread in a great variety of host–pathogen systems. In contrast, allogrooming directed towards pathogen-exposed individuals might both increase and decrease disease risk. Our model reveals that the effect of allogrooming depends on the balance between pathogen infectiousness and efficiency of social host defences, which are likely to vary across host–pathogen systems.},
  author       = {Theis, Fabian and Ugelvig, Line V and Marr, Carsten and Cremer, Sylvia},
  publisher    = {Dryad},
  title        = {{Data from: Opposing effects of allogrooming on disease transmission in ant societies}},
  doi          = {10.5061/dryad.dj2bf},
  year         = {2015},
}

@misc{9737,
  author       = {Symonova, Olga and Topp, Christopher and Edelsbrunner, Herbert},
  publisher    = {Public Library of Science},
  title        = {{Root traits computed by DynamicRoots for the maize root shown in fig 2}},
  doi          = {10.1371/journal.pone.0127657.s001},
  year         = {2015},
}

@misc{9742,
  abstract     = {Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects.},
  author       = {Westhus, Claudia and Ugelvig, Line V and Tourdot, Edouard and Heinze, Jürgen and Doums, Claudie and Cremer, Sylvia},
  publisher    = {Dryad},
  title        = {{Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant}},
  doi          = {10.5061/dryad.7kc79},
  year         = {2015},
}

@misc{9765,
  author       = {Chevereau, Guillaume and Lukacisinova, Marta and Batur, Tugce and Guvenek, Aysegul and Ayhan, Dilay Hazal and Toprak, Erdal and Bollenbach, Mark Tobias},
  publisher    = {Public Library of Science},
  title        = {{Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs}},
  doi          = {10.1371/journal.pbio.1002299.s008},
  year         = {2015},
}

@misc{9772,
  author       = {Trubenova, Barbora and Novak, Sebastian and Hager, Reinmar},
  publisher    = {Public Library of Science},
  title        = {{Description of the agent based simulations}},
  doi          = {10.1371/journal.pone.0126907.s003},
  year         = {2015},
}

@misc{9773,
  author       = {Friedlander, Tamar and Mayo, Avraham E. and Tlusty, Tsvi and Alon, Uri},
  publisher    = {Public Library of Science},
  title        = {{Evolutionary simulation code}},
  doi          = {10.1371/journal.pcbi.1004055.s002},
  year         = {2015},
}

@article{2699,
  abstract     = {We prove the universality of the β-ensembles with convex analytic potentials and for any β &gt;
0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.},
  author       = {Erdös, László and Bourgade, Paul and Yau, Horng},
  journal      = {Duke Mathematical Journal},
  number       = {6},
  pages        = {1127 -- 1190},
  publisher    = {Duke University Press},
  title        = {{Universality of general β-ensembles}},
  doi          = {10.1215/00127094-2649752},
  volume       = {163},
  year         = {2014},
}

@article{2716,
  abstract     = {Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.},
  author       = {Chatterjee, Krishnendu and Randour, Mickael and Raskin, Jean},
  journal      = {Acta Informatica},
  number       = {3-4},
  pages        = {129 -- 163},
  publisher    = {Springer},
  title        = {{Strategy synthesis for multi-dimensional quantitative objectives}},
  doi          = {10.1007/s00236-013-0182-6},
  volume       = {51},
  year         = {2014},
}

@article{2852,
  abstract     = {A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.},
  author       = {Fischlin, Marc and Lehmann, Anja and Pietrzak, Krzysztof Z},
  journal      = {Journal of Cryptology},
  number       = {3},
  pages        = {397 -- 428},
  publisher    = {Springer},
  title        = {{Robust multi-property combiners for hash functions}},
  doi          = {10.1007/s00145-013-9148-7},
  volume       = {27},
  year         = {2014},
}

@inproceedings{2905,
  abstract     = {Persistent homology is a recent grandchild of homology that has found use in
science and engineering as well as in mathematics. This paper surveys the method as well
as the applications, neglecting completeness in favor of highlighting ideas and directions.},
  author       = {Edelsbrunner, Herbert and Morozovy, Dmitriy},
  location     = {Kraków, Poland},
  pages        = {31 -- 50},
  publisher    = {European Mathematical Society Publishing House},
  title        = {{Persistent homology: Theory and practice}},
  doi          = {10.4171/120-1/3},
  year         = {2014},
}

@article{3263,
  abstract     = {Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution.},
  author       = {Tkacik, Gasper and Ghosh, Anandamohan and Schneidman, Elad and Segev, Ronen},
  journal      = {PLoS One},
  number       = {1},
  publisher    = {Public Library of Science},
  title        = {{Adaptation to changes in higher-order stimulus statistics in the salamander retina}},
  doi          = {10.1371/journal.pone.0085841},
  volume       = {9},
  year         = {2014},
}

@inproceedings{10793,
  abstract     = {The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this classical result to clustered graphs with two disjoint clusters, and show that a straightforward extension of our result to flat clustered graphs with three or more disjoint clusters is not possible.

We also give a new and short proof for a related result by Di Battista and Frati based on the matroid intersection algorithm.},
  author       = {Fulek, Radoslav and Kynčl, Jan and Malinović, Igor and Pálvölgyi, Dömötör},
  booktitle    = {International Symposium on Graph Drawing},
  issn         = {0302-9743},
  pages        = {428--436},
  publisher    = {Springer Nature},
  title        = {{Clustered planarity testing revisited}},
  doi          = {10.1007/978-3-662-45803-7_36},
  volume       = {8871},
  year         = {2014},
}

@book{10811,
  abstract     = {Auxin is an important signaling compound in plants and vital for plant development and growth. The present book, Auxin and its Role in Plant Development, provides the reader with detailed and comprehensive insight into the functioning of the molecule on the whole and specifically in plant development. In the first part, the functioning, metabolism and signaling pathways of auxin in plants are explained, the second part depicts the specific role of auxin in plant development and the third part describes the interaction and functioning of the signaling compound  upon stimuli of the environment. Each chapter is written by international experts in the respective field and designed for scientists and researchers in plant biology, plant development and cell biology to summarize the recent progress in understanding the role of auxin and suggest future perspectives for auxin research.},
  editor       = {Zažímalová, Eva and Petrášek, Jan and Benková, Eva},
  isbn         = {9783709115251},
  pages        = {444},
  publisher    = {Springer Nature},
  title        = {{Auxin and Its Role in Plant Development}},
  doi          = {10.1007/978-3-7091-1526-8},
  year         = {2014},
}

@article{10814,
  abstract     = {We review recent progress towards a rigorous understanding of the excitation spectrum of bosonic quantum many-body systems. In particular, we explain how one can rigorously establish the predictions resulting from the Bogoliubov approximation in the mean field limit. The latter predicts that the spectrum is made up of elementary excitations, whose energy behaves linearly in the momentum for small momentum. This property is crucial for the superfluid behavior of the system. We also discuss a list of open problems in this field.},
  author       = {Seiringer, Robert},
  issn         = {1869-7135},
  journal      = {Jahresbericht der Deutschen Mathematiker-Vereinigung},
  keywords     = {General Medicine},
  pages        = {21--41},
  publisher    = {Springer Nature},
  title        = {{The excitation spectrum for Bose fluids with weak interactions}},
  doi          = {10.1365/s13291-014-0083-9},
  volume       = {116},
  year         = {2014},
}

@article{10815,
  abstract     = {In the last several decades, developmental biology has clarified the molecular mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated that the “tool-kit genes” essential for regulating developmental processes are not only highly conserved among species, but are also used as systems at various times and places in an organism to control distinct developmental events. Therefore, mutations in many of these tool-kit genes may cause congenital diseases involving morphological abnormalities. This link between genes and abnormal morphological phenotypes underscores the importance of understanding how cells behave and contribute to morphogenesis as a result of gene function. Recent improvements in live imaging and in quantitative analyses of cellular dynamics will advance our understanding of the cellular pathogenesis of congenital diseases associated with aberrant morphologies. In these studies, it is critical to select an appropriate model organism for the particular phenomenon of interest.},
  author       = {Hashimoto, Masakazu and Morita, Hitoshi and Ueno, Naoto},
  issn         = {0914-3505},
  journal      = {Congenital Anomalies},
  keywords     = {Developmental Biology, Embryology, General Medicine, Pediatrics, Perinatology, and Child Health},
  number       = {1},
  pages        = {1--7},
  publisher    = {Wiley},
  title        = {{Molecular and cellular mechanisms of development underlying congenital diseases}},
  doi          = {10.1111/cga.12039},
  volume       = {54},
  year         = {2014},
}

@inbook{10817,
  abstract     = {The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.},
  author       = {Günther, David and Reininghaus, Jan and Seidel, Hans-Peter and Weinkauf, Tino},
  booktitle    = {Topological Methods in Data Analysis and Visualization III.},
  editor       = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald},
  isbn         = {9783319040981},
  issn         = {2197-666X},
  pages        = {135--150},
  publisher    = {Springer Nature},
  title        = {{Notes on the simplification of the Morse-Smale complex}},
  doi          = {10.1007/978-3-319-04099-8_9},
  year         = {2014},
}

