اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA comparison of three replication strategies in complex multicellular organisms: Asexual replication, sexual replication with identical gametes, and sexual replication with distinct sperm and egg gametes
125
0
0.0
(
0
)
تأليف
Emmanuel Tannenbaum
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper studies the mutation-selection balance in three simplified replication models. The first model considers a population of organisms replicating via the production of asexual spores. The second model considers a sexually replicating population that produces identical gametes. The third model considers a sexually replicating population that produces distinct sperm and egg gametes. All models assume diploid organisms whose genomes consist of two chromosomes, each of which is taken to be functional if equal to some master sequence, and defective otherwise. In the asexual population, the asexual diploid spores develop directly into adult organisms. In the sexual populations, the haploid gametes enter a haploid pool, where they may fuse with other haploids. The resulting immature diploid organisms then proceed to develop into mature organisms. Based on an analysis of all three models, we find that, as organism size increases, a sexually replicating population can only outcompete an asexually replicating population if the adult organisms produce distinct sperm and egg gametes. A sexual replication strategy that is based on the production of large numbers of sperm cells to fertilize a small number of eggs is found to be necessary in order to maintain a sufficiently low cost for sex for the strategy to be selected for over a purely asexual strategy. We discuss the usefulness of this model in understanding the evolution and maintenance of sexual replication as the preferred replication strategy in complex, multicellular organisms.
قيم البحث
اقرأ أيضاً
This paper develops simplified mathematical models describing the mutation-selection balance for the asexual and sexual replication pathways in {it Saccharomyces cerevisiae}. We assume diploid genomes consisting of two chromosomes, and we assume that
each chromosome is functional if and only if its base sequence is identical to some master sequence. The growth and replication of the yeast cells is modeled as a first-order process, with first-order growth rate constants that are determined by whether a given genome consists of zero, one, or two functional chromosomes. In the asexual pathway, we assume that a given diploid cell divides into two diploids. In the sexual pathway, we assume that a given diploid cell divides into two diploids, each of which then divide into two haploids. The resulting four haploids enter a haploid pool, where they grow and replicate until they meet another haploid with which to fuse. When the cost for sex is low, we find that the selective mating strategy leads to the highest mean fitness of the population, when compared to all of the other strategies. We also show that, at low to intermediate replication fidelities, sexual replication with random mating has a higher mean fitness than asexual replication, as long as the cost for sex is low. This is consistent with previous work suggesting that sexual replication is advantageous at high population densities, low replication rates, and intermediate replication fidelities. The results of this paper also suggest that {it S. cerevisiae} switches from asexual to sexual replication when stressed, because stressful growth conditions provide an opportunity for the yeast to clear out deleterious mutations from their genomes.
It is known that if one could clone an arbitrary quantum state one could send signal faster than the speed of light. However it remains interesting to see that if one can perfectly self replicate an arbitrary quantum state, does it violate the no sig
nalling principle? Here we see that perfect self replication would also lead to superluminal signalling.
The maximum possible throughput (or the rate of job completion) of a multi-server system is typically the sum of the service rates of individual servers. Recent work shows that launching multiple replicas of a job and canceling them as soon as one co
py finishes can boost the throughput, especially when the service time distribution has high variability. This means that redundancy can, in fact, create synergy among servers such that their overall throughput is greater than the sum of individual servers. This work seeks to find the fundamental limit of the throughput boost achieved by job replication and the optimal replication policy to achieve it. While most previous works consider upfront replication policies, we expand the set of possible policies to delayed launch of replicas. The search for the optimal adaptive replication policy can be formulated as a Markov Decision Process, using which we propose two myopic replication policies, MaxRate and AdaRep, to adaptively replicate jobs. In order to quantify the optimality gap of these and other policies, we derive upper bounds on the service capacity, which provide fundamental limits on the throughput of queueing systems with redundancy.
DNA replication is an essential process in biology and its timing must be robust so that cells can divide properly. Random fluctuations in the formation of replication starting points, called origins, and the subsequent activation of proteins lead to
variations in the replication time. We analyse these stochastic properties of DNA and derive the positions of origins corresponding to the minimum replication time. We show that under some conditions the minimization of replication time leads to the grouping of origins, and relate this to experimental data in a number of species showing origin grouping.
We apply the knockoff procedure to factor selection in finance. By building fake but realistic factors, this procedure makes it possible to control the fraction of false discovery in a given set of factors. To show its versatility, we apply it to fun
d replication and to the inference of explanatory and prediction networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
