The common ancestor process revisited.
نویسندگان
چکیده
We consider the Moran model in continuous time with two types, mutation, and selection. We concentrate on the ancestral line and its stationary type distribution. Building on work by Fearnhead (J. Appl. Probab. 39 (2002), 38-54) and Taylor (Electron. J. Probab. 12 (2007), 808-847), we characterise this distribution via the fixation probability of the offspring of all individuals of favourable type (regardless of the offspring's types). We concentrate on a finite population and stay with the resulting discrete setting all the way through. This way, we extend previous results and gain new insight into the underlying particle picture.
منابع مشابه
The hyperthermophilic origin of life revisited.
We revisit the case for the hyperthermophilic scenario for the origin of life and the last common ancestor. Evidence includes studies of phylogenetic trees, rRNA, G and C content, hyperthermophilic proteins, correlations between maximal temperature tolerances and genetic distances, saline stabilization of DNA/RNA, and the inferred climatic temperatures of the early Earth. Although some doubts r...
متن کاملThe LCA Problem Revisited
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin [1].
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملEvolution of the most recent common ancestor of a population with no selection
We consider the evolution of a population of fixed size with no selection. The number of generations G to reach the first common ancestor evolves in time. This evolution can be described by a simple Markov process which allows one to calculate several characteristics of the time dependence of G. We also study how G is correlated to the genetic diversity.
متن کاملThe Two Phases of the Coalescent and Fixation Processes
Introduction The coalescent process which traces back the current population to a common ancestor and the fixation process which follows an individual until the population is fixed for its descendants are heuristically inverse processes, yet the time reversal of one is seldom the other. This is because several generations will share the same most recent common ancestor, and several generations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of mathematical biology
دوره 75 11 شماره
صفحات -
تاریخ انتشار 2013