The Common Ancestor Process Revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 t...

متن کامل

The Common Ancestor Process for a Wright-Fisher Diffusion

Rates of molecular evolution along phylogenetic trees are influenced by mutation, selection and genetic drift. Provided that the branches of the tree correspond to lineages belonging to genetically isolated populations (e.g., multi-species phylogenies), the interplay between these three processes can be described by analyzing the process of substitutions to the common ancestor of each populatio...

متن کامل

The last common bilaterian ancestor.

Many regulatory genes appear to be utilized in at least superficially similar ways in the development of particular body parts in Drosophila and in chordates. These similarities have been widely interpreted as functional homologies, producing the conventional view of the last common protostome-deuterostome ancestor (PDA) as a complex organism that possessed some of the same body parts as modern...

متن کامل

Lowest Common Ancestor(LCA)

Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...

متن کامل

2 Least Common Ancestor

In particular, we are allowed to preprocess the texts in order to be able to answer the query faster. Our preprocessing choice was the use of a single suffix tree, in which all the suffixes of all the texts appear, each suffix ending with a distinct symbol that determines the text in which the suffix appears. In order to answer the query we reduced the problem to range-min queries, which in tur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Mathematical Biology

سال: 2013

ISSN: 0092-8240,1522-9602

DOI: 10.1007/s11538-013-9871-0