اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEstimating the division rate from indirect measurements of single cells
56
0
0.0
(
0
)
تأليف
Marie Doumic
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Is it possible to estimate the dependence of a growing and dividing population on a given trait in the case where this trait is not directly accessible by experimental measurements, but making use of measurements of another variable? This article adresses this general question for a very recent and popular model describing bacterial growth, the so-called incremental or adder model. In this model, the division rate depends on the increment of size between birth and division, whereas the most accessible trait is the size itself. We prove that estimating the division 10 rate from size measurements is possible, we state a reconstruction formula in a deterministic and then in a statistical setting, and solve numerically the problem on simulated and experimental data. Though this represents a severely ill-posed inverse problem, our numerical results prove to be satisfactory.
قيم البحث
اقرأ أيضاً
We consider the fragmentation equation $dfrac{partial}{partial t}f (t, x) = --B(x)f (t, x) + int_{ y=x}^{ y=infty} k(y, x)B(y)f (t, y)dy,$ and address the question of estimating the fragmentation parameters-i.e. the division rate $B(x)$ and the fragm
entation kernel $k(y, x)$-from measurements of the size distribution $f (t, $times$)$ at various times. This is a natural question for any application where the sizes of the particles are measured experimentally whereas the fragmentation rates are unknown, see for instance (Xue, Radford, Biophys. Journal, 2013) for amyloid fibril breakage. Under the assumption of a polynomial division rate $B(x) = alpha x^{gamma}$ and a self-similar fragmentation kernel $k(y, x) = frac{1}{y} k_0 (x/ y)$, we use the asymptotic behaviour proved in (Escobedo, Mischler, Rodriguez-Ricard, Ann. IHP, 2004) to obtain uniqueness of the triplet $(alpha, gamma, k _0)$ and a representation formula for $k_0$. To invert this formula, one of the delicate points is to prove that the Mellin transform of the asymptotic profile never vanishes, what we do through the use of the Cauchy integral.
The means to obtain the rate constants of a chemical reaction is a fundamental open problem in both science and the industry. Traditional techniques for finding rate constants require either chemical modifications of the reactants or indirect measure
ments. The rate constant map method is a modern technique to study binding equilibrium and kinetics in chemical reactions. Finding a rate constant map from biosensor data is an ill-posed inverse problem that is usually solved by regularization. In this work, rather than finding a deterministic regularized rate constant map that does not provide uncertainty quantification of the solution, we develop an adaptive variational Bayesian approach to estimate the distribution of the rate constant map, from which some intrinsic properties of a chemical reaction can be explored, including information about rate constants. Our new approach is more realistic than the existing approaches used for biosensors and allows us to estimate the dynamics of the interactions, which are usually hidden in a deterministic approximate solution. We verify the performance of the new proposed method by numerical simulations, and compare it with the Markov chain Monte Carlo algorithm. The results illustrate that the variational method can reliably capture the posterior distribution in a computationally efficient way. Finally, the developed method is also tested on the real biosensor data (parathyroid hormone), where we provide two novel analysis tools~-- the thresholding contour map and the high order moment map -- to estimate the number of interactions as well as their rate constants.
The mean size of exponentially dividing E. coli cells cultured in different nutrient conditions is known to depend on the mean growth rate only. However, the joint fluctuations relating cell size, doubling time and individual growth rate are only sta
rting to be characterized. Recent studies in bacteria (i) revealed the near constancy of the size extension in a single cell cycle (adder mechanism), and (ii) reported a universal trend where the spread in both size and doubling times is a linear function of the population means of these variables. Here, we combine experiments and theory and use scaling concepts to elucidate the constraints posed by the second observation on the division control mechanism and on the joint fluctuations of sizes and doubling times. We found that scaling relations based on the means both collapse size and doubling-time distributions across different conditions, and explain how the shape of their joint fluctuations deviates from the means. Our data on these joint fluctuations highlight the importance of cell individuality: single cells do not follow the dependence observed for the means between size and either growth rate or inverse doubling time. Our calculations show that these results emerge from a broad class of division control mechanisms (including the adder mechanism as a particular case) requiring a certain scaling form of the so-called division hazard rate function, which defines the probability rate of dividing as a function of measurable parameters. This gives a rationale for the universal body-size distributions observed in microbial ecosystems across many microbial species, presumably dividing with multiple mechanisms. Additionally, our experiments show a crossover between fast and slow growth in the relation between individual-cell growth rate and division time, which can be understood in terms of different regimes of genome replication control.
The spectral gap $gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to a fixed ti
me $n$ may be observed. We consider here the problem of estimating $gamma$ from this data. Let $pi$ be the stationary distribution of $P$, and $pi_star = min_x pi(x)$. We show that if $n = tilde{O}bigl(frac{1}{gamma pi_star}bigr)$, then $gamma$ can be estimated to within multiplicative constants with high probability. When $pi$ is uniform on $d$ states, this matches (up to logarithmic correction) a lower bound of $tilde{Omega}bigl(frac{d}{gamma}bigr)$ steps required for precise estimation of $gamma$. Moreover, we provide the first procedure for computing a fully data-dependent interval, from a single finite-length trajectory of the chain, that traps the mixing time $t_{text{mix}}$ of the chain at a prescribed confidence level. The interval does not require the knowledge of any parameters of the chain. This stands in contrast to previous approaches, which either only provide point estimates, or require a reset mechanism, or additional prior knowledge. The interval is constructed around the relaxation time $t_{text{relax}} = 1/gamma$, which is strongly related to the mixing time, and the width of the interval converges to zero roughly at a $1/sqrt{n}$ rate, where $n$ is the length of the sample path.
Estimating the unknown number of classes in a population has numerous important applications. In a Poisson mixture model, the problem is reduced to estimating the odds that a class is undetected in a sample. The discontinuity of the odds prevents the
existence of locally unbiased and informative estimators and restricts confidence intervals to be one-sided. Confidence intervals for the number of classes are also necessarily one-sided. A sequence of lower bounds to the odds is developed and used to define pseudo maximum likelihood estimators for the number of classes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
