IST PubRep
Not a member yet
752 research outputs found
Sort by
Ant queens increase their reproductive efforts after pathogen infection
Get PDFInfections with potentially lethal pathogens may negatively affect an individual's lifespan and decrease its reproductive value. The terminal investment hypothesis predicts that individuals faced with a reduced survival should invest more into reproduction instead of maintenance and growth. Several studies suggest that individuals are indeed able to estimate their body condition and to increase their reproductive effort with approaching death, while other studies gave ambiguous results. We investigate whether queens of a perennial social insect (ant) are able to boost their reproduction following infection with an obligate killing pathogen. Social insect queens are special with regard to reproduction and aging, as they outlive conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior, fecundity increases with queen age. However, it remained unclear whether this reflects negative reproductive senescence or terminal investment in response to approaching death. Here, we test whether queens of C. obscurior react to infection with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying rate. We show that a fungal infection triggers a reinforced investment in reproduction in queens. This adjustment of the reproductive rate by ant queens is consistent with predictions of the terminal investment hypothesis and is reported for the first time in a social insect
Evolution of new regulatory functions on biophysically realistic fitness landscapes
Get PDFGene expression is controlled by networks of regulatory proteins that interact specifically with external signals and DNA regulatory sequences. These interactions force the network components to co-evolve so as to continually maintain function. Yet, existing models of evolution mostly focus on isolated genetic elements. In contrast, we study the essential process by which regulatory networks grow: the duplication and subsequent specialization of network components. We synthesize a biophysical model of molecular interactions with the evolutionary framework to find the conditions and pathways by which new regulatory functions emerge. We show that specialization of new network components is usually slow, but can be drastically accelerated in the presence of regulatory crosstalk and mutations that promote promiscuous interactions between network components
Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses
Get PDFSynaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmissio
The INO80 complex removes H2A Z to promote presynaptic filament formation during homologous recombination
Get PDFThe INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR
Distance-dependent inhibition facilitates focality of gamma oscillations in the dentate gyrus
Get PDFGamma oscillations (30-150Hz) in neuronal networks are associated with the processing and recall of information. We measured local field potentials in the dentate gyrus of freely moving mice and found that gamma activity occurs in bursts, which are highly heterogeneous in their spatial extensions, ranging from focal to global coherent events. Synaptic communication among perisomatic-inhibitory interneurons (PIIs) is thought to play an important role in the generation of hippocampal gamma patterns. However, how neuronal circuits can generate synchronous oscillations at different spatial scales is unknown. We analyzed paired recordings in dentate gyrus slices and show that synaptic signaling at interneuron-interneuron synapses is distance dependent. Synaptic strength declines whereas the duration of inhibitory signals increases with axonal distance among interconnected PIIs. Using neuronal network modeling, we show that distance-dependent inhibition generates multiple highly synchronous focal gamma bursts allowing the network to process complex inputs in parallel in flexibly organized neuronal centers
Strategy complexity of concurrent safety games
Get PDFWe consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary
Faster Monte Carlo algorithms for fixation probability of the moran process on undirected graphs
Get PDFEvolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs
Sequence-specific thermodynamic properties of nucleic acids influence both transcriptional pausing and backtracking in yeast.
Get PDFRNA Polymerase II pauses and backtracks during transcription, with many consequences for gene expression and cellular physiology. Here, we show that the energy required to melt double-stranded nucleic acids in the transcription bubble predicts pausing in Saccharomyces cerevisiae far more accurately than nucleosome roadblocks do. In addition, the same energy difference also determines when the RNA polymerase backtracks instead of continuing to move forward. This data-driven model corroborates – in a genome wide and quantitative manner – previous evidence that sequence-dependent thermodynamic features of nucleic acids influence both transcriptional pausing and backtracking
Complexity of constraint satisfaction
Get PDFAn instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of variables, a finite domain of labels, and a set of constraints, each constraint acting on a subset of the variables. The goal is to find an assignment of labels to its variables that satisfies all constraints (or decide whether one exists). If we allow more general ``soft'' constraints, which come with (possibly infinite) costs of particular assignments, we obtain instances from a richer class called Valued Constraint Satisfaction Problem (VCSP). There the goal is to find an assignment with minimum total cost. In this thesis, we focus (assuming that P NP) on classifying computational complexity of CSPs and VCSPs under certain restricting conditions. Two results are the core content of the work. In one of them, we consider VCSPs parametrized by a constraint language, that is the set of ''soft'' constraints allowed to form the instances, and finish the complexity classification modulo (missing pieces of) complexity classification for analogously parametrized CSP. The other result is a generalization of Edmonds' perfect matching algorithm. This generalization contributes to complexity classfications in two ways. First, it gives a new (largest known) polynomial-time solvable class of Boolean CSPs in which every variable may appear in at most two constraints and second, it settles full classification of Boolean CSPs with planar drawing (again parametrized by a constraint language)
Live tracking of moving samples in confocal microscopy for vertically grown roots
Get PDFRoots navigate through soil integrating environmental signals to orient their growth. The Arabidopsis root is a widely used model for developmental, physiological and cell biological studies. Live imaging greatly aids these efforts, but the horizontal sample position and continuous root tip displacement present significant difficulties. Here, we develop a confocal microscope setup for vertical sample mounting and integrated directional illumination. We present TipTracker – a custom software for automatic tracking of diverse moving objects usable on various microscope setups. Combined, this enables observation of root tips growing along the natural gravity vector over prolonged periods of time, as well as the ability to induce rapid gravity or light stimulation. We also track migrating cells in the developing zebrafish embryo, demonstrating the utility of this system in the acquisition of high-resolution data sets of dynamic samples. We provide detailed descriptions of the tools enabling the easy implementation on other microscopes