24 research outputs found

    Verification of the Crooks fluctuation theorem and recovery of RNA folding free energies

    Full text link
    The description of nonequilibrium processes in nano-sized objects, where the typical energies involved are a few times, is increasingly becoming central to disciplines as diverse as condensed-matter physics, materials science, and biophysics. Major recent developments towards a unified treatment of arbitrarily large fluctuations in small systems are described by fluctuation theorems that relate the probabilities of a system absorbing from or releasing to the bath a given amount of energy in a nonequilibrium process. Here we experimentally verify the Crooks Fluctuation Theorem (CFT) under weak and strong nonequilibrium conditions by using optical tweezers to measure the irreversible mechanical work during the unfolding and refolding of a small RNA hairpin and an RNA three-helix junction. We also show that the CFT provides a powerful way to obtain folding free energies in biomolecules by determining the crossing between the unfolding and refolding irreversible work distributions. The method makes it possible to obtain folding free energies in nonequilibrium processes that dissipate up to of the average total work exerted, thereby paving the way for reconstructing free energy landscapes along reaction coordinates in nonequilibrium single-molecule experiments.Comment: PDF file, 19 pages. Supplementary information available online at www.nature.co

    Phylo: A Citizen Science Approach for Improving Multiple Sequence Alignment

    Get PDF
    BACKGROUND: Comparative genomics, or the study of the relationships of genome structure and function across different species, offers a powerful tool for studying evolution, annotating genomes, and understanding the causes of various genetic disorders. However, aligning multiple sequences of DNA, an essential intermediate step for most types of analyses, is a difficult computational task. In parallel, citizen science, an approach that takes advantage of the fact that the human brain is exquisitely tuned to solving specific types of problems, is becoming increasingly popular. There, instances of hard computational problems are dispatched to a crowd of non-expert human game players and solutions are sent back to a central server. METHODOLOGY/PRINCIPAL FINDINGS: We introduce Phylo, a human-based computing framework applying "crowd sourcing" techniques to solve the Multiple Sequence Alignment (MSA) problem. The key idea of Phylo is to convert the MSA problem into a casual game that can be played by ordinary web users with a minimal prior knowledge of the biological context. We applied this strategy to improve the alignment of the promoters of disease-related genes from up to 44 vertebrate species. Since the launch in November 2010, we received more than 350,000 solutions submitted from more than 12,000 registered users. Our results show that solutions submitted contributed to improving the accuracy of up to 70% of the alignment blocks considered. CONCLUSIONS/SIGNIFICANCE: We demonstrate that, combined with classical algorithms, crowd computing techniques can be successfully used to help improving the accuracy of MSA. More importantly, we show that an NP-hard computational problem can be embedded in casual game that can be easily played by people without significant scientific training. This suggests that citizen science approaches can be used to exploit the billions of "human-brain peta-flops" of computation that are spent every day playing games. Phylo is available at: http://phylo.cs.mcgill.ca

    Computational Fragment-Based Binding Site Identification by Ligand Competitive Saturation

    Get PDF
    Fragment-based drug discovery using NMR and x-ray crystallographic methods has proven utility but also non-trivial time, materials, and labor costs. Current computational fragment-based approaches circumvent these issues but suffer from limited representations of protein flexibility and solvation effects, leading to difficulties with rigorous ranking of fragment affinities. To overcome these limitations we describe an explicit solvent all-atom molecular dynamics methodology (SILCS: Site Identification by Ligand Competitive Saturation) that uses small aliphatic and aromatic molecules plus water molecules to map the affinity pattern of a protein for hydrophobic groups, aromatic groups, hydrogen bond donors, and hydrogen bond acceptors. By simultaneously incorporating ligands representative of all these functionalities, the method is an in silico free energy-based competition assay that generates three-dimensional probability maps of fragment binding (FragMaps) indicating favorable fragment∶protein interactions. Applied to the two-fold symmetric oncoprotein BCL-6, the SILCS method yields two-fold symmetric FragMaps that recapitulate the crystallographic binding modes of the SMRT and BCOR peptides. These FragMaps account both for important sequence and structure differences in the C-terminal halves of the two peptides and also the high mobility of the BCL-6 His116 sidechain in the peptide-binding groove. Such SILCS FragMaps can be used to qualitatively inform the design of small-molecule inhibitors or as scoring grids for high-throughput in silico docking that incorporate both an atomic-level description of solvation and protein flexibility
    corecore