In MSMB Chapter 1, you have familiarized yourself with (or recapitulated) the concept of generative models for discrete data in R. In particular, we learned about the Poisson, the Binomial, and the Multinomial distribution.
a) Types of biological data
Check again the lecture slides and recapitulate what types of biological data you have encountered so far.
Give two biological data examples and a corresponding scientific question where you think that any of the above probability distributions is useful.
CautionBinomial
Number of successes in a fixed number\(n\) of independent Bernoulli trials with a constant probability of success\(p\) in each trial.
Example: Mendelian inheritance
Consider a single gene with two allees (A and a)
Equal probability of being passed to the offspring (1/2 for A and 1/2 for a)
Probability of an offspring receiving a certain number of A alleles can be modeled as a Binomial distribution
Heterozygous parents (Aa x Aa)
\(p=1/2\) to receive A from each parent
\(n=2\) (two alleles)
\(P(X=k)\) is the probability of offspring having \(k\) alleles A (\(k\) can be 0, 1, or 2)
TipLaw of rare events
Probability of an event is small and the number of trials large
\(\rightarrow\) Binomial can be approximated by the simpler Poisson distribution
Approximation more accurate with increasing \(n\) or decreasing \(p\)
CautionPoisson
Models the probability of a given number of events in a fixed interval (e.g., time or space).
\(P(X=k) = \frac{\lambda^ke^{-\lambda}}{k!}\)
\(\lambda\) is the rate of occurence
\(\lambda\) is also the mean, and the variance of the distribution
\(k\) is the number of occurences
Example: Gene mutations
\(\lambda = 2\) mutations per month
\(n=30000\) nucleotides
\(p=\frac{\lambda}{n}\) = 6.6667e-05
\(P(X=k)\) (probability of observing \(k\) mutations)?
Other examples:
HIV mutation rate (Lecture 3 slide 63, MSMB 1.3.3)
Occurence of rare diseases
CautionMultinomial
The multinomial distribution is a generalization of the Binomial distribution.
Multinomial distribution is used when conducting multiple independent trials of an experiment and each trial can have any number of possible outcomes (instead of just two as in the Binomial distribution).
Parameters:
Number of trials \(n\)
Number of possible outcomes \(k\) (Binomial if \(k=2\))
Probabilities of each outcome (\(p_1, p_2, ..., p_k)\)
Example: Nucleotide frequencies
Each nucleotide A, C, T, G has a certain probability of occuring in a gene/sequence: \(p_1, p_2, p_3, p_4\)
\(\rightarrow k=4\)
The probability of observing each nucleotide a certain number of times \(P(X_1=x_1, X_2=x_2, X_3=x_3, X_4=x_4)\) can be modeled by a Multinomial distribution.
It allows for more flexibility. Unfortunately, the multinomial distribution does not provide a good fit to 16S rRNA count data, as seeing in the lecture (please refer to Negative Binomial for the 16S rRNA count day).
Another example is the Hardy-Weinberg case (Lecture 3 page 71, MSBM 2.7.2), where the three possible genotypes can be modeled by a Multinomial distribution:
Homozygous AA (if both parents inherited A)
Heterozygous Aa (if one parent inherited A and the other a)
Homozygous aa (if both parents inherited a)
b) MSMB Exercise 1.1
Do MSMB Exercise 1.1 (below the text for completeness).
R can generate numbers from all known distributions. We now know how to generate random discrete data using the specialized R functions tailored for each type of distribution. We use the functions that start with an r as in rXXXX, where XXXX could be pois, binom, multinom.
If we need a theoretical computation of a probability under one of these models, we use the functions dXXXX, such as dbinom, which computes the probabilities of events in the discrete binomial distribution, and dnorm, which computes the probability density function for the continuous normal distribution. When computing tail probabilities such as P(X > a), it is convenient to use the cumulative distribution functions, which are called pXXXX. Find two other discrete distributions that could replace the XXXX above.
Use the function rXXXX for random numbers, dXXXX for the probabilities (density), and pXXXX for the cumulative distribution function.
Find two other discrete distributions that could replace the XXXX above.
Code
# Specification of a seed is important in a sense that guarantees the same # random number generator, and thus the same sampling result.set.seed(100)# Binomialdbinom(x, size, prob, log =FALSE)pbinom(q, size, prob, lower.tail =TRUE, log.p =FALSE)rbinom(n, size, prob)# Bernoulli (Number of trials set to 1)rbinom(n, size =1,prob)# Multinomialdmnom(x, size, prob, log =FALSE)rmnom(n, size, prob)pmultinom(lower=ls, upper=us, size=n, probs=ps, method="exact")# Poissondpois(x, lambda, log =FALSE)ppois(q, lambda, lower.tail =TRUE, log.p =FALSE)rpois(n, lambda)# Negative Binomialdnbinom(x, size, prob, mu, log =FALSE)pnbinom(q, size, prob, mu, lower.tail =TRUE, log.p =FALSE)rnbinom(n, size, prob, mu)# Gammadgamma(x, shape, rate =1, scale =1/rate, log =FALSE)pgamma(q, shape, rate =1, scale =1/rate, lower.tail =TRUE,log.p =FALSE)rgamma(n, shape, rate =1, scale =1/rate)
Exercise 2 (C. elegans nucleotide frequencies)
In MSMB Chapter 1, we covered the multinomial distribution.
We are now using the distribution to model nucleotide frequencies in a real genome, the mitochondrial sequence of the worm C. elegans.
This exercise is adapted from MSMB Exercise 1.8.
This is our opportunity to use Bioconductor for the first time. Since Bioconductor’s package management is more tightly controlled than CRAN’s, we need to use a special install function (from the BiocManager package) to install Bioconductor packages:
Briefly, mitochondria are in charge of producing ATP molecules, which are used as a source of chemical energy to carry out various chemical reactions within the cell. Interestingly, mitochondria have their own genome, separate from the genomic material found in the nucleus. Why?
According to the endosymbiotic theory, proposed by Dr. Lynn Margulis, mitochondria were originally an independent prokaryotic organism (bacteria-like). At some point, a long time ago, these prokaryotic organisms found their way inside ancestral eukaryotic cells and established a symbiotic relationship (a relationship where both parties benefit from one another). This led to the prokaryotic organism to gradually lose its independence, eventually become a permanent part of the eukaryotic cell. One big piece of evidence is the fact that they still have their own genome!
By looking at the sequences available in the C. elegans genome, we can see that there are 6 nuclear chromosomes (chrI-V and chrX), and one mitochondrial chromosome (chrM).
Each nucleotide has an expected value of 3448.5. Now we can turn our attention toward the simulation.
Code
set.seed(42) # Always set your seedobserved0 <-rmultinom(n =1000, # Lets do 1000 trials, for funsize =length(Ce.chrM), # Number of nucleotides in the genomeprob = pvec) # The frequency of each nucleotide
Each column in the matrix observed0 is a simulated genome nucleotide frequency.
We plot the relative frequencies of the nucleotides for a subset of 10 repetitions.
Code
library(ggplot2)
Warning: package 'ggplot2' was built under R version 4.5.2
Code
library(reshape2)# Convert to data framerownames(observed0) <-c("A", "T", "C", "G")colnames(observed0) <-paste0("Rep", 1:ncol(observed0))df <-as.data.frame(observed0[, 1:10])# Transpose the data framedata_t <-t(df)# Convert the transposed data frame to a data frame with columns Sample, # Nucleotide, and Abundancedata_long <-melt(data_t, varnames =c("Repetition", "Nucleotide"), value.name ="Abundance")# Add a relative abundance column by dividing each row by the sum of its sampledata_long$RelativeAbundance <- data_long$Abundance /sum(data_long$Abundance)# Create a stacked bar plot with ggplotggplot(data_long, aes(x = Repetition, y = RelativeAbundance, fill = Nucleotide)) +geom_bar(stat ="identity") +labs(x ="Samples", y ="Relative Abundance") +scale_y_continuous(labels = scales::percent) +theme_minimal()
The values computed above represent the observed values of each nucleotide under a fair model. This gives us a chance to know how much variability can be expected under this process, and how much variability is too much.
To do this we can use the following variability measurement, where we compute the sum of the squares of the differences between the observed values and the expected values relative to the expected values.
CautionReject the hypthesis (frequency of nucleotides is equal)?
Code
as.logical(test.var > crit.val)
[1] TRUE
It seems that the variation from the expected values is more than what would be expected if all nucleotides had the same frequency.
Therefore, we can reject the null hypothesis and say that the frequency of nucleotides is not equal. This is actually a true phenomenon!
Different organisms have different biases toward different nucleotides.
Exercise 3 (Displaying GC content in S. aureus)
In the lecture, we learned about nucleotide frequencies in genomes.
Now let’s look at the GC content (guanine-cytosine content) in a real bacterial genome in MSMB Exercise 2.4.
Display GC content in a sliding window along the sequence of Staphylococcus Aureus. Read in a fasta file sequence from a file. This file is available in the data folder associated with the MSMB book.
Display the GC content in a sliding window as a fraction.
Solution:
Again, we can make use of a very useful function
Code
# Compute the GC content in a sliding window (as a fraction) for sequence no. 364# (the same from the Figure 2.28 in the book was chosen)gc <-rowSums(letterFrequencyInSlidingView(staph[[364]], window, c("G", "C")))/windowplot(gc, type ='l')
Length of the sequence 364:
Code
length(staph[[364]])
[1] 402
There are 303 sliding windows: * 1-100 * … * 303-402
d) Overall trend
How could we visualize the overall trends of these proportions along the sequence?
Solution:
Code
plot(1:length(gc), gc, type ="l")lines(lowess(x =1:length(gc), y= gc, f =0.10), col =12, lwd =2)
The function lowess() is used for scatter plot smoothing.
TipWhat is the purpose of sliding windows?
GC content can vary significantly across a genome and influence its structural and functional properties
Detecting Functional Regions: Sliding window analysis can help identify regions with specific characteristics. For example, regions with high GC content may correspond to genes or regulatory elements, as these are often more stable and less prone to mutation.
Pattern Recognition: Sliding window analysis can help identify repetitive elements or other sequence motifs. For example, regions with alternating A/T or G/C bases might suggest the presence of certain types of repetitive DNA.
Exercise 4 (Maximum Likelihood)
Humans, and many other organisms, are also classified as diploid organisms This means that our cells contain two copies of genetic material (i.e. two copies of each chromosome). One copy comes from the mother, and the other copy comes from the father This means that we also have two copies of each gene.
Genes can have different versions. These variant forms of genes are also known as alleles In classical genetics, alleles are often represented as capital and lowercase letters. For example, imagine a gene that has two alleles. One allele could be represented as ’A’ and the other as ’a’ Remember that we have two copies of each gene This means that we can have different types of allele combinations
In a diploid organism, there are three possible genotypes for any gene with two alleles:
Suppose that a particular gene occurs as one of the two alleles (A and a), where allele A has frequency θ in the population. In other words, a random copy of the gene is A with probability θ and a with probability 1 − θ
a) Genotype probabilities
Consider a diploid organism with a specific gene that has two alleles (e.g., A and a).
Define the probability of each genotype.
Hint: Think about the Hardy-Weinberg principle and how genes are inherited.
Assumptions: The Hardy-Weinberg principle assumes several key conditions:
No natural selection
No mutation
No migration (no individuals enter or leave the population)
Population must be very large (to avoid genetic drift)
Random mating must occur (no mating preferences).
Source: www.amoebasisters.com
Principle:
Given a gene with two alleles, A and a, the principle predicts that the frequencies of these alleles will stabilize at equilibrium after one generation of random mating if the assumptions are met.
Source: study.com
NoteDefine the probability of each genotype.
b) Multinomial distribution
Suppose we test a random sample of \(k\) people, where \(k_i\) identifies the group of people with a particular genotype. Find the MLE of θ using the probabilities obtained in (a).
Hint: think of a multinomial distribution.
NoteParameters of the Multinomial distribution
\(k>0\) trials (here: people)
\(m>0\) mutually exclusive events (here: genotypes AA, Aa, and aa)
Note: \(\frac{k!}{k_1! k_2! k_3!} = {k \choose k_1, k_2, k_3}\) is the multinomial coefficient, which counts the number of ways to distribute \(k\) items into three different groups.
# Sequence of possible thetasthetaseq <-seq(0, 1, 0.01)plot(thetaseq, L_theta(k1, k2, k3, theta = thetaseq), ylab =expression(L(theta)), xlab ="theta")# Maximum likelihood estimator(mle <- (k1 +0.5*k2) / (k1+k2+k3))
[1] 0.75
Code
abline(v = mle, col ="blue", lwd =2)
The \(p_i\) are then:
Code
(p1 = mle^2)
[1] 0.5625
Code
(p2 =2* mle * (1- mle))
[1] 0.375
Code
(p3 = (1- mle)^2)
[1] 0.0625
Code
p1 + p2 + p3
[1] 1
Exercise 5 (EM Algorithm and Mixture Models)
The following table provides the number of patients (K ∈ {0, 1, 2, 3, 4, …}) in a hospital that tested positive for a certain bacterium in a given day. The frequency (\(n_k\)) represents the number of times that exactly \(k\) patients tested positive. Assume that the frequency is constant over time and the infections are independent and uncorrelated.
Reminder: E-step: create a function for the expectation of the log-likelihood, evaluated using the current estimate for the parameters. M-step: compute parameters maximizing the expected log-likelihood found on the E-step.
Infected patients data
Number of patients (k)
0
1
2
3
4
5
6
7
8
9
Frequency (\(n_k\))
162
267
271
185
111
61
27
8
3
1
a) Poisson distribution
Let \(Y_i\) be the number of infected patients on the \(i\)th day.
Fit a Poisson distribution to the data.
NotePMF (probability mass function)
Let \(Y_i \overset{iid}{\sim} Poisson (\lambda)\) with \(i=1,...,n\).
We can evaluate the goodness of fit with a chi squared critical value.
\[
\chi^2 = \sum{\frac{(O_i-E_i)^2}{E_i}}
\]
For this, we need the probability density values from before.
Since the probabilities must add up to one, we add a 10th category.
Code
infection_new <-data.frame(k =0:10,freq =c(infection_info$freq, 0),fitted_prob =c(fitted_probs, 1-sum(fitted_probs)))chisq.test(infection_new$freq, p = infection_new$fitted_prob)
Chi-squared test for given probabilities
data: infection_new$freq
X-squared = 27.069, df = 10, p-value = 0.00254
NoteIs the fitted Poisson distribution a good approximation of the data?
\(H_0: Y_i \sim Poisson (\hat{\lambda}_{MLE})\)
\(\rightarrow\) Null-hypothesis must be rejected for common significance levels.
b) Poisson mixture model
Assume that there is evidence for seasonal variation in the incidence of infection. There are likely to be different patterns in winter and summer, for example.
Assuming a mixture of two Poisson distributions, write down the likelihood for the observed data \(L(\theta|Y_{obs})\)
NoteProbability mass function
PMF of a mixture of two Poisson distributions with rates \(\lambda_1\) and \(\lambda_2\), and weight \(p\) of the first component:
Compute the likelihood and the log-likelihood for the unobserved data \(L(\theta|Y, Z)\). Denote by \(m_k\) the number of days where exactly \(k\) patients tested positive on summer and \(n_k - m_k\) on winter.
NotePMF of Z
From \(Z_i \sim Bin(1, p)\) follows:
\[
p(z_i) = p^{z_i} (1-p)^{1-zi}
\]
NoteProbability of observing a certain \(y_i\) given the corresponding \(z_i\)
\[
log(p(\textbf{y})) = \sum_{i=1}^n log\left(p \frac{\lambda_1^{y_i}}{y_i!} exp (-\lambda_1) + (1 - p) \frac{\lambda_2^{y_i}}{y_i!} exp (-\lambda_2)\right)
\] Unfortunately, the log-Likelihood would be difficult to maximize because there is a sum inside the log.
We therefore assume that the \(z_i\) were given and consider the joint probability of \(y_i\) and \(z_i\):
Since \(m_k\) is the number of days where exactly \(k\) patients tested positive: \[
L(\theta) = \prod_{k=0}^{\infty} p^{m_k} (1-p)^{n_k - m_k} \Bigg(\frac{\lambda_1^{k}}{k!} exp(-\lambda_1) \Bigg)^{m_k} \Bigg(\frac{\lambda_2^{k}}{k!} exp(-\lambda_2) \Bigg)^{n_k - m_k}
\]
Note: \({p_k}^{(l)}\) is also used in the computation of \({m_k}^{(l)} = \mathbb{E}(m_k|Y, \theta^{(l)})\) in the E-step.
Reminder: E-step: create a function for the expectation of the log-likelihood, evaluated using the current estimate for the parameters. M-step: compute parameters maximizing the expected log-likelihood found on the E-step.
In the E-step of the \(l\)th iteration, we assume that \(\theta^{(l)} = (p^{(l)}, {\lambda_1}^{(l)}, {\lambda_2}^{(l)})\) is given. For \(l=1\) we use an initial estimate for \(\theta\).
Given that \(\theta\) is known, we evaluate the membership weights in the E-step.
The posterior probability that a day with exactly \(k\) infections belongs to the summer season, given the current parameters:
\(p^{(l)}\) is the probability that a day belongs to the summer season
\(\frac{(\lambda_1^{(l)})^k}{k} exp(-\lambda_1^{(l)})\) is the Poisson probability of observing \(k\) infections given the summer season infection rate \(\lambda_1^{(l)}\)
The numerator computes the joint probability of observing \(k\) infections and being a summer day.
The denominator sums the joint probabilities for both the summer and winter.
\(\Rightarrow\) Expected count of days with \(k\) infections attributed to the summer:
\[
m_k^{(l)} = n_kp_k^{(l)}
\]
e) M-step
Given \({m_k}^{(l)} = \mathbb{E}(m_k|Y, \theta^{(l)}) = n_k {p_k}^{(l)}\), obtain \(p^{(l+1)}\), \({\lambda_1}^{(l+1)}\) and \({\lambda_2}^{(l+1)}\).
Hint\(_2\): MSMB Question 4.19
NoteM-step
Substituting \(m_k^{(l)}\) for \(m_k\) in \(l (\theta|Y, Z)\), we will get estimates for the parameters \(p\), \(\lambda_1\), and \(\lambda_2\) (maximize by setting the derivative to zero).
When we want to perform a chi-square test, we need expected values to compare our results with. Therefore, we simulate data from the Poisson mixture model with the estimated parameters.
There used to be a package “MixtureInf” for this task, which is not available on CRAN anymore. We therefore write our own function.
Code
rmix.pois <-function(n, probs, theta) {# n: number of samples# probs: vector of mixture probabilities# theta: vector of Poisson parameters (lambdas)# Determine which component each sample comes from components <-sample(1:length(probs), n, replace =TRUE, prob = probs)# Generate samples from Poisson distributions based on selected componentssapply(components, function(x) rpois(1, lambda = theta[x]))}
Code
nsamp <-sum(infection_info$freq)# Simulate 100 data sets with the Poisson mixture model# The columns contain the days from 0 to 15mix_tab_mat <-matrix(0, nrow =100, ncol =16)colnames(mix_tab_mat) <-0:15set.seed(18)for (i in1:100) { mix_samp <-rmix.pois(n = nsamp,probs =c(em_param$p, 1-em_param$p),theta =c(em_param$lambda_1, em_param$lambda_2)) mix_tab <-table(mix_samp) mix_tab_mat[i, 1:length(mix_tab)] <- mix_tab}mix_tab_mat[1:10, ]
Chi-squared test for given probabilities
data: infection_info$freq
X-squared = 1.3412, df = 9, p-value = 0.9982
Exercise 6 (High quality graphics and mixture models)
In this exercise, we will follow the MSMB book to generate some high quality graphs using the ggplot2 package. Finally, we will fit a Gaussian Mixture Model to a sample of a real gene expression data set.
a) DNase data set
We start with a low dimensional data set to make familiar with the ggplot2 package. This exercise follows MSMB chapter 3.2.
Familiarize yourself with the DNase data set that comes with the R base package.
It contains data from an enzyme-linked immunosorbent assay (ELISA), a laboratory technique used for detecting and quantifying substances such as peptides, proteins, antibodies, and hormones.
The assay was used to quantify the activity of the enzyme deoxyribonuclease (DNase), which degrades DNA. The object DNase is a dataframe whose columns are
Run, the assay run
conc, the protein concentration that was used
density, the measured optical density
Use the R base plot function plot() to generate the following plots:
Scatterplot of concentration vs. density
Histogram of the density
Boxplot of the density values stratified by the assay run
Then produce the same plot types using the ggplot2 package.
# Scatterplot of concentration vs. densityplot(density ~ conc, data = DNase, xlab ="Protein concentration")
Code
# Histogram of the densityhist(DNase$density, breaks=25, main ="")
Code
# Boxplot of the densities by Run# (Sort the run variable first)DNase$Run <-factor(DNase$Run, levels =sort(as.numeric(levels(DNase$Run))))boxplot(density ~ Run, data = DNase)
Code
library("ggplot2")
Code
ggp <-ggplot(DNase, aes(x = conc, y = density)) ggp
Code
ggp +geom_point()
Code
ggplot(DNase, aes(x = density)) +geom_histogram()
`stat_bin()` using `bins = 30`. Pick better value `binwidth`.
Code
ggplot(DNase, aes(x = Run, y = density)) +geom_boxplot()
b) Hiiragi data set - Descriptive analysis
We continue with the high dimensional data set “Hiiragi2013” that is used in MSMB chapter 3.3.
A description of the data set given in the book:
We’ll use a gene expression microarray dataset that reports the transcriptomes of around 100 individual cells from mouse embryos at different time points in early development. The mammalian embryo starts out as a single cell, the fertilized egg. Through synchronized waves of cell divisions, the egg multiplies into a clump of cells that at first show no discernible differences between them. At some point, though, cells choose different lineages. By further and further specification, the different cell types and tissues arise that are needed for a full organism. The aim of the experiment, explained by Ohnishi et al. (2014), was to investigate the gene expression changes associated with the first symmetry breaking event in the embryo. We’ll further explain the data as we go. More details can be found in the paper and in the documentation of the Bioconductor data package Hiiragi2013.
The information provided is a mix of information about the cells (i.e., age, size and genotype of the embryo from which they were obtained) and technical information (scan date, raw data file name). By convention, time in the development of the mouse embryo is measured in days, and reported as, for instance, E3.5.
Follow MSMB chapter 3.4 to reproduce Figure 3.8, which displays the number of samples for each of the 8 groups.
Code
library("dplyr")groups =group_by(pData(x), sampleGroup) |>summarise(n =n(), color =unique(sampleColour))groups
E3.25 refers to the embryonic stage at approximately 3.25 days post-coitum
FGF4-KO stands for “Fibroblast Growth Factor 4 Knock-Out.”
FGF4 is a gene known to play critical roles in cell signaling, embryogenesis, and pattern formation.
A “knock-out” (KO) indicates that in these embryos, the FGF4 gene has been genetically deactivated or removed.
This group would be used to study the impact of the loss of FGF4 on early development.
EPI stands for “Epiblast,”
This layer of cells in the blastocyst that will eventually give rise to the embryo proper.
The label likely indicates that the gene expression data pertains to cells specifically from the epiblast layer at this stage.
PE stands for “Primitive Endoderm.”
The primitive endoderm is another important cell layer in the developing blastocyst.
It forms during the early stages of development and will eventually contribute to the formation of the yolk sac, which provides nutrients to the developing embryo and forms blood vessels.
Reproduce MSMB Figure 3.9 displaying a scatterplot of the genes “X1426642“ vs. “X1418765“. Using ggplot2, you can easily add a smooth regression line and a confidence band to the scatterplot.
Code
# data frame with expression levelsdftx =data.frame(t(Biobase::exprs(x)), pData(x))dftx[1:6, 1:4]
As the plot shows, none of the common distributions are good approximations of our data. We could fit a beta distribution to the data, but it would not take into account the bimodality of our data.
f) Gaussian mixture model
Find out if the data can be approximated by a Gaussian Mixture Model (GMM):
Fit a Gaussian mixture model to the data. Decide which number of components could be suitable.
Hint: The normalmixEM() function from mixtools package could be useful.
We first check if the distribution is unimodal or bimodal.
Code
library(LaplacesDemon)
Code
is.unimodal(cell20samp)
[1] FALSE
Code
is.bimodal(cell20samp)
[1] TRUE
Code
Modes(cell20samp)$modes
[1] 3.335109 8.076428
Code
library(mixtools)
Code
set.seed(12345)# EM algorithm for normal mixture modelsmixmod <-normalmixEM(cell20samp, k=2, # 2 componentsmaxit=100, # max number of iterationsepsilon=0.01) # convergence criterion
number of iterations= 23
Code
summary(mixmod)
summary of normalmixEM object:
comp 1 comp 2
lambda 0.666015 0.333985
mu 3.390941 7.431864
sigma 0.997651 2.340436
loglik at estimate: -10553.74