343 results found
MacCallum RM, Kelley LA, Sternberg MJE, 2000, SAWTED: Structure Assignment With Text Description - Enhanced detection, of remote homologues with automated SWISS-PROT annotation comparisons, BIOINFORMATICS, Vol: 16, Pages: 125-129, ISSN: 1367-4803
Sternberg MJ, Gabb HA, Jackson RM, et al., 2000, Protein-protein docking. Generation and filtering of complexes., Methods Mol Biol, Vol: 143, Pages: 399-415, ISSN: 1064-3745
Muller A, MacCallum RM, Sternberg MJE, 1999, Benchmarking PSI-BLAST in genome annotation, JOURNAL OF MOLECULAR BIOLOGY, Vol: 293, Pages: 1257-1271, ISSN: 0022-2836
Sternberg MJE, Bates PA, Kelley LA, et al., 1999, Prepress in protein structure prediction: assessment of CASP3, CURRENT OPINION IN STRUCTURAL BIOLOGY, Vol: 9, Pages: 368-373, ISSN: 0959-440X
Moont G, Gabb HA, Sternberg MJE, 1999, Use of pair potentials across protein interfaces in screening predicted docked complexes, Proteins: Structure, Function and Genetics, Vol: 35, Pages: 364-373, ISSN: 0887-3585
Empirical residue-residue pair potentials are used to screen possible complexes for protein-protein dockings. A correct docking is defined as a complex with not more than 2.5 Å root-mean-square distance from the known experimental structure. The complexes were generated by 'ftdock' (Gabb et al. J Mol Biol 1997;272:106-120) that ranks using shape complementarity. The complexes studied were 5 enzyme-inhibitors and 2 antibody-antigens, starting from the unbound crystallographic coordinates, with a further 2 antibody- antigens where the antibody was from the bound crystallographic complex. The pair potential functions tested were derived both from observed intramolecular pairings in a database of nonhomologous protein domains, and from observed intermolecular pairings across the interfaces in sets of nonhomologous heterodimers and homodimers. Out of various alternate strategies, we found the optimal method used a mole-fraction calculated random model from the intramolecular pairings. For all the systems, a correct docking was placed within the top 12% of the pair potential score ranked complexes. A combined strategy was developed that incorporated 'multidock,' a side-chain refinement algorithm (Jackson et al. J Mol Biol 1998;276:265- 285). This placed a correct docking within the top 5 complexes for enzyme- inhibitor systems, and within the top 40 complexes for antibody-antigen systems.
Moont G, Gabb HA, Sternberg MJE, 1999, Use of pair potentials across protein interfaces in screening predicted docked complexes, PROTEINS-STRUCTURE FUNCTION AND GENETICS, Vol: 35, Pages: 364-373, ISSN: 0887-3585
Betts MJ, Sternberg MJE, 1999, An analysis of conformational changes on protein-protein association: implications for predictive docking, PROTEIN ENGINEERING, Vol: 12, Pages: 271-283, ISSN: 0269-2139
Bates PA, Sternberg MJE, 1999, Model building by comparison at CASP3: Using expert knowledge and computer automation, PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, Pages: 47-54, ISSN: 0887-3585
Fischer D, Barret C, Bryson K, et al., 1999, CAFASP-1: Critical assessment of fully automated structure prediction methods, Proteins: Structure, Function and Genetics, Vol: 37, Pages: 209-217, ISSN: 0887-3585
The results of the first Critical Assessment of Fully Automated Structure Prediction (CAFASP-1) are presented. The objective was to evaluate the success rates of fully automatic web servers for fold recognition which are available to the community. This study was based on the targets used in the third meeting on the Critical-Assessment of Techniques for Protein Structure Prediction (CASP-3). However, unlike CASP-3, the study was not a blind trial, as it was held after the structures of the targets were known. The aim was to assess the performance of methods without the user intervention that several groups used in their CASP-3 submissions. Although it is clear that 'human plus machine' predictions are superior to automated ones, this CAFASP-1 experiment is extremely valuable for users of our methods; it provides an indication of the performance of the methods alone, and not of the 'human plus machine' performance assessed in CASP. This information may aid users in choosing which programs they wish to use and in evaluating the reliability of the programs when applied to their specific prediction targets. In addition, evaluation of fully automated methods is particularly important to assess their applicability at genomic scales. For each target, groups submitted the top-ranking folds generated from their servers. In CAFASP-1 we concentrated on fold-recognition web servers only and evaluated only recognition of the correct fold, and not, as in CASP-3, alignment accuracy. Although some performance differences appeared within each of the four target categories used here, overall, no single server has proved markedly superior to the others. The results showed that current fully automated fold recognition servers can often identify remote similarities when pairwise sequence search methods fall. Nevertheless, in only a few cases outside the family-level targets has the score of the top-ranking fold been significant enough to allow for a confident fully automated prediction.
Zhang X, Morera S, Bates PA, et al., 1999, STRUCTURE OF AN XRCC1 BRCT DOMAIN: A NEW PROTEIN PROTEIN INTERACTION MODULE., Publisher: INT UNION CRYSTALLOGRAPHY, Pages: 292-292, ISSN: 2053-2733
Kelley LA, MacCallum RM, Sternberg MJE, 1999, Recognition of remote protein homologies using three-dimensional information to generate a position specific scoring matrix in the program 3D-PSSM, Pages: 218-225
A method (3D-PSSM) to recognize remote protein sequence homologues is described. The method uses homologous proteins of similar three-dimensional structure in the SCOP database to obtain a structural equivalence of residues. These equivalences are used to extend multiply-aligned sequences obtained by standard sequence searches (i.e. 1D-profiles). The resultant 3D profile is converted into a position specific scoring matrix (a 3D-PSSM). The approach is benchmarked on recognizing remote homologues in the SCOP database and comparing the hit and error rates. 3D-PSSMs are compared with 1D-PSSMs and with two widely-used sensitive search approaches - PSI-BLAST and global dynamic programming using the BLOSUM62 matrix. In a cross-validated benchmark, 3D-PSSMs and 1D-PSSMs achieved similar results and both have lower error rates compared to the other two methods when recognizing remote homologues. The combination of 1D- and 3D-PSSMs provide improved performance over either individual method and thus can identify remote homologies that would not be detected by PSI-BLAST. It is envisaged that 3D-PSSM can complement current homology searches in a two-stage approach in which 3D-PSSMs will follow an initial search using PSI-BLAST or dynamic programming.
Fischer D, Barret C, Bryson K, et al., 1999, CAFASP-1: Critical assessment of fully automated structure prediction methods, PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, Pages: 209-217, ISSN: 0887-3585
Bates PA, Sternberg MJE, 1999, Model building by comparison at CASP3: Using expert knowledge and computer automation, Proteins: Structure, Function and Genetics, Vol: 37, Pages: 47-54, ISSN: 0887-3585
Ten models were constructed for the comparative modeling section of the Critical Assessment of Techniques for Protein Structure Prediction-3 (CASP3). Sequence identity between each target and the best possible parent(s) ranged between 12% and 64%. The modeling protocol is a mixture of automated computer algorithms with human intervention at certain critical stages. In particular, intervention is required to check sequence alignments and the selection of parameters for various computer programs. Seven of the targets were constructed from single-parent templates, and three were constructed from multiple parents. The reasons for such a high ratio of modeling from single parents only are discussed. Models constructed from multiple parents were found to be more accurate than models constructed from single parents only. A novel loop-modeling algorithm is presented that consists of fragment database searches, several fragment libraries, and mean-field calculations on representative fragment candidates.
Dokurno P, Bates PA, Band HA, et al., 1998, Crystal structure at 1.95 angstrom resolution of the breast tumour-specific antibody SM3 complexed with its peptide epitope reveals novel hypervariable loop recognition, JOURNAL OF MOLECULAR BIOLOGY, Vol: 284, Pages: 713-728, ISSN: 0022-2836
Bates PA, Dokurno P, Freemont PS, et al., 1998, Conformational analysis of the first observed non-proline cis-peptide bond occurring within the complementarity determining region (CDR) of an antibody, JOURNAL OF MOLECULAR BIOLOGY, Vol: 284, Pages: 549-555, ISSN: 0022-2836
The docking of repressor proteins to DNA starting from the unbound protein and model-built DNA coordinates is modeled computationally. The approach was evaluated on eight repressor/DNA complexes that employed different modes for protein/DNA recognition. The global search is based on a protein-protein docking algorithm that evaluates shape and electrostatic complementarity, which was modified to consider the importance of electrostatic features in DNA-protein recognition. Complexes were then ranked by an empirical score for the observed amino acid/nucleotide pairings (i.e., protein-DNA pair potentials) derived from a database of 20 protein/DNA complexes. A good prediction had at least 65% of the correct contacts modeled. This approach was able to identify a good solution at rank four or better for three out of the eight complexes. Predicted complexes were filtered by a distance constraint based on experimental data defining the DNA footprint. This improved coverage to four out of eight complexes having a good model at rank four or better. The additional use of amino acid mutagenesis and phylogenetic data defining residues on the repressor resulted in between 2 and 27 models that would have to be examined to find a good solution for seven of the eight test systems. This study shows that starting with unbound coordinates one can predict three-dimensional models for protein/DNA complexes that do not involve gross conformational changes on association.
Zhang XD, Morera S, Bates PA, et al., 1998, Structure of an XRCC1 BRCT domain: a new protein-protein interaction module, EMBO JOURNAL, Vol: 17, Pages: 6404-6411, ISSN: 0261-4189
Islam SA, Carvin D, Sternberg MJE, et al., 1998, HAD, a data bank of heavy-atom binding sites in protein crystals: a resource for use in multiple isomorphous replacement and anomalous scattering, ACTA CRYSTALLOGRAPHICA SECTION D-BIOLOGICAL CRYSTALLOGRAPHY, Vol: 54, Pages: 1199-1206, ISSN: 0907-4449
Russell RB, Sasieni PD, Sternberg MJE, 1998, Supersites within superfolds. Binding site similarity in the absence of homology, JOURNAL OF MOLECULAR BIOLOGY, Vol: 282, Pages: 903-918, ISSN: 0022-2836
Saqi MAS, Russell RB, Sternberg MJE, 1998, Misleading local sequence alignments: implications for comparative protein modelling, PROTEIN ENGINEERING, Vol: 11, Pages: 627-630, ISSN: 0269-2139
Oliva B, Bates PA, Querol E, et al., 1998, Automated classification of antibody complementarity determining region 3 of the heavy chain (H3) loops into canonical forms and its application to protein structure prediction, JOURNAL OF MOLECULAR BIOLOGY, Vol: 279, Pages: 1193-1210, ISSN: 0022-2836
Sternberg MJE, Gabb HA, Jackson RM, 1998, Predictive docking of protein-protein and protein-DNA complexes, CURRENT OPINION IN STRUCTURAL BIOLOGY, Vol: 8, Pages: 250-256, ISSN: 0959-440X
Jackson RM, Gabb HA, Sternberg MJE, 1998, Rapid refinement of protein interfaces incorporating solvation: Application to the docking problem, JOURNAL OF MOLECULAR BIOLOGY, Vol: 276, Pages: 265-285, ISSN: 0022-2836
Luo JC, Islam SA, Russell RB, et al., 1998, A world-wide web server of protein domain assignment, 4th Chinese Peptide Symposium (CPS-96), Publisher: SPRINGER, Pages: 235-236
Turcotte M, Muggleton SH, Sternberg MJE, 1998, Application of inductive logic programming to discover rules governing the three-dimensional topology of protein structure, Pages: 53-64, ISSN: 0302-9743
© Springer-Verlag Berlin Heidelberg 1998. Inductive Logic Programming (ILP) has been applied to discover rules governing the three-dimensional topology of protein structure. The data-set unifies two sources of information; SCOP and PROMOTIF. Cross-validation results for experiments using two background knowledge sets, global (attribute-valued) and constitutional (relational), are presented. The application makes use of a new feature of Progol4.4 for numeric parameter estimation. At this early stage of development, the rules produced can only be applied to proteins for which the secondary structure is known. However, since the rules are insightful, they should prove to be helpful in assisting the development of taxonomic schemes. The application of ILP to fold recognition represents a novel and promising approach to this problem.
Russell RB, Saqi MAS, Bates PA, et al., 1998, Recognition of analogous and homologous protein folds - assessment of prediction success and associated alignment accuracy using empirical substitution matrices, PROTEIN ENGINEERING, Vol: 11, Pages: 1-9, ISSN: 0269-2139
King RD, Sternberg MJE, Muggleton SH, et al., 1998, Recent developments in applying machine learning to drug design, Conference of the NATO Advanced Study Institute on Experimental and Computational Approaches to Structure-Based Drug Design, Publisher: SPRINGER, Pages: 151-162, ISSN: 0168-132X
Muggleton S, Srinivasan A, King RD, et al., 1998, Biochemical knowledge discovery using inductive logic programming, 1st International Conference on Discovery Science (DS 98), Publisher: SPRINGER-VERLAG BERLIN, Pages: 326-341, ISSN: 0302-9743
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.