Brownian dynamics simulations of protein folding: Access to milliseconds time scale and beyond

Protein folding occurs on a time scale ranging from milliseconds to minutes for a majority of proteins. Computer simulation of protein folding, from a random configuration to the native structure, is nontrivial owing to the large disparity between the simulation and folding time scales. As an effort to overcome this limitation, simple models with idealized protein subdomains, e.g., the diffusion–collision model of Karplus and Weaver, have gained some popularity. We present here new results for the folding of a four-helix bundle within the framework of the diffusion–collision model. Even with such simplifying assumptions, a direct application of standard Brownian dynamics methods would consume 10,000 processor-years on current supercomputers. We circumvent this difficulty by invoking a special Brownian dynamics simulation. The method features the calculation of the mean passage time of an event from the flux overpopulation method and the sampling of events that lead to productive collisions even if their probability is extremely small (because of large free-energy barriers that separate them from the higher probability events). Using these developments, we demonstrate that a coarse-grained model of the four-helix bundle can be simulated in several days on current supercomputers. Furthermore, such simulations yield folding times that are in the range of time scales observed in experiments.

Ribosomes can slide over and beyond “hungry” codons, resuming protein chain elongation many nucleotides downstream

In cells subjected to moderate aminoacyl-tRNA limitation, the peptidyl-tRNA–ribosome complex stalled at the “hungry” codon can slide well beyond it on the messenger RNA and resume translation further downstream. This behavior is proved by unequivocal amino acid sequence data, showing a protein that lacks the bypassed sequence encoded between the hungry codon and specific landing sites. The landing sites are codons cognate to the anticodon of the peptidyl-tRNA. The efficiency of this behavior can be as high as 10–20% but declines with the length of the slide. Interposition of “trap” sites (nonproductive landing sites) in the bypassed region reduces the frequency of successful slides, confirming that the ribosome–peptidyl-tRNA complex passes through the untranslated region of the message. This behavior appears to be quite general: it can occur at the two kinds of hungry codons tested, AUA and AAG; the sliding peptidyl-tRNA can be any of three species tested, phenylalanine, tyrosine, or leucine tRNA; the peptidyl component can be either of two very different peptide sequences; and translation can resume at any of the three codons tested.

Statistical prediction of single-stranded regions in RNA secondary structure and application to predicting effective antisense target sites and beyond

Single-stranded regions in RNA secondary structure are important for RNA–RNA and RNA–protein interactions. We present a probability profile approach for the prediction of these regions based on a statistical algorithm for sampling RNA secondary structures. For the prediction of phylogenetically-determined single-stranded regions in secondary structures of representative RNA sequences, the probability profile offers substantial improvement over the minimum free energy structure. In designing antisense oligonucleotides, a practical problem is how to select a secondary structure for the target mRNA from the optimal structure(s) and many suboptimal structures with similar free energies. By summarizing the information from a statistical sample of probable secondary structures in a single plot, the probability profile not only presents a solution to this dilemma, but also reveals ‘well-determined’ single-stranded regions through the assignment of probabilities as measures of confidence in predictions. In antisense application to the rabbit β-globin mRNA, a significant correlation between hybridization potential predicted by the probability profile and the degree of inhibition of in vitro translation suggests that the probability profile approach is valuable for the identification of effective antisense target sites. Coupling computational design with DNA–RNA array technique provides a rational, efficient framework for antisense oligonucleotide screening. This framework has the potential for high-throughput applications to functional genomics and drug target validation.

Neural codes: Firing rates and beyond

Computational neuroscience has contributed significantly to our understanding of higher brain function by combining experimental neurobiology, psychophysics, modeling, and mathematical analysis. This article reviews recent advances in a key area: neural coding and information processing. It is shown that synapses are capable of supporting computations based on highly structured temporal codes. Such codes could provide a substrate for unambiguous representations of complex stimuli and be used to solve difficult cognitive tasks, such as the binding problem. Unsupervised learning rules could generate the circuitry required for precise temporal codes. Together, these results indicate that neural systems perform a rich repertoire of computations based on action potential timing.