A quantitative approach for polymerase chain reactions based on a hidden Markov model

Polymerase chain reaction (PCR) is a major DNA amplification technology from molecular biology. The quantitative analysis of PCR aims at determining the initial amount of the DNA molecules from the observation of typically several PCR amplifications curves. The mainstream observation scheme of the DNA amplification during PCR involves fluorescence intensity measurements. Under the classical assumption that the measured fluorescence intensity is proportional to the amount of present DNA molecules, and under the assumption that these measurements are corrupted by an additive Gaussian noise, we analyze a single amplification curve using a hidden Markov model(HMM). The unknown parameters of the HMM may be separated into two parts. On the one hand, the parameters from the amplification process are the initial number of the DNA molecules and the replication efficiency, which is the probability of one molecule to be duplicated. On the other hand, the parameters from the observational scheme are the scale parameter allowing to convert the fluorescence intensity into the number of DNA molecules and the mean and variance characterizing the Gaussian noise. We use the maximum likelihood estimation procedure to infer the unknown parameters of the model from the exponential phase of a single amplification curve, the main parameter of interest for quantitative PCR being the initial amount of the DNA molecules. An illustrative example is provided. This research was financed by the Swedish foundation for Strategic Research through the Gothenburg Mathematical Modelling Centre.     

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.     

应用马尔科夫链模型对草地螟发生程度的预测

草地螟Loxostege stictialis L.是我国北方农牧业生产上一种重要迁飞性、暴发性害虫,一旦暴发会给当地农牧生产造成严重危害.根据康保县1977-2008年1代草地螟幼虫发生程度的时间序列资料,应用马尔科夫链的转移概率预测法,构建了1～3阶转移概率矩阵,组建模型对该县2009-2011年1代草地螟发生程度进行了预测,结果与大田实际发生情况完全一致,准确率100％.对1980-2011年的历史资料进行回检,历史符合率89.9％,该方法可对草地螟进行长期预报,为草地螟长期预报提供了一种准确有效的方法,对草地螟发生程度的长期预报具有重要指导意义.     

基于马尔可夫链的基因芯片特异性探针选择方法

对于基因表达芯片,特异性探针的选择是探针设计的重要环节,由于基因组序列数据量极大,不可能对每个候选探针都在全序列中进行特异性评价并进行取舍。对此问题,提出了一种采用马尔可夫链概率准则的探针特异性选择方法,即把基因组序列看作马尔可夫链,任何探针序列的互补序列作为它的一个子序列,都具有一定的出现概率,概率越小,越可能具有特异性。据此,选择其中概率最小的N个候选探针,能够大大减少进行特异性评价的探针数量,缩短探针设计的计算时间。对实际数据的测试结果表明,该方法选择的探针具有很高的特异性。     

A Markov chain occurring in enzyme kinetics

A certain Markov chain which was encountered by T. L. Hill in the study of the kinetics of a linear array of enzymes is studied. An explicit formula for the steady state probabilities is given and some conjectures raised by T. L. Hill are proved.     

Detecting recombination in 4-taxa DNA sequence alignments with Bayesian hidden Markov models and Markov chain Monte Carlo

This article presents a statistical method for detecting recombination in DNA sequence alignments, which is based on combining two probabilistic graphical models: (1) a taxon graph (phylogenetic tree) representing the relationship between the taxa, and (2) a site graph (hidden Markov model) representing interactions between different sites in the DNA sequence alignments. We adopt a Bayesian approach and sample the parameters of the model from the posterior distribution with Markov chain Monte Carlo, using a Metropolis-Hastings and Gibbs-within-Gibbs scheme. The proposed method is tested on various synthetic and real-world DNA sequence alignments, and we compare its performance with the established detection methods RECPARS, PLATO, and TOPAL, as well as with two alternative parameter estimation schemes.     

Reversible jump Markov chain Monte Carlo computation and Bayesian model determination

Markov chain Monte Carlo methods for Bayesian computation haveuntil recently been restricted to problems where the joint distributionof all variables has a density with respect to some fixed standardunderlying measure. They have therefore not been available forapplication to Bayesian model determination, where the dimensionalityof the parameter vector is typically not fixed. This paper proposesa new framework for the construction of reversible Markov chainsamplers that jump between parameter subspaces of differingdimensionality, which is flexible and entirely constructive.It should therefore have wide applicability in model determinationproblems. The methodology is illustrated with applications tomultiple change-point analysis in one and two dimensions, andto a Bayesian comparison of binomial experiments.     

Implementation of a Markov model for phylogenetic trees

A recently developed mathematical model for the analysis of phylogenetic trees is applied to comparative data for 48 species. The model represents a return to fundamentals and makes no hypothesis with respect to the reversibility of the process. The species have been analysed in all subsets of three, and a measure of reliability of the results is provided. The numerical results of the computations on 17,296 triples of species are made available on the Internet. These results are discussed and the development of reliable tree structures for several species is illustrated. It is shown that, indeed, the Markov model is capable of considerably more interesting predictions than has been recognized to date.     

Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains

The most commonly used models for analysing local dependencies in DNA sequences are (high-order) Markov chains. Incorporating knowledge relative to the possible grouping of the nucleotides enables to define dedicated sub-classes of Markov chains. The problem of formulating lumpability hypotheses for a Markov chain is therefore addressed. In the classical approach to lumpability, this problem can be formulated as the determination of an appropriate state space (smaller than the original state space) such that the lumped chain defined on this state space retains the Markov property. We propose a different perspective on lumpability where the state space is fixed and the partitioning of this state space is represented by a one-to-many probabilistic function within a two-level stochastic process. Three nested classes of lumped processes can be defined in this way as sub-classes of first-order Markov chains. These lumped processes enable parsimonious reparameterizations of Markov chains that help to reveal relevant partitions of the state space. Characterizations of the lumped processes on the original transition probability matrix are derived. Different model selection methods relying either on hypothesis testing or on penalized log-likelihood criteria are presented as well as extensions to lumped processes constructed from high-order Markov chains. The relevance of the proposed approach to lumpability is illustrated by the analysis of DNA sequences. In particular, the use of lumped processes enables to highlight differences between intronic sequences and gene untranslated region sequences.