Estimating the probability of initiated cell death before tumor induction

The effects of cell toxicity are known to be inherent in carcinogenesis induced by radiation or chemical carcinogens. The event of cell death precludes tumor induction from occurring. A long standing problem is to estimate the proportion of initiated cells that die before tumor induction. No experimental techniques are currently available for directly gauging the rate of cell death over extended periods of time. The obstacle can be surmounted by newly developed theoretical methods of carcinogenesis modeling. In this paper, we apply such methods to published data on multiple lung tumors in mice receiving different schedules of urethane. Bioassays of this type play an important role in testing environmental chemicals for carcinogenic activity. Our estimates for urethane-induced carcinogenesis show that, unexpectedly, many initiated cells die early in the course of tumor promotion. We present numerical estimates for the probability of initiated cell death for different schedules (and doses) of urethane administration.

Estimating the probability for a protein to have a new fold: A statistical computational model

Structural genomics aims to solve a large number of protein structures that represent the protein space. Currently an exhaustive solution for all structures seems prohibitively expensive, so the challenge is to define a relatively small set of proteins with new, currently unknown folds. This paper presents a method that assigns each protein with a probability of having an unsolved fold. The method makes extensive use of protomap, a sequence-based classification, and scop, a structure-based classification. According to protomap, the protein space encodes the relationship among proteins as a graph whose vertices correspond to 13,354 clusters of proteins. A representative fold for a cluster with at least one solved protein is determined after superposition of all scop (release 1.37) folds onto protomap clusters. Distances within the protomap graph are computed from each representative fold to the neighboring folds. The distribution of these distances is used to create a statistical model for distances among those folds that are already known and those that have yet to be discovered. The distribution of distances for solved/unsolved proteins is significantly different. This difference makes it possible to use Bayes' rule to derive a statistical estimate that any protein has a yet undetermined fold. Proteins that score the highest probability to represent a new fold constitute the target list for structural determination. Our predicted probabilities for unsolved proteins correlate very well with the proportion of new folds among recently solved structures (new scop 1.39 records) that are disjoint from our original training set.

A recipe for randomness

Despite many diverse theories that address closely related themes—e.g., probability theory, algorithmic complexity, cryptoanalysis, and pseudorandom number generation—a near-void remains in constructive methods certified to yield the desired “random” output. Herein, we provide explicit techniques to produce broad sets of both highly irregular finite and normal infinite sequences, based on constructions and properties derived from approximate entropy (ApEn), a computable formulation of sequential irregularity. Furthermore, for infinite sequences, we considerably refine normality, by providing methods for constructing diverse classes of normal numbers, classified by the extent to which initial segments deviate from maximal irregularity.

A conditional probability analysis of cystic fibrosis transmembrane conductance regulator gating indicates that ATP has multiple effects during the gating cycle

ATP-binding cassette (ABC) transporters bind and hydrolyze ATP. In the cystic fibrosis transmembrane conductance regulator Cl− channel, this interaction with ATP generates a gating cycle between a closed (C) and two open (O1 and O2) conformations. To understand better how ATP controls channel activity, we examined gating transitions from the C to the O1 and O2 states and from these open states to the C conformation. We made three main observations. First, we found that the channel can open into either the O1 or O2 state, that the frequency of transitions to both states was increased by ATP concentration, and that ATP increased the relative proportion of openings into O1 vs. O2. These results indicate that ATP can interact with the closed state to open the channel in at least two ways, which may involve binding to nucleotide-binding domains (NBDs) NBD1 and NBD2. Second, ATP prolonged the burst duration and altered the way in which the channel closed. These data suggest that ATP also interacts with the open channel. Third, the channel showed runs of specific types of open–closed transitions. This finding suggests a mechanism with more than one cycle of gating transitions. These data suggest models to explain how ATP influences conformational transitions in cystic fibrosis transmembrane conductance regulator and perhaps other ABC transporters.

Calculating the probability of multitaxon evolutionary trees: bootstrappers Gambit.

The reconstruction of multitaxon trees from molecular sequences is confounded by the variety of algorithms and criteria used to evaluate trees, making it difficult to compare the results of different analyses. A global method of multitaxon phylogenetic reconstruction described here, Bootstrappers Gambit, can be used with any four-taxon algorithm, including distance, maximum likelihood, and parsimony methods. It incorporates a Bayesian-Jeffreys'-bootstrap analysis to provide a uniform probability-based criterion for comparing the results from diverse algorithms. To examine the usefulness of the method, the origin of the eukaryotes has been investigated by the analysis of ribosomal small subunit RNA sequences. Three common algorithms (paralinear distances, Jukes-Cantor distances, and Kimura distances) support the eocyte topology, whereas one (maximum parsimony) supports the archaebacterial topology, suggesting that the eocyte prokaryotes are the closest prokaryotic relatives of the eukaryotes.

Enhancers increase the probability but not the level of gene expression.

We have studied enhancer function in transient and stable expression assays in mammalian cells by using systems that distinguish expressing from nonexpressing cells. When expression is studied in this way, enhancers are found to increase the probability of a construct being active but not the level of expression per template. In stably integrated constructs, large differences in expression level are observed but these are not related to the presence of an enhancer. Together with earlier studies, these results suggest that enhancers act to affect a binary (on/off) switch in transcriptional activity. Although this idea challenges the widely accepted model of enhancer activity, it is consistent with much, if not all, experimental evidence on this subject. We hypothesize that enhancers act to increase the probability of forming a stably active template. When randomly integrated into the genome, enhancers may affect a metastable state of repression/activity, permitting expression in regions that would not permit activity of an isolated promoter.