Search results for "Algorithms"
showing 10 items of 1716 documents
Disentangling the complexity of low complexity proteins
2020
Abstract There are multiple definitions for low complexity regions (LCRs) in protein sequences, with all of them broadly considering LCRs as regions with fewer amino acid types compared to an average composition. Following this view, LCRs can also be defined as regions showing composition bias. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichot…
Complex formation between the NS3 serine-type proteinase of the hepatitis C virus and NS4A and its importance for polyprotein maturation
1995
Processing of the hepatitis C virus polyprotein is mediated by host cell signalases and at least two virally encoded proteinases. Of these, the serine-type proteinase encompassing the amino-terminal one-third of NS3 is responsible for cleavage at the four sites carboxy terminal of NS3. The activity of this proteinase is modulated by NS4A, a 54-amino-acid polyprotein cleavage product essential for processing at the NS3/4A, NS4A/4B, and NS4B/5A sites and enhancing cleavage efficiency between NS5A and NS5B. Using the vaccinia virus-T7 hybrid system to express hepatitis C virus polypeptides in BHK-21 cells, we studied the role of NS4A in proteinase activation. We found that the NS3 proteinase a…
Reconstructing the free-energy landscape of Met-enkephalin using dihedral principal component analysis and well-tempered metadynamics
2013
Well-Tempered Metadynamics (WTmetaD) is an efficient method to enhance the reconstruction of the free-energy surface of proteins. WTmetaD guarantees a faster convergence in the long time limit in comparison with the standard metadynamics. It still suffers however from the same limitation, i.e. the non trivial choice of pertinent collective variables (CVs). To circumvent this problem, we couple WTmetaD with a set of CVs generated from a dihedral Principal Component Analysis (dPCA) on the Ramachadran dihedral angles describing the backbone structure of the protein. The dPCA provides a generic method to extract relevant CVs built from internal coordinates. We illustrate the robustness of this …
Investigation of protein folding by coarse-grained molecular dynamics with the UNRES force field.
2010
Coarse-grained molecular dynamics simulations offer a dramatic extension of the time-scale of simulations compared to all-atom approaches. In this article, we describe the use of the physics-based united-residue (UNRES) force field, developed in our laboratory, in protein-structure simulations. We demonstrate that this force field offers about a 4000-times extension of the simulation time scale; this feature arises both from averaging out the fast-moving degrees of freedom and reduction of the cost of energy and force calculations compared to all-atom approaches with explicit solvent. With massively parallel computers, microsecond folding simulation times of proteins containing about 1000 r…
A computer system to perform structure comparison using TOPS representations of protein structure
2001
We describe the design and implementation of a fast topology-based method for protein structure comparison. The approach uses the TOPS topological representation of protein structure, aligning two structures using a common discovered pattern and generating measure of distance derived from an insert score. Heavy use is made of a constraint-based pattern-matching algorithm for TOPS diagrams that we have designed and described elsewhere (Bioinformatics 15(4) (1999) 317). The comparison system is maintained at the European Bioinformatics Institute and is available over the Web at tops.ebi.ac.uk/tops. Users submit a structure description in Protein Data Bank (PDB) format and can compare it with …
Comparison of classification methods that combine clinical data and high-dimensional mass spectrometry data
2013
Background The identification of new diagnostic or prognostic biomarkers is one of the main aims of clinical cancer research. Technologies like mass spectrometry are commonly being used in proteomic research. Mass spectrometry signals show the proteomic profiles of the individuals under study at a given time. These profiles correspond to the recording of a large number of proteins, much larger than the number of individuals. These variables come in addition to or to complete classical clinical variables. The objective of this study is to evaluate and compare the predictive ability of new and existing models combining mass spectrometry data and classical clinical variables. This study was co…
Missing value imputation in proximity extension assay-based targeted proteomics data
2020
Targeted proteomics utilizing antibody-based proximity extension assays provides sensitive and highly specific quantifications of plasma protein levels. Multivariate analysis of this data is hampered by frequent missing values (random or left censored), calling for imputation approaches. While appropriate missing-value imputation methods exist, benchmarks of their performance in targeted proteomics data are lacking. Here, we assessed the performance of two methods for imputation of values missing completely at random, the previously top-benchmarked ‘missForest’ and the recently published ‘GSimp’ method. Evaluation was accomplished by comparing imputed with remeasured relative concentrations…
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
Integration of local features into a global shape
2001
AbstractIt is a well-established fact that the cortical filters selective for spatial frequency and orientation have a limited spatial extent. The present study investigated how information from local filters is integrated into global shapes. Specifically, we were interested in whether identification of a global pattern consisting of small oriented, spatially-bandpass features (Gabor patches) depends on the orientations of those features. The observer was presented with a C-like stimulus shape comprised of oriented Gabor elements on a blank background, and the performance measure was the threshold contrast for identifying the global orientation of the C-shape (four possible rotated orientat…