68 research outputs found

    Binary Assignments of Amino Acids from Pattern Conservation

    Full text link
    We develop a simple optimization procedure for assigning binary values to the amino acids. The binary values are determined by a maximization of the degree of pattern conservation in groups of closely related protein sequences. The maximization is carried out at fixed composition. For compositions approximately corresponding to an equipartition of the residues, the optimal encoding is found to be strongly correlated with hydrophobicity. The stability of the procedure is demonstrated. Our calculations are based upon sequences in the SWISS-PROT database.Comment: 9 pages, 4 Postscript figures. References and figure adde

    Studies of an Off-Lattice Model for Protein Folding: Sequence Dependence and Improved Sampling at Finite Temperature

    Full text link
    We study the thermodynamic behavior of a simple off-lattice model for protein folding. The model is two-dimensional and has two different ``amino acids''. Using numerical simulations of all chains containing eight or ten monomers, we examine the sequence dependence at a fixed temperature. It is shown that only a few of the chains exist in unique folded state at this temperature, and the energy level spectra of chains with different types of behavior are compared. Furthermore, we use this model as a testbed for two improved Monte Carlo algorithms. Both algorithms are based on letting some parameter of the model become a dynamical variable; one of the algorithms uses a fluctuating temperature and the other a fluctuating monomer sequence. We find that by these algorithms one gains large factors in efficiency in comparison with conventional methods.Comment: 17 pages, 9 Postscript figures. Combined with chem-ph/950500

    Evidence for Non-Random Hydrophobicity Structures in Protein Chains

    Full text link
    The question of whether proteins originate from random sequences of amino acids is addressed. A statistical analysis is performed in terms of blocked and random walk values formed by binary hydrophobic assignments of the amino acids along the protein chains. Theoretical expectations of these variables from random distributions of hydrophobicities are compared with those obtained from functional proteins. The results, which are based upon proteins in the SWISS-PROT data base, convincingly show that the amino acid sequences in proteins differ from what is expected from random sequences in a statistical significant way. By performing Fourier transforms on the random walks one obtains additional evidence for non-randomness of the distributions. We have also analyzed results from a synthetic model containing only two amino-acid types, hydrophobic and hydrophilic. With reasonable criteria on good folding properties in terms of thermodynamical and kinetic behavior, sequences that fold well are isolated. Performing the same statistical analysis on the sequences that fold well indicates similar deviations from randomness as for the functional proteins. The deviations from randomness can be interpreted as originating from anticorrelations in terms of an Ising spin model for the hydrophobicities. Our results, which differ from previous investigations using other methods, might have impact on how permissive with respect to sequence specificity the protein folding process is -- only sequences with non-random hydrophobicity distributions fold well. Other distributions give rise to energy landscapes with poor folding properties and hence did not survive the evolution.Comment: 16 pages, 8 Postscript figures. Minor changes, references adde

    Local Interactions and Protein Folding: A 3D Off-Lattice Approach

    Full text link
    The thermodynamic behavior of a three-dimensional off-lattice model for protein folding is probed. The model has only two types of residues, hydrophobic and hydrophilic. In absence of local interactions, native structure formation does not occur for the temperatures considered. By including sequence independent local interactions, which qualitatively reproduce local properties of functional proteins, the dominance of a native state for many sequences is observed. As in lattice model approaches, folding takes place by gradual compactification, followed by a sequence dependent folding transition. Our results differ from lattice approaches in that bimodal energy distributions are not observed and that high folding temperatures are accompanied by relatively low temperatures for the peak of the specific heat. Also, in contrast to earlier studies using lattice models, our results convincingly demonstrate that one does not need more than two types of residues to generate sequences with good thermodynamic folding properties in three dimensions.Comment: 18 pages, 11 Postscript figure

    Design of Sequences with Good Folding Properties in Coarse-Grained Protein Models

    Get PDF
    Background: Designing amino acid sequences that are stable in a given target structure amounts to maximizing a conditional probability. A straightforward approach to accomplish this is a nested Monte Carlo where the conformation space is explored over and over again for different fixed sequences, which requires excessive computational demand. Several approximate attempts to remedy this situation, based on energy minimization for fixed structure or high-TT expansions, have been proposed. These methods are fast but often not accurate since folding occurs at low TT. Results: We develop a multisequence Monte Carlo procedure, where both sequence and conformation space are simultaneously probed with efficient prescriptions for pruning sequence space. The method is explored on hydrophobic/polar models. We first discuss short lattice chains, in order to compare with exact data and with other methods. The method is then successfully applied to lattice chains with up to 50 monomers, and to off-lattice 20-mers. Conclusions: The multisequence Monte Carlo method offers a new approach to sequence design in coarse-grained models. It is much more efficient than previous Monte Carlo methods, and is, as it stands, applicable to a fairly wide range of two-letter models.Comment: 23 pages, 7 figure

    Automatic activation of alcohol cues by child maltreatment related words: a replication attempt in a different treatment setting

    Get PDF
    Potthast N, Neuner F, Catani C. Automatic activation of alcohol cues by child maltreatment related words: a replication attempt in a different treatment setting. BMC Research Notes. 2017;10(17): 17.Background A growing body of research attempts to clarify the underlying mechanisms of the association between emotional maltreatment and alcohol dependence (AD). In a preceding study, we found considerable support for a specific priming effect in subjects with AD and emotional abuse experiences receiving alcohol rehabilitation treatment. We concluded that maltreatment related cues can automatically activate an associative memory network comprising cues eliciting craving as well as alcohol-related responses. Generalizability of the results to other treatment settings remains unclear because of considerable differences in German treatment settings as well as insufficiently clarified influences of selection effects. As replication studies in other settings are necessary, the current study aimed to replicate the specific priming effect in a qualified detoxification sample. Results 22 AD subjects (n = 10 with emotional abuse vs. n = 12 without emotional abuse) participated in a priming experiment. Comparison data from 34 healthy control subjects were derived from the prior study. Contrary to our hypothesis, we did not find a specific priming effect. Conclusions We could not replicate the result of an automatic network activation by maltreatment related words in a sample of subjects with AD and emotional abuse experiences receiving qualified detoxification treatment. This discrepancy might be attributed to reasons related to treatment settings as well as to methodological limitations. Future work is required to determine the generalizability of the specific priming effect before valid conclusions regarding automatic activation can be drawn

    Learning General Optical Flow Subspaces for Egomotion Estimation and Detection of Motion Anomalies

    Get PDF
    ©2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Presented at the 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 20-25 June 2009, Miami, FL.DOI: 10.1109/CVPR.2009.5206538This paper deals with estimation of dense optical flow and ego-motion in a generalized imaging system by exploiting probabilistic linear subspace constraints on the flow. We deal with the extended motion of the imaging system through an environment that we assume to have some degree of statistical regularity. For example, in autonomous ground vehicles the structure of the environment around the vehicle is far from arbitrary, and the depth at each pixel is often approximately constant. The subspace constraints hold not only for perspective cameras, but in fact for a very general class of imaging systems, including catadioptric and multiple-view systems. Using minimal assumptions about the imaging system, we learn a probabilistic subspace constraint that captures the statistical regularity of the scene geometry relative to an imaging system. We propose an extension to probabilistic PCA (Tipping and Bishop, 1999) as a way to robustly learn this subspace from recorded imagery, and demonstrate its use in conjunction with a sparse optical flow algorithm. To deal with the sparseness of the input flow, we use a generative model to estimate the subspace using only the observed flow measurements. Additionally, to identify and cope with image regions that violate subspace constraints, such as moving objects, objects that violate the depth regularity, or gross flow estimation errors, we employ a per-pixel Gaussian mixture outlier process. We demonstrate results of finding the optical flow subspaces and employing them to estimate dense flow and to recover camera motion for a variety of imaging systems in several different environments
    • …
    corecore