PubMed Health⌕ Search

Biomedical subjects

L Jaroszewski

Publications and source records attributed to L Jaroszewski.

12 recordsLinked to original sources

Clustering of highly homologous sequences to reduce the size of large protein databases.

We present a fast and flexible program for clustering large protein databases at different sequence identity levels. It takes less than 2 h for the all-against-all sequence comparison and clustering of the non-redundant protein database of over 560,000 sequences on a high-end PC. The output database, including only the representative sequences, can be used for more efficient and sensitive database searches.

Algorithms↗

ATP-activated oligomerization as a mechanism for apoptosis regulation: fold and mechanism prediction for CED-4.

Fold recognition algorithm FFAS (Rychlewski et al., Protein Sci, 2000;9:232-241) was used to match the nucleotide-binding adaptor shared by APAF-1, certain R gene products and CED-4 (NB-ARC domain) to the structure of the D2 domain of N-ethylemaleimide-Sensitive Fusion Protein and the delta; subunit of clamp loader of DNA polymerase III. The predicted structure consists of the p-loop ATP-binding domain, followed by two alpha-helical domains that regulate the oligomerization process. This prediction suggests a detailed molecular mechanism for the "induced proximity" hypothesis (Salvesen and Dixit, Proc Natl Acad Sci USA 1999;96:10964-10967) for CED3/caspase-9 activation by CED4/APAF-1 complex. According to this model, the ATP binding acts as a trigger in CED-4 oligomerization and the helical domain immediately following the ATP-binding domain provides additional mechanisms for regulation of the oligomerization process. This model explains most of known experimental data about CED-4-mediated caspase activation and, at the same time, suggest experiments that could test this hypothesis.

Adenosine Triphosphate↗

Comparison of sequence profiles. Strategies for structural predictions using sequence information.

Distant homologies between proteins are often discovered only after three-dimensional structures of both proteins are solved. The sequence divergence for such proteins can be so large that simple comparison of their sequences fails to identify any similarity. New generation of sensitive alignment tools use averaged sequences of entire homologous families (profiles) to detect such homologies. Several algorithms, including the newest generation of BLAST algorithms and BASIC, an algorithm used in our group to assign fold predictions for proteins from several genomes, are compared to each other on the large set of structurally similar proteins with little sequence similarity. Proteins in the benchmark are classified according to the level of their similarity, which allows us to demonstrate that most of the improvement of the new algorithms is achieved for proteins with strong functional similarities, with almost no progress in recognizing distant fold similarities. It is also shown that details of profile calculation strongly influence its sensitivity in recognizing distant homologies. The most important choice is how to include information from diverging members of the family, avoiding generating false predictions, while accounting for entire sequence divergence within a family. PSI-BLAST takes a conservative approach, deriving a profile from core members of the family, providing a solid improvement without almost any false predictions. BASIC strives for better sensitivity by increasing the weight of divergent family members and paying the price in lower reliability. A new FFAS algorithm introduced here uses a new procedure for profile generation that takes into account all the relations within the family and matches BASIC sensitivity with PSI-BLAST like reliability.

Algorithms↗

Conservative mutation Met8 --> Leu affects the folding process and structural stability of squash trypsin inhibitor CMTI-I.

Protein molecules can accommodate a large number of mutations without noticeable effects on their stability and folding kinetics. On the other hand, some mutations can have quite strong effects on protein conformational properties. Such mutations either destabilize secondary structures, e.g., alpha-helices, are incompatible with close packing of protein hydrophobic cores, or lead to disruption of some specific interactions such as disulfide cross links, salt bridges, hydrogen bonds, or aromatic-aromatic contacts. The Met8 --> Leu mutation in CMTI-I results in significant destabilization of the protein structure. This effect could hardly be expected since the mutation is highly conservative, and the side chain of residue 8 is situated on the protein surface. We show that the protein destabilization is caused by rearrangement of a hydrophobic cluster formed by side chains of residues 8, Ile6, and Leu17 that leads to partial breaking of a hydrogen bond formed by the amide group of Leu17 with water and to a reduction of a hydrophobic surface buried within the cluster. The mutation perturbs also the protein folding. In aerobic conditions the reduced wild-type protein folds effectively into its native structure, whereas more then 75% of the mutant molecules are trapped in various misfolded species. The main conclusion of this work is that conservative mutations of hydrophobic residues can destabilize a protein structure even if these residues are situated on the protein surface and partially accessible to water. Structural rearrangement of small hydrophobic clusters formed by such residues can lead to local changes in protein hydration, and consequently, can affect considerably protein stability and folding process.

Amino Acid Substitution↗

Improving the quality of twilight-zone alignments.

Several recent publications illustrated advantages of using sequence profiles in recognizing distant homologies between proteins. At the same time, the practical usefulness of distant homology recognition depends not only on the sensitivity of the algorithm, but also on the quality of the alignment between a prediction target and the template from the database of known proteins. Here, we study this question for several supersensitive protein algorithms that were previously compared in their recognition sensitivity (Rychlewski et al., 2000). A database of protein pairs with similar structures, but low sequence similarity is used to rate the alignments obtained with several different methods, which included sequence-sequence, sequence-profile, and profile-profile alignment methods. We show that incorporation of evolutionary information encoded in sequence profiles into alignment calculation methods significantly increases the alignment accuracy, bringing them closer to the alignments obtained from structure comparison. In general, alignment quality is correlated with recognition and alignment score significance. For every alignment method, alignments with statistically significant scores correlate with both correct structural templates and good quality alignments. At the same time, average alignment lengths differ in various methods, making the comparison between them difficult. For instance, the alignments obtained by FFAS, the profile-profile alignment algorithm developed in our group are always longer that the alignments obtained with the PSI-BLAST algorithms. To address this problem, we develop methods to truncate or extend alignments to cover a specified percentage of protein lengths. In most cases, the elongation of the alignment by profile-profile methods is reasonable, adding fragments of similar structure. The examples of erroneous alignment are examined and it is shown that they can be identified based on the model quality.

Algorithms↗

Sensitive sequence comparison as protein function predictor.

Protein function assignments based on postulated homology as recognized by high sequence similarity are used routinely in genome analysis. Improvements in sensitivity of sequence comparison algorithms got to the point, that proteins with previously undetectable sequence similarity, such as for instance 10-15% of identical residues, sometimes can be classified as similar. What is the relation between such proteins? Is it possible that they are homologous? What is the practical significance of detecting such similarities? A simplified analysis of the relation between sequence similarity and function similarity is presented here for the well-characterized proteins from the E. coli genome. Using a simple measure of functional similarity based on E.C. classification of enzymes, it is shown that it correlates well with sequence similarity measured by statistical significance of the alignment score. Proteins, similar by this standard, even in cases of low sequence identity, have a much larger chance of having similar function than the randomly chosen protein pairs. Interesting exceptions to these rules are discussed.

Algorithms↗

Search for a new description of protein topology and local structure.

A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure where the chain doesn't radically change its direction. In this new language, global protein topology becomes a particular arrangement of the relatively small number of large, rod like GSSE's. Protein topology can be described by an adjacency matrix giving information, which GSSE's are close in space to each other and defining a graph, where GSSE's are equivalent to vertices and interactions between them to edges. The information about the local structure is translated into the local density of pseudo-Calpha atoms along the chain and the curvature of the chain. This new description has a number of interesting and useful features. For instance, enumeration theorems of graph theory can be used to estimate a number of possible topologies for a protein built from a given number of elements. Different topologies, including novel ones, can be generated from the known by various permutations of elements. Many new regularities in protein structures become suddenly visible in a new description. A new local structure description is more amenable to predictions and easier to use in fold predictions.

Animals↗

Fold prediction by a hierarchy of sequence, threading, and modeling methods.

Several fold recognition algorithms are compared to each other in terms of prediction accuracy and significance. It is shown that on standard benchmarks, hybrid methods, which combine scoring based on sequence-sequence and sequence-structure matching, surpass both sequence and threading methods in the number of accurate predictions. However, the sequence similarity contributes most to the prediction accuracy. This strongly argues that most examples of apparently nonhomologous proteins with similar folds are actually related by evolution. While disappointing from the perspective of the fundamental understanding of protein folding, this adds a new significance to fold recognition methods as a possible first step in function prediction. Despite hybrid methods being more accurate at fold prediction than either the sequence or threading methods, each of the methods is correct in some cases where others have failed. This partly reflects a different perspective on sequence/structure relationship embedded in various methods. To combine predictions from different methods, estimates of significance of predictions are made for all methods. With the help of such estimates, it is possible to develop a "jury" method, which has accuracy higher than any of the single methods. Finally, building full three-dimensional models for all top predictions helps to eliminate possible false positives where alignments, which are optimal in the one-dimensional sequences, lead to unsolvable sterical conflicts for the full three-dimensional models.

Algorithms↗

Derivation and testing of pair potentials for protein folding. When is the quasichemical approximation correct?

Many existing derivations of knowledge-based statistical pair potentials invoke the quasichemical approximation to estimate the expected side-chain contact frequency if there were no amino acid pair-specific interactions. At first glance, the quasichemical approximation that treats the residues in a protein as being disconnected and expresses the side-chain contact probability as being proportional to the product of the mole fractions of the pair of residues would appear to be rather severe. To investigate the validity of this approximation, we introduce two new reference states in which no specific pair interactions between amino acids are allowed, but in which the connectivity of the protein chain is retained. The first estimates the expected number of side-chain contracts by treating the protein as a Gaussian random coil polymer. The second, more realistic reference state includes the effects of chain connectivity, secondary structure, and chain compactness by estimating the expected side-chain contrast probability by placing the sequence of interest in each member of a library of structures of comparable compactness to the native conformation. The side-chain contact maps are not allowed to readjust to the sequence of interest, i.e., the side chains cannot repack. This situation would hold rigorously if all amino acids were the same size. Both reference states effectively permit the factorization of the side-chain contact probability into sequence-dependent and structure-dependent terms. Then, because the sequence distribution of amino acids in proteins is random, the quasichemical approximation to each of these reference states is shown to be excellent. Thus, the range of validity of the quasichemical approximation is determined by the magnitude of the side-chain repacking term, which is, at present, unknown. Finally, the performance of these two sets of pair interaction potentials as well as side-chain contact fraction-based interaction scales is assessed by inverse folding tests both without and with allowing for gaps.

Models, Chemical↗

Similarities and differences between nonhomologous proteins with similar folds: evaluation of threading strategies.

BACKGROUND: There are many pairs and groups of proteins with similar folds and interaction patterns, but whose sequence similarity is below the threshold of easily recognizable sequence homology. The existence of multiple sequence solutions for a given fold has inspired fold prediction methods in which structural information from one protein is used to estimate the energy of another, putatively similar, structure. RESULTS: A set of 68 pairs of proteins with similar folds and sequence identity in the 8-30% range is identified from the literature. for each pair, the energy of one protein, calculated using knowledge-based statistical potentials, is compared to the estimated energy, calculated with the same potentials but using the structural information (burial status and interaction pattern) of another protein with the same fold. Different energy estimates, corresponding to approximations used in various fold recognition algorithms, are calculated and compared to each other, as well as to the correct energy. It is shown that the local energy terms, based on burial and secondary structure preferences, can be reliably estimated with an accuracy close to 70%. At the same time, the two-body nonlocal energy loses over 60% of its value due to the repacking of the structure. Further approximations, such as the 'frozen approximation', can bring it to an essentially random value. CONCLUSIONS: Local energy terms could be used safely to improve fold recognition algorithms. To utilize pair interaction information, specially designed pair potentials and/or a self-consistent description of pair interactions is necessary.

Algorithms↗

Multiple model approach--dealing with alignment ambiguities in protein modeling.

Sequence alignments for distantly homologous proteins are often ambiguous, which creates a weak link in structure prediction by homology. We address this problem by using several plausible alignments in a modeling procedure, obtaining many models of the target. All are subsequently evaluated by a threading algorithm. It is shown that this approach can identify best alignments and produce reasonable models, whose quality is now limited only by the extent of the structural similarity between the known and predicted protein. Using a similar approach structure prediction for the oxidized dimer of S100A1 protein, for which the structure is not known, is presented.

Amino Acid Sequence↗

Synthesis, cloning and expression in Escherichia coli of a gene coding for the Met8-->Leu CMTI I--a representative of the squash inhibitors of serine proteinases.

A chemically synthesized gene coding for a Cucurbita maxima trypsin inhibitor modified at position P'3 (Met8-->Leu CMTI I), i.e. at the third position downstream of the reactive site bond (Arg5-Ile), was cloned into a derivative of the plasmid pAED4 that utilizes a T7 expression system. The gene was expressed in Escherichia coli as a fusion protein that accumulates in inclusion bodies. After reduction and CNBr cleavage of the fusion protein followed by oxidative refolding and reverse-phase HPLC, about 5 mg of pure protein was obtained per 1 of cell culture. Association constants of recombinant Leu-8-CMTI I with bovine beta-trypsin and human cathepsin G are the same, within experimental error, as for CMTI I isolated from a natural source.

Amino Acid Sequence↗