Quantitative modeling of stochastic systems in molecular biology by using stochastic Petri nets

An integrated understanding of molecular and developmental biology must consider the large number of molecular species involved and the low concentrations of many species in vivo. Quantitative stochastic models of molecular interaction networks can be expressed as stochastic Petri nets (SPNs), a mathematical formalism developed in computer science. Existing software can be used to define molecular interaction networks as SPNs and solve such models for the probability distributions of molecular species. This approach allows biologists to focus on the content of models and their interpretation, rather than their implementation. The standardized format of SPNs also facilitates the replication, extension, and transfer of models between researchers. A simple chemical system is presented to demonstrate the link between stochastic models of molecular interactions and SPNs. The approach is illustrated with examples of models of genetic and biochemical phenomena where the UltraSAN package is used to present results from numerical analysis and the outcome of simulations.

Generalized flows, intrinsic stochasticity, and turbulent transport

The study of passive scalar transport in a turbulent velocity field leads naturally to the notion of generalized flows, which are families of probability distributions on the space of solutions to the associated ordinary differential equations which no longer satisfy the uniqueness theorem for ordinary differential equations. Two most natural regularizations of this problem, namely the regularization via adding small molecular diffusion and the regularization via smoothing out the velocity field, are considered. White-in-time random velocity fields are used as an example to examine the variety of phenomena that take place when the velocity field is not spatially regular. Three different regimes, characterized by their degrees of compressibility, are isolated in the parameter space. In the regime of intermediate compressibility, the two different regularizations give rise to two different scaling behaviors for the structure functions of the passive scalar. Physically, this means that the scaling depends on Prandtl number. In the other two regimes, the two different regularizations give rise to the same generalized flows even though the sense of convergence can be very different. The “one force, one solution” principle is established for the scalar field in the weakly compressible regime, and for the difference of the scalar in the strongly compressible regime, which is the regime of inverse cascade. Existence and uniqueness of an invariant measure are also proved in these regimes when the transport equation is suitably forced. Finally incomplete self similarity in the sense of Barenblatt and Chorin is established.

Training and search methods for speech recognition.

Speech recognition involves three processes: extraction of acoustic indices from the speech signal, estimation of the probability that the observed index string was caused by a hypothesized utterance segment, and determination of the recognized utterance via a search among hypothesized alternatives. This paper is not concerned with the first process. Estimation of the probability of an index string involves a model of index production by any given utterance segment (e.g., a word). Hidden Markov models (HMMs) are used for this purpose [Makhoul, J. & Schwartz, R. (1995) Proc. Natl. Acad. Sci. USA 92, 9956-9963]. Their parameters are state transition probabilities and output probability distributions associated with the transitions. The Baum algorithm that obtains the values of these parameters from speech data via their successive reestimation will be described in this paper. The recognizer wishes to find the most probable utterance that could have caused the observed acoustic index string. That probability is the product of two factors: the probability that the utterance will produce the string and the probability that the speaker will wish to produce the utterance (the language model probability). Even if the vocabulary size is moderate, it is impossible to search for the utterance exhaustively. One practical algorithm is described [Viterbi, A. J. (1967) IEEE Trans. Inf. Theory IT-13, 260-267] that, given the index string, has a high likelihood of finding the most probable utterance.