A Monte Carlo method for Bayesian analysis of linkage between single markers and quantitative trait loci. II. A simulation study

A Bayesian approach to the statistical mapping of Quantitative Trait Loci (QTLs) using single markers was implemented via Markov Chain Monte Carlo (MCMC) algorithms for parameter estimation and hypothesis testing. Parameters were estimated by marginal posterior means computed with a Gibbs sampler with data augmentation. Variables sampled included the augmented data (marker-QTL genotypes, polygenic effects), the event of linkage or nonlinkage, and the parameters (allele frequencies, QTL substitution effect, recombination rate, polygenic and residual variances). The analysis was evaluated empirically via application to simulated granddaughter designs consisting of 2000 sons, 20 related sires and their ancestors. Results obtained in this study and preliminary work on multiple linked markers and multiple QTLs support the usefulness of the Bayesian method for the statistical mapping of QTLs.     

Bayesian analysis of linkage between genetic markers and quantitative trait loci. I. Prior knowledge

Summary Prior information on gene effects at individual quantitative trait loci (QTL) and on recombination rates between marker loci and QTL is derived. The prior distribution of QTL gene effects is assumed to be exponential with major effects less likely than minor ones. The prior probability of linkage between a marker and another single locus is a function of the number and length of chromosomes, and of the map function relating recombination rate to genetic distance among loci. The prior probability of linkage between a marker locus and a quantitative trait depends additionally on the number of detectable QTL, which may be determined from total additive genetic variance and minimum detectable QTL effect. The use of this prior information should improve linkage tests and estimates of QTL effects.     

Bayesian point estimation of quantitative trait loci

In this article, we consider the problem of the estimation of quantitative trait loci (QTL), those chromosomal regions at which genetic information affecting some quantitative trait is encoded. Generally the number of such encoding sites is unknown, and associations between neutral molecular marker genotypes and observed trait phenotypes are sought to locate them. We consider a Bayesian model for simple experimental designs, and discuss the existing approaches to inference for this problem. In particular, we focus on locating positions of the best candidate markers segregating for the trait, a situation which is of primary interest in comparative mapping. We introduce a loss function for estimating both the number of QTL and their location, and we illustrate its application via simulated and real data.     

Bayesian analysis of linkage between genetic markers and quantitative trait loci. II. Combining prior knowledge with experimental evidence

Summary A Bayesian method was developed for identifying genetic markers linked to quantitative trait loci (QTL) by analyzing data from daughter or granddaughter designs and single markers or marker pairs. Traditional methods may yield unrealistic results because linkage tests depend on number of markers and QTL gene effects associated with selected markers are overestimated. The Bayesian or posterior probability of linkage combines information from a daughter or granddaughter design with the prior probability of linkage between a marker locus and a QTL. If the posterior probability exceeds a certain quantity, linkage is declared. Upon linkage acceptance, Bayesian estimates of marker-QTL recombination rate and QTL gene effects and frequencies are obtained. The Bayesian estimates of QTL gene effects account for different amounts of information by shrinking information from data toward the mean or mode of a prior exponential distribution of gene effects. Computation of the Bayesian analysis is feasible. Exact results are given for biallelic QTL, and extensions to multiallelic QTL are suggested.     

Bayesian phylogeny analysis via stochastic approximation Monte Carlo

Monte Carlo methods have received much attention in the recent literature of phylogeny analysis. However, the conventional Markov chain Monte Carlo algorithms, such as the Metropolis–Hastings algorithm, tend to get trapped in a local mode in simulating from the posterior distribution of phylogenetic trees, rendering the inference ineffective. In this paper, we apply an advanced Monte Carlo algorithm, the stochastic approximation Monte Carlo algorithm, to Bayesian phylogeny analysis. Our method is compared with two popular Bayesian phylogeny software, BAMBE and MrBayes, on simulated and real datasets. The numerical results indicate that our method outperforms BAMBE and MrBayes. Among the three methods, SAMC produces the consensus trees which have the highest similarity to the true trees, and the model parameter estimates which have the smallest mean square errors, but costs the least CPU time.     

Bayesian joint mapping of quantitative trait loci for Gaussian and categorical characters in line crosses

Methodology for joint mapping of quantitative trait loci (QTL) affecting continuous and binary characters in experimental crosses is presented. The procedure consists of a Bayesian Gaussian-threshold model implemented via Markov chain Monte Carlo, which bypasses bottlenecks due to high-dimensional integrals required in maximum likelihood approaches. The method handles multiple binary traits and multiple QTL. Modeling of ordered categorical traits is discussed as well. Features of the method are illustrated using simulated datasets representing a backcross design, and the data are analyzed using mixed-trait and single-trait models. The mixed-trait analysis provides greater detection power of a QTL than a single-trait analysis when the QTL affects two or more traits. The number of QTL inferred in the mixed-trait analysis does not pertain to a specific trait, but the roles of each QTL on specific traits can be assessed from estimates of its effects. The impacts of varying incidence level and sample size on the mixed-trait QTL mapping analysis are investigated as well.     

Linkage analysis of quantitative trait loci in multiple line crosses

Simple line crosses, for example, backcross and F₂, are commonly used in mapping quantitative trait loci (QTL). However, these simple crosses are rarely used alone in commercial plant breeding; rather, crosses involving multiple inbred lines or several simple crosses but connected by shared inbred lines may be common in plant breeding. Mapping QTL using crosses of multiple lines is more relevant to plant breeding. Unfortunately, current statistical methods and computer programs of QTL mapping are all designed for simple line crosses or multiple line crosses but under a regular mating system. It is not straightforward to extend the existing methods to handle multiple line crosses under irregular and complicated mating designs. The major hurdle comes from irregular inbreeding, multiple generations, and multiple alleles. In this study, we develop a Bayesian method implemented via the Markov chain Monte Carlo (MCMC) algorithm for mapping QTL using complicated multiple line crosses. With the MCMC algorithm, we are able to draw a complete path of the gene flow from founder alleles to their descendents via a recursive process. This has greatly simplified the problem caused by irregular mating and inbreeding in the mapping population. Adopting the reversible jump MCMC algorithm, we are able to simultaneously search for multiple QTL along the genome. We can even infer the posterior distribution of the number of QTL, one of the most important parameters in QTL study. Application of the new MCMC based QTL mapping procedure is demonstrated using two different mating designs. Design I involves two inbred lines and their derived F₁, F₂, and BC populations. Design II is a half-diallel cross involving three inbred lines. The two designs appear different, but can be handled with the same robust computer program.     

A Bayesian approach to ordering gene markers

A technique is presented whereby a marker map can be constructed using resource family data with an entire class of missing data. The focus is on a half-sib design where there is only information on a single parent and its progeny. A Bayesian approach is utilised with solutions obtained via a Markov chain Monte Carlo algorithm. Features of the approach include the capacity to determine parameters for the ungenotyped dam population, the ability to incorporate published information and its reliability, and the production of posterior densities and the consequent deduction of a wide range of inferences. These features are demonstrated through the analysis of simulated and experimental data.     

Bayesian phylogenetic model selection using reversible jump Markov chain Monte Carlo

A common problem in molecular phylogenetics is choosing a model of DNA substitution that does a good job of explaining the DNA sequence alignment without introducing superfluous parameters. A number of methods have been used to choose among a small set of candidate substitution models, such as the likelihood ratio test, the Akaike Information Criterion (AIC), the Bayesian Information Criterion (BIC), and Bayes factors. Current implementations of any of these criteria suffer from the limitation that only a small set of models are examined, or that the test does not allow easy comparison of non-nested models. In this article, we expand the pool of candidate substitution models to include all possible time-reversible models. This set includes seven models that have already been described. We show how Bayes factors can be calculated for these models using reversible jump Markov chain Monte Carlo, and apply the method to 16 DNA sequence alignments. For each data set, we compare the model with the best Bayes factor to the best models chosen using AIC and BIC. We find that the best model under any of these criteria is not necessarily the most complicated one; models with an intermediate number of substitution types typically do best. Moreover, almost all of the models that are chosen as best do not constrain a transition rate to be the same as a transversion rate, suggesting that it is the transition/transversion rate bias that plays the largest role in determining which models are selected. Importantly, the reversible jump Markov chain Monte Carlo algorithm described here allows estimation of phylogeny (and other phylogenetic model parameters) to be performed while accounting for uncertainty in the model of DNA substitution.     

Sequential sampling in determining linkage between marker loci and quantitative trait loci

Summary As compared to classical, fixed sample size techniques, simulation studies showed that a proposed sequential sampling procedure can provide a substantial decrease (up to 50%, in some cases) in the mean sample size required for the detection of linkage between marker loci and quantitative trait loci. Sequential sampling with truncation set at the required sample size for the non-sequential test, produced a modest further decrease in mean sample size, accompanied by a modest increase in error probabilities. Sequential sampling with observations taken in groups produced a noticeable increase in mean sample size, with a considerable decrease in error probabilities, as compared to straightforward sequential sampling. It is concluded that sequential sampling has a particularly useful application to experiments aimed at investigating the genetics of differences between lines or strains that differ in some single outstanding trait.     

A comparison of strategies for Markov chain Monte Carlo computation in quantitative genetics

In quantitative genetics, Markov chain Monte Carlo (MCMC) methods are indispensable for statistical inference in non-standard models like generalized linear models with genetic random effects or models with genetically structured variance heterogeneity. A particular challenge for MCMC applications in quantitative genetics is to obtain efficient updates of the high-dimensional vectors of genetic random effects and the associated covariance parameters. We discuss various strategies to approach this problem including reparameterization, Langevin-Hastings updates, and updates based on normal approximations. The methods are compared in applications to Bayesian inference for three data sets using a model with genetically structured variance heterogeneity.     

A tutorial introduction to Bayesian inference for stochastic epidemic models using Markov chain Monte Carlo methods

Recent Bayesian methods for the analysis of infectious disease outbreak data using stochastic epidemic models are reviewed. These methods rely on Markov chain Monte Carlo methods. Both temporal and non-temporal data are considered. The methods are illustrated with a number of examples featuring different models and datasets.     

Phylogenetic tree construction using sequential stochastic approximation Monte Carlo

Monte Carlo methods have received much attention recently in the literature of phylogenetic tree construction. However, they often suffer from two difficulties, the curse of dimensionality and the local-trap problem. The former one is due to that the number of possible phylogenetic trees increases at a super-exponential rate as the number of taxa increases. The latter one is due to that the phylogenetic tree has often a rugged energy landscape. In this paper, we propose a new phylogenetic tree construction method, which attempts to alleviate these two difficulties simultaneously by making use of the sequential structure of phylogenetic trees in conjunction with stochastic approximation Monte Carlo (SAMC) simulations. The use of the sequential structure of the problem provides substantial help to reduce the curse of dimensionality in simulations, and SAMC effectively prevents the system from getting trapped in local energy minima. The new method is compared with a variety of existing Bayesian and non-Bayesian methods on simulated and real datasets. Numerical results are in favor of the new method in terms of quality of the resulting phylogenetic trees.     

Bayesian analysis of amino acid substitution models

Models of amino acid substitution present challenges beyond those often faced with the analysis of DNA sequences. The alignments of amino acid sequences are often small, whereas the number of parameters to be estimated is potentially large when compared with the number of free parameters for nucleotide substitution models. Most approaches to the analysis of amino acid alignments have focused on the use of fixed amino acid models in which all of the potentially free parameters are fixed to values estimated from a large number of sequences. Often, these fixed amino acid models are specific to a gene or taxonomic group (e.g. the Mtmam model, which has parameters that are specific to mammalian mitochondrial gene sequences). Although the fixed amino acid models succeed in reducing the number of free parameters to be estimated--indeed, they reduce the number of free parameters from approximately 200 to 0--it is possible that none of the currently available fixed amino acid models is appropriate for a specific alignment. Here, we present four approaches to the analysis of amino acid sequences. First, we explore the use of a general time reversible model of amino acid substitution using a Dirichlet prior probability distribution on the 190 exchangeability parameters. Second, we then explore the behaviour of prior probability distributions that are'centred' on the rates specified by the fixed amino acid model. Third, we consider a mixture of fixed amino acid models. Finally, we consider constraints on the exchangeability parameters as partitions,similar to how nucleotide substitution models are specified, and place a Dirichlet process prior model on all the possible partitioning schemes.     

A Bayesian method for analysing spotted microarray data

In the decade since their invention, spotted microarrays have been undergoing technical advances that have increased the utility, scope and precision of their ability to measure gene expression. At the same time, more researchers are taking advantage of the fundamentally quantitative nature of these tools with refined experimental designs and sophisticated statistical analyses. These new approaches utilise the power of microarrays to estimate differences in gene expression levels, rather than just categorising genes as up- or down-regulated, and allow the comparison of expression data across multiple samples. In this review, some of the technical aspects of spotted microarrays that can affect statistical inference are highlighted, and a discussion is provided of how several methods for estimating gene expression level across multiple samples deal with these challenges. The focus is on a Bayesian analysis method, BAGEL, which is easy to implement and produces easily interpreted results.     

Estimation of amino acid residue substitution rates at local spatial regions and application in protein function inference: a Bayesian Monte Carlo approach

The amino acid sequences of proteins provide rich information for inferring distant phylogenetic relationships and for predicting protein functions. Estimating the rate matrix of residue substitutions from amino acid sequences is also important because the rate matrix can be used to develop scoring matrices for sequence alignment. Here we use a continuous time Markov process to model the substitution rates of residues and develop a Bayesian Markov chain Monte Carlo method for rate estimation. We validate our method using simulated artificial protein sequences. Because different local regions such as binding surfaces and the protein interior core experience different selection pressures due to functional or stability constraints, we use our method to estimate the substitution rates of local regions. Our results show that the substitution rates are very different for residues in the buried core and residues on the solvent-exposed surfaces. In addition, the rest of the proteins on the binding surfaces also have very different substitution rates from residues. Based on these findings, we further develop a method for protein function prediction by surface matching using scoring matrices derived from estimated substitution rates for residues located on the binding surfaces. We show with examples that our method is effective in identifying functionally related proteins that have overall low sequence identity, a task known to be very challenging.     

Trait-based analyses for the detection of linkage between marker loci and quantitative trait loci in crosses between inbred lines

Summary Methods are presented for determining linkage between a marker locus and a nearby locus affecting a quantitative trait (quantitative trait locus=QTL), based on changes in the marker allele frequencies in selection lines derived from the F-2 of a cross between inbred lines, or in the high and low phenotypic classes of an F-2 or BC population. The power of such trait-based (TB) analyses was evaluated and compared with that of methods for determining linkage based on the mean quantitative trait value of marker genotypes in F-2 or BC populations [marker-based (MB) analyses]. TB analyses can be utilized for marker-QTL linkage determination in situations where the MB analysis is not applicable, including analysis of polygenic resistance traits where only a part of the population survives exposure to the Stressor and analysis of marker-allele frequency changes in selection lines. TB analyses may be a useful alternative to MB analyses when interest is centered on a single quantitative trait only and costs of scoring for markers are high compared with costs of raising and obtaining quantitative trait information on F-2 or BC individuals. In this case, a TB analysis will enable equivalent power to be obtained with fewer individuals scored for the marker, but more individuals scored for the quantitative trait. MB analyses remain the method of choice when more than one quantitative trait is to be analyzed in a given population.Contribution from the ARO, Bet Dagan, Israel. No. 1698-E, 1986 series