50,632 research outputs found

    Modeling vitreous silica bilayers

    Full text link
    We computer model a free-standing vitreous silica bilayer which has recently been synthesized and characterized experimentally in landmark work. Here we model the bilayer using a computer assembly procedure that starts from a single layer of amorphous graphene, generated using a bond switching algorithm from an initially crystalline graphene structure. Next each bond is decorated with an oxygen atom and the carbon atoms are relabeled as silicon. This monolayer can be now thought of as a two dimensional network of corner sharing triangles. Next each triangle is made into a tetrahedron, by raising the silicon atom above each triangle and adding an additional singly coordinated oxygen atom at the apex. The final step is to mirror reflect this layer to form a second layer and then attach the two layers together to form the bilayer. We show that this vitreous silica bilayer has the additional macroscopic degrees of freedom to easily form a network of identical corner sharing tetrahedra if there is a symmetry plane through the center of the bilayer going through the layer of oxygen ions that join the upper and lower layers. This has the consequence that the upper rings lie exactly above the lower rings, which are tilted in general. The assumption of a network of perfect corner sharing tetrahedra leads to a range of possible densities that we have previously characterized in three dimensional zeolites as a flexibility window. Finally, using a realistic potential, we have relaxed the bilayer to determine the density, and other structural characteristics such as the Si-Si pair distribution functions and the Si-O-Si bond angle distribution, which are compared to the experimental results obtained by direct imaging

    From Nonspecific DNA–Protein Encounter Complexes to the Prediction of DNA–Protein Interactions

    Get PDF
    ©2009 Gao, Skolnick. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.doi:10.1371/journal.pcbi.1000341DNA–protein interactions are involved in many essential biological activities. Because there is no simple mapping code between DNA base pairs and protein amino acids, the prediction of DNA–protein interactions is a challenging problem. Here, we present a novel computational approach for predicting DNA-binding protein residues and DNA–protein interaction modes without knowing its specific DNA target sequence. Given the structure of a DNA-binding protein, the method first generates an ensemble of complex structures obtained by rigid-body docking with a nonspecific canonical B-DNA. Representative models are subsequently selected through clustering and ranking by their DNA–protein interfacial energy. Analysis of these encounter complex models suggests that the recognition sites for specific DNA binding are usually favorable interaction sites for the nonspecific DNA probe and that nonspecific DNA–protein interaction modes exhibit some similarity to specific DNA–protein binding modes. Although the method requires as input the knowledge that the protein binds DNA, in benchmark tests, it achieves better performance in identifying DNA-binding sites than three previously established methods, which are based on sophisticated machine-learning techniques. We further apply our method to protein structures predicted through modeling and demonstrate that our method performs satisfactorily on protein models whose root-mean-square Ca deviation from native is up to 5 Å from their native structures. This study provides valuable structural insights into how a specific DNA-binding protein interacts with a nonspecific DNA sequence. The similarity between the specific DNA–protein interaction mode and nonspecific interaction modes may reflect an important sampling step in search of its specific DNA targets by a DNA-binding protein

    Minimum-complexity helicopter simulation math model

    Get PDF
    An example of a minimal complexity simulation helicopter math model is presented. Motivating factors are the computational delays, cost, and inflexibility of the very sophisticated math models now in common use. A helicopter model form is given which addresses each of these factors and provides better engineering understanding of the specific handling qualities features which are apparent to the simulator pilot. The technical approach begins with specification of features which are to be modeled, followed by a build up of individual vehicle components and definition of equations. Model matching and estimation procedures are given which enable the modeling of specific helicopters from basic data sources such as flight manuals. Checkout procedures are given which provide for total model validation. A number of possible model extensions and refinement are discussed. Math model computer programs are defined and listed
    • …
    corecore