Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Consider a population of individuals each of whom possesses two genes that can be either type \(A\) or type \(a\). Suppose that in outward appearance type \(A\) is dominant and type \(a\) is recessive. (That is, an individual will have only the outward characteristics of the recessive gene if its pair is aa.) Suppose that the population has stabilized, and the percentages of individuals having respective gene pairs \(A A, a a\), and \(A a\) are \(p, q\), and \(r .\) Call an individual dominant or recessive depending on the outward characteristics it exhibits. Let \(S_{11}\) denote the probability that an offspring of two dominant parents will be recessive; and let \(S_{10}\) denote the probability that the offspring of one dominant and one recessive parent will be recessive. Compute \(S_{11}\) and \(S_{10}\) to show that \(S_{11}=S_{10}^{2} .\) (The quantities \(S_{10}\) and \(S_{11}\) are known in the genetics literature as Snyder's ratios.)

Short Answer

Expert verified
The probabilities of having a recessive offspring from two dominant parents (probability \(S_{11}\)) and one dominant and one recessive parent (probability \(S_{10}\)) are calculated as follows: \(S_{11} = \frac{r^2}{4(p+r)^2}\) and \(S_{10} = \frac{r}{2(p+r)}\) By squaring the value of \(S_{10}\), we find that \(S_{10}^2 = \frac{r^2}{4(p+r)^2}\), which shows that \(S_{11} = S_{10}^2\).

Step by step solution

01

Write down the gene pair percentages and the dominant and recessive genetics rule

In a stabilized population, the proportions of individuals with gene pairs \(A A\), \(a a\), and \(A a\) are given as \(p, q\) and \(r\) respectively. We have the following information: dominant gene pair \(A A\), recessive gene pair \(a a\), mixed gene pair \(A a\). The rule for dominant and recessive genes is that an individual will have the outward appearance of the recessive gene if and only if its gene pair is \(aa\).
02

Find the probability of having a recessive offspring for specific parent combinations

To find the probabilities \(S_{11}\) and \(S_{10}\), we have to analyze the possible gene combinations of the parents in each situation. For a recessive offspring from two dominant parents, we need to consider the possible gene pair combinations for dominant parents. Dominant parents can be either \(AA\) or \(Aa\), so we can have the following: 1. Dominant parent 1 (\(A A\)) and dominant parent 2 (\(A A\)) 2. Dominant parent 1 (\(A A\)) and dominant parent 2 (\(A a\)) 3. Dominant parent 1 (\(A a\)) and dominant parent 2 (\(A A\)) 4. Dominant parent 1 (\(A a\)) and dominant parent 2 (\(A a\)) For a recessive offspring from one dominant and one recessive parent, we can have the following possible combinations: 1. Dominant parent (\(A A\)) and recessive parent (\(a a\)) 2. Dominant parent (\(A a\)) and recessive parent (\(a a\))
03

Calculate the probability of having a recessive offspring for each situation

Now that we have outlined the possible parent combinations for each situation, we will calculate the probability of having a recessive offspring in each case. For \(S_{11}\), the probability of having a recessive offspring from two dominant parents: 1. Dominant parent 1 (\(A A\)) and dominant parent 2 (\(A A\)): Probability is 0, since there is no recessive gene in their pairs. 2. Dominant parent 1 (\(A A\)) and dominant parent 2 (\(A a\)): Probability is 0, as all offspring will have at least one \(A\) gene. 3. Dominant parent 1 (\(A a\)) and dominant parent 2 (\(A A\)): Probability is 0, as all offspring will have at least one \(A\) gene. 4. Dominant parent 1 (\(A a\)) and dominant parent 2 (\(A a\)): Probability is 0.25, as there is a 25% chance that their offspring will be \(a a\). For calculating \(S_{11}\), we will take the weighted average considering the proportion of each combination: \(S_{11} = 0 \cdot \frac{p^2}{(p+r)^2} + 0 \cdot \frac{p \cdot r}{(p+r)^2} + 0 \cdot \frac{r \cdot p}{(p+r)^2} + 0.25 \cdot \frac{r^2}{(p+r)^2}\) \(S_{11} = \frac{r^2}{4(p+r)^2}\) For \(S_{10}\), the probability of having a recessive offspring from one dominant and one recessive parent: 1. Dominant parent (\(A A\)) and recessive parent (\(a a\)): Probability is 0% since all offspring will have at least one \(A\) gene. 2. Dominant parent (\(A a\)) and recessive parent (\(a a\)): Probability is 50% as their offspring can be \(A a\) or \(a a\). For calculating \(S_{10}\), we will take the weighted average considering the proportion of each combination: \(S_{10} = 0 \cdot \frac{p \cdot q}{(p+r) \cdot q} + 0.5 \cdot \frac{r \cdot q}{(p+r) \cdot q}\) \(S_{10} = \frac{r}{2(p+r)}\)
04

Show that \(S_{11} = S_{10}^2\)

Finally, to prove that \(S_{11}=S_{10}^2\), we will square the value of \(S_{10}\) and compare it with \(S_{11}\): \(S_{10}^2 = \left(\frac{r}{2(p+r)}\right)^2\) \(S_{10}^2 = \frac{r^2}{4(p+r)^2}\) \(\implies S_{11} = S_{10}^2\) Hence, we have shown that \(S_{11} = S_{10}^2\), as required.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Consider an irreducible finite Markov chain with states \(0,1, \ldots, N\). (a) Starting in state \(i\), what is the probability the process will ever visit state \(j\) ? Explain! (b) Let \(x_{i}=P\) [visit state \(N\) before state 0 |start in \(\left.i\right\\}\). Compute a set of linear equations that the \(x_{i}\) satisfy, \(i=0,1, \ldots, N\). (c) If \(\sum_{j} j P_{i j}=i\) for \(i=1, \ldots, N-1\), show that \(x_{i}=i / N\) is a solution to the equations in part (b).

For the random walk of Example \(4.18\) use the strong law of large numbers to give another proof that the Markov chain is transient when \(p \neq \frac{1}{2}\). Hint: Note that the state at time \(n\) can be written as \(\sum_{i=1}^{n} Y_{i}\) where the \(Y_{i}\) s are independent and \(P\left\\{Y_{i}=1\right\\}=p=1-P\left\\{Y_{i}=-1\right\\}\). Argue that if \(p>\frac{1}{2}\), then, by the strong law of large numbers, \(\sum_{1}^{n} Y_{i} \rightarrow \infty\) as \(n \rightarrow \infty\) and hence the initial state 0 can be visited only finitely often, and hence must be transient. A similar argument holds when \(p<\frac{1}{2}\).

A professor continually gives exams to her students. She can give three possible types of exams, and her class is graded as either having done well or badly. Let \(p_{i}\) denote the probability that the class does well on a type \(i\) exam, and suppose that \(p_{1}=0.3, p_{2}=0.6\), and \(p_{3}=0.9 .\) If the class does well on an exam, then the next exam is equally likely to be any of the three types. If the class does badly, then the next exam is always type \(1 .\) What proportion of exams are type \(i, i=1,2,3 ?\)

Let \(\left\\{X_{n}, n \geqslant 0\right\\}\) denote an ergodic Markov chain with limiting probabilities \(\pi_{i} .\) Define the process \(\left\\{Y_{n}, n \geqslant 1\right\\}\) by \(Y_{n}=\left(X_{n-1}, X_{n}\right)\). That is, \(Y_{n}\) keeps track of the last two states of the original chain. Is \(\left\\{Y_{n}, n \geqslant 1\right\\}\) a Markov chain? If so, determine its transition probabilities and find $$ \lim _{n \rightarrow \infty} P\left\\{Y_{n}=(i, j)\right\\} $$

Consider a branching process having \(\mu<1\). Show that if \(X_{0}=1\), then the expected number of individuals that ever exist in this population is given by \(1 /(1-\mu)\). What if \(X_{0}=n ?\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free