Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Prediction Algorithms”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17Linked to original sources

Knowledge-based structure prediction of MHC class I bound peptides: a study of 23 complexes.

BACKGROUND: The binding of T-cell antigenic peptides to MHC molecules is a prerequisite for their immunogenicity. The ability to identify binding peptides based on the protein sequence is of great importance to the rational design of peptide vaccines. As the requirements for peptide binding cannot be fully explained by the peptide sequence per se, structural considerations should be taken into account and are expected to improve predictive algorithms. The first step in such an algorithm requires accurate and fast modeling of the peptide structure in the MHC-binding groove. RESULTS: We have used 23 solved peptide-MHC class I complexes as a source of structural information in the development of a modeling algorithm. The peptide backbones and MHC structures were used as the templates for prediction. Sidechain conformations were built based on a rotamer library, using the 'dead end elimination' approach. A simple energy function selects the favorable combination of rotamers for a given sequence. It further selects the correct backbone structure from a limited library. The influence of different parameters on the prediction quality was assessed. With a specific rotamer library that incorporates information from the peptide sidechains in the solved complexes, the algorithm correctly identifies 85% (92%) of all (buried) sidechains and selects the correct backbones. Under cross-validation, 70% (78%) of all (buried) residues are correctly predicted and most of all backbones. The interaction between peptide sidechains has a negligible effect on the prediction quality. CONCLUSIONS: The structure of the peptide sidechains follows from the interactions with the MHC and the peptide backbone, as the prediction is hardly influenced by sidechain interactions. The proposed methodology was able to select the correct backbone from a limited set. The impairment in performance under cross-validation suggests that, currently, the specific rotamer library is not satisfactorily representative. The predictions might improve with an increase in the data.

Animals↗

An APL-programmed genetic algorithm for the prediction of RNA secondary structure.

The possibilities of using a genetic algorithm for the prediction of RNA secondary structure were investigated. The algorithm, using the procedure of stepwise selection of the most fit structures (similarly to natural evolution), allows different models of fitness or driving forces determining RNA structure to be easily introduced. This can be used for simulation of the RNA folding process and for the investigation of possible folding pathways. Such an algorithm needs several modifications before it can predict RNA secondary structures. After modification, a fair number of correct stems are predicted, even when using computationally quick, but very crude, fitness criteria such as stem length and stacking energy, including elements of tertiary structure (pseudoknots). The fact that genetic algorithm simulation includes both stem formations and stem disruption allows one to observe intermediate structures that may be used in combination with phylogenetic or experimental research.

Algorithms↗

A fuzzy guided genetic algorithm for operon prediction.

MOTIVATION: The operon structure of the prokaryotic genome is a critical input for the reconstruction of regulatory networks at the whole genome level. As experimental methods for the detection of operons are difficult and time-consuming, efforts are being put into developing computational methods that can use available biological information to predict operons. METHOD: A genetic algorithm is developed to evolve a starting population of putative operon maps of the genome into progressively better predictions. Fuzzy scoring functions based on multiple criteria are used for assessing the 'fitness' of the newly evolved operon maps and guiding their evolution. RESULTS: The algorithm organizes the whole genome into operons. The fuzzy guided genetic algorithm-based approach makes it possible to use diverse biological information like genome sequence data, functional annotations and conservation across multiple genomes, to guide the organization process. This approach does not require any prior training with experimental operons. The predictions from this algorithm for Escherchia coli K12 and Bacillus subtilis are evaluated against experimentally discovered operons for these organisms. The accuracy of the method is evaluated using an ROC (receiver operating characteristic) analysis. The area under the ROC curve is around 0.9, which indicates excellent accuracy. CONTACT: roschen_csir@rediffmail.com.

Algorithms↗

Cytokine conformations: predictive studies.

The amino acid sequences of human and murine haemopoietins have been analysed using algorithms predictive for secondary structure. The results for 19 of these proteins (human and murine interleukins 2, 3, 4, 5, 6, 7 and granulocyte, macrophage and granulocyte macrophage-colony stimulating factors as well as human erythropoietin) suggest that they each contain a 4-alpha-helical bundle, ca 25 A long, as a common conformational feature. The most important predictive indicator was considered to be the occurrence of quasi-repeating sequences of seven amino acids of the form (a-b-c-d-e-f-g), with apolar side chains (usually leucine) lying alternately three and four residues apart in the a and d positions. As with other proteins of known secondary structure this periodicity favours the formation of alpha-helical elements, each with an apolar external strip, which interdigitate closely with one another when tested appropriately. Molecular models based on these putative 4-alpha-helical bundles are presented--with special reference to human granulocyte macrophage-colony stimulating factor. The extent to which such models are consistent with experiments designed to delineate receptor binding sites is discussed.

Algorithms↗

Prediction of the secondary structure content of globular proteins based on structural classes.

The prediction of the secondary structure content (alpha-helix and beta-strand content) of a globular protein may play an important complementary role in the prediction of the protein's structure. We propose a new prediction algorithm based on Chou's database [Chou (1995), Proteins Struct. Funct. Genet. 21, 319]. The new algorithm is an improved multiple linear regression method, taking the nonlinear and coupling terms of the frequencies of different amino acids into account. The prediction is also based on the structural classes of proteins. A resubstitution examination for the algorithm shows that the average errors are 0.040 and 0.033 for the prediction of alpha-helix content and beta-strand content, respectively. The examination of cross-validation, the jackknife analysis, shows that the average errors are 0.051 and 0.044 for the prediction of alpha-helix content and beta-strand content, respectively. Both examinations indicate the self-consistency and the extrapolative effectiveness of the new algorithm. Compared with the other methods available currently, our method has the merits of simplicity and convenience for use, as well as a high prediction accuracy. By incorporating the prediction of the structural classes, the only input of our method is the amino acid composition of the protein to be predicted.

Algorithms↗

Canonical antigen-binding loop structures in immunoglobulins: more structures, more canonical classes?

Grafting the antigen-binding loops onto a human antibody scaffold is a widely used technique to humanise murine antibodies. The success of this approach depends largely on the observation that the antigen-binding loops adopt only a limited number of canonical structures. Identification of the correct canonical structure is therefore essential. Algorithms that predict the main-chain conformation of the hypervariable loops using only the amino acid sequence often provide this information. Here, we describe new canonical loop conformations for the hypervariable regions H1 and H2 as found in single-domain antibody fragments of dromedaries or llama. Although the occurrence of these new loop conformations was not predicted by the algorithms used, it seems that they could occur in human or mouse antigen-binding loops. Their discovery indicates that the currently used set of canonical structures is incomplete and that the prediction algorithms should be extended to include these new structures.

Algorithms↗

Evaluation of aortic stenosis by spectral analysis of the murmur.

A relation between the peak transaortic pressure gradient and the frequency content of the murmur (r = 0.79) was demonstrated in a prospective "test" set of 50 patients with the clinical diagnosis of aortic stenosis. After heart sounds were recorded and digitized, three segments of the systolic murmur were isolated and analyzed by fast Fourier transform technique. An average frequency spectrum was quantitated by a previously described empiric spectral estimator. Clinical data and spectral ratio were correlated with the transaortic pressure gradient and aortic valve area was calculated from cardiac catheterization data. The best prediction of the transaortic pressure gradient was obtained when a 170 ms murmur segment was analyzed and when the predictive algorithm also included the aortic dimension (r = 0.87). The aortic valve area was poorly predicted (r = -0.48) unless estimates of blood flow and valvular calcification were included in the algorithm (r = 0.84). Further refinement of this technique may provide a non-invasive and clinically useful method for the estimation of aortic valve stenosis.

Adult↗

SOPM: a self-optimized method for protein secondary structure prediction.

A new method called the self-optimized prediction method (SOPM) has been developed to improve the success rate in the prediction of the secondary structure of proteins. This new method has been checked against an updated release of the Kabsch and Sander database, 'DATABASE.DSSP', comprising 239 protein chains. The first step of the SOPM is to build sub-databases of protein sequences and their known secondary structures drawn from 'DATABASE.DSSP' by (i) making binary comparisons of all protein sequences and (ii) taking into account the prediction of structural classes of proteins. The second step is to submit each protein of the sub-database to a secondary structure prediction using a predictive algorithm based on sequence similarity. The third step is to iteratively determine the predictive parameters that optimize the prediction quality on the whole sub-database. The last step is to apply the final parameters to the query sequence. This new method correctly predicts 69% of amino acids for a three-state description of the secondary structure (alpha helix, beta sheet and coil) in the whole database (46,011 amino acids). The correlation coefficients are C alpha = 0.54, C beta = 0.50 and Cc = 0.48. Root mean square deviations of 10% in the secondary structure content are obtained. Implications for the users are drawn so as to derive an accuracy at the amino acid level and provide the user with a guide for secondary structure prediction. The SOPM method is available by anonymous ftp to ibcp.fr.

Algorithms↗

ProPred: prediction of HLA-DR binding sites.

UNLABELLED: ProPred is a graphical web tool for predicting MHC class II binding regions in antigenic protein sequences. The server implement matrix based prediction algorithm, employing amino-acid/position coefficient table deduced from literature. The predicted binders can be visualized either as peaks in graphical interface or as colored residues in HTML interface. This server might be a useful tool in locating the promiscuous binding regions that can bind to several HLA-DR alleles. AVAILABILITY: The server is available at http://www.imtech.res.in/raghava/propred/ CONTACT: raghava@imtech.res.in SUPPLEMENTARY INFORMATION: http://www.imtech.res.in/raghava/propred/page3.html

Algorithms↗

[Strategy for primary prevention of coronary heart disease based on results of health check-up].

To investigate one of the strategies for effective primary prevention of coronary heart disease (CHD) in employees, the future morbidity of CHD was predicted from the results of an annual health check-up. The decrease in morbidity by measures against coronary risk factors was estimated with simulations. By a CHD risk prediction algorithm based on the Framingham Study, the 10-yr incidence of CHD was predicted in 6,444 male employees of a manufacturing company according to the results of a health check-up in 1998: age, total cholesterol (TC), HDL-cholesterol (HDL-C), blood pressure (BP), diabetes mellitus, and smoking habit. The decrease in CHD incidence obtained by a decrease in TC, increase in HDL-C, decrease in BP, control of diabetes mellitus, or quitting the smoking habit was estimated with simulations by means of the algorithm. The mean +/- SD in 6,444 employees was 45 +/- 11 yr for age; 121 +/- 16 and 79 +/- 10 mmHg for systolic and diastolic BP, respectively; 193 +/- 34, 53 +/- 13, and 98 +/- 18 mg/dl for TC, HDL-C, and fasting blood sugar, respectively; 4.80 +/- 0.58% for HbA1c; and 44% for the frequency of the smoking habit. Among 6,444 males, 455 (7.1%) were predicted to suffer from CHD for 10 yr ahead. If TC was decreased to less than 200 mg/dl in all 2,614 males (N) with TC > or = 200 mg/dl, the decrease (D) in the predicted number of employees with CHD was 64; namely, a reduction of TC to less than 200 mg/dl in 41 males (N/D) with TC > or = 200 mg/dl was estimated to decrease the number of CHD patients by one. Similarly, the D and N/D were 38 and 35 for reduction in BP to less than 140/90 mmHg; 20 and 17 for control of diabetes mellitus; and 90 and 32 for quitting the smoking habit, respectively. A measure against diabetes mellitus was the most effective in respect of N/D, but the predicted total reduction was small (D = 20). On the other hand, a measure against the smoking habit was estimated to have a relatively small N/D as well as the largest D. In 5,386 employees with at least one of the risk factors of TC > or = 200 mg/dl, HDL-C < 45 mg/dl, BP > or = 130/85 mmHg, diabetes mellitus, and the smoking habit, the normalization of all risk factors was estimated to decrease by 230 CHD patients (D = 230, N/D = 23). These results suggest that the strategy for effective primary prevention of CHD in employees of a company should include at first, quitting the smoking habit supported by total prohibition of smoking within company facilities, followed by measures against hyperlipidemia, hypertension and diabetes mellitus.

Adult↗

Protein secondary structure: entropy, correlations and prediction.

MOTIVATION: Is protein secondary structure primarily determined by local interactions between residues closely spaced along the amino acid backbone or by non-local tertiary interactions? To answer this question, we measure the entropy densities of primary and secondary structure sequences, and the local inter-sequence mutual information density. RESULTS: We find that the important inter-sequence interactions are short ranged, that correlations between neighboring amino acids are essentially uninformative and that only one-fourth of the total information needed to determine the secondary structure is available from local inter-sequence correlations. These observations support the view that the majority of most proteins fold via a cooperative process where secondary and tertiary structure form concurrently. Moreover, existing single-sequence secondary structure prediction algorithms are almost optimal, and we should not expect a dramatic improvement in prediction accuracy. AVAILABILITY: Both the data sets and analysis code are freely available from our Web site at http://compbio.berkeley.edu/

Algorithms↗

Topology of the type IIa Na+/P(i) cotransporter.

The type IIa Na(+)/P(i) cotransporter (NaPi-IIa) plays a key role in the reabsorption of inorganic phosphate (P(i)) in the renal proximal tubule. The rat NaPi-IIa isoform is a protein of 637 residues for which different algorithms predict 8-12 transmembrane domains (TMDs). Epitope tagging experiments demonstrated that both the N and the C termini of NaPi-IIa are located intracellularly. Site-directed mutagenesis revealed two N-glycosylation sites in a large putative extracellular loop. Results from structure-function studies suggested the assembly of two similar opposed regions that possibly constitute part of the substrate translocation pathway for one phosphate ion together with three sodium ions. Apart from these topological aspects, other structural features of NaPi-IIa are not known. In this study, we have addressed the topology of NaPi-IIa using in vitro transcription/translation of HK-M0 and HK-M1 fusion vectors designed to test membrane insertion properties of cDNA sequences encoding putative NaPi-IIa TMDs. Based on the results of in vitro transcription/translation analyses, we propose a model of NaPi-IIa comprising 12 TMDs, with both N and C termini orientated intracellularly and a large hydrophilic extracellular loop between the fifth and sixth TMDs. The proposed model is in good agreement with the prediction of the NaPi-IIa structure obtained by the hidden Markov algorithm HMMTOP.

Animals↗

Prediction of exposure degree diagram and sites of limited proteolysis in globular proteins as an approach to computer-aided design of protein bioregulators with prolonged action.

In order to prolong the lifetime of protein bioregulators in blood it is possible to engineer analogs with protected sites of limited proteolysis. To determine the sites, primarily accessible to trypsin-like proteases, a computer procedure has been developed, including a prediction algorithm, to produce the residue diagram of a globular protein and a discriminant algorithm to determine the sites most liable to proteolysis. The accuracy of prediction of amino acid residue exposure is characterised by correlation coefficients between experimental and theoretical exposure values, the coefficients being about 0.7 as calculated for 10 globular proteins. The classification of Arg and Lys residues into two groups, susceptible or insusceptible to protease, has an error percentage of about 25.

Arginine↗

The internal transcribed spacer 2 database--a web server for (not only) low level phylogenetic analyses.

The internal transcribed spacer 2 (ITS2) is a phylogenetic marker which has been of broad use in generic and infrageneric level classifications, as its sequence evolves comparably fast. Only recently, it became clear, that the ITS2 might be useful even for higher level systematic analyses. As the secondary structure is highly conserved within all eukaryotes it serves as a valuable template for the construction of highly reliable sequence-structure alignments, which build a fundament for subsequent analyses. Thus, any phylogenetic study using ITS2 has to consider both sequence and structure. We have integrated a homology based RNA structure prediction algorithm into a web server, which allows the detection and secondary structure prediction for ITS2 in any given sequence. Furthermore, the resource contains more than 25,000 pre-calculated secondary structures for the currently known ITS2 sequences. These can be taxonomically searched and browsed. Thus, our resource could become a starting point for ITS2-based phylogenetic analyses and is therefore complementary to databases of other phylogenetic markers, which focus on higher level analyses. The current version of the ITS2 database can be accessed via http://its2.bioapps.biozentrum.uni-wuerzburg.de.

DNA, Ribosomal Spacer↗

Evaluating a computational model of perceptual grouping by proximity.

A formal approach to the phenomenon of perceptual grouping by proximity was investigated. Grouping judgments of random dot patterns were made by the CODE algorithm (van Oeffelen & Vos, 1982) and several related algorithms, and these judgments were compared with subjects' grouping judgments for the same stimuli. Each algorithm predicted significantly more subject judgments than would be expected by chance. The more subjects agreed on how a given dot pattern should be grouped, the more successful was the algorithms' ability to match the judgments for that pattern. CODE predicted significantly fewer subject judgments than did some of the other algorithms, largely because of its overemphasis on the extent of interactivity among dots as they are being grouped.

Adult↗

High-throughput cDNA screening utilizing a low order neural network filter.

A low order neural network-based filter was designed as a rapid screening agent for single-spanning transmembrane regions in an integrated informatics system. A rapid screening algorithm was seen as a compromise between costly structure-specific techniques and simple rules that gave a high false-positive rate for cDNA. The filter was applied to a library of 2123 anonymous cDNA sequences, which resulted in 61 detections. Evaluation of the detections with two other dissimilar computer prediction algorithms yielded strong transmembrane predictions for 15 of the detections, while 8 of the detections resulted in a definitive negative result. Homology searches performed on the sequences with detection reports yielded 13 homologs in the predicted reading frame, four of which are membrane associated.

Animals↗

Exploiting the past and the future in protein secondary structure prediction.

MOTIVATION: Predicting the secondary structure of a protein (alpha-helix, beta-sheet, coil) is an important step towards elucidating its three-dimensional structure, as well as its function. Presently, the best predictors are based on machine learning approaches, in particular neural network architectures with a fixed, and relatively short, input window of amino acids, centered at the prediction site. Although a fixed small window avoids overfitting problems, it does not permit capturing variable long-rang information. RESULTS: We introduce a family of novel architectures which can learn to make predictions based on variable ranges of dependencies. These architectures extend recurrent neural networks, introducing non-causal bidirectional dynamics to capture both upstream and downstream information. The prediction algorithm is completed by the use of mixtures of estimators that leverage evolutionary information, expressed in terms of multiple alignments, both at the input and output levels. While our system currently achieves an overall performance close to 76% correct prediction--at least comparable to the best existing systems--the main emphasis here is on the development of new algorithmic ideas. AVAILABILITY: The executable program for predicting protein secondary structure is available from the authors free of charge. CONTACT: pfbaldi@ics.uci.edu, gpollast@ics.uci.edu, brunak@cbs.dtu.dk, paolo@dsi.unifi.it.

Algorithms↗

Photon scatter in portal images: accuracy of a fluence based pencil beam superposition algorithm.

The accuracy of a pencil beam algorithm to predict scattered photon fluence into portal imaging systems was studied. A data base of pencil beam kernels describing scattered photon fluence behind homogeneous water slabs (1-50 cm thick) at various air gap distances (0-100 cm) was generated using the EGS Monte Carlo code. Scatter kernels were partitioned according to particle history: singly-scattered, multiply-scattered, and bremsstrahlung and positron annihilation photons. Mean energy and mean angle with respect to the incident photon pencil beam were also scored. This data allows fluence, mean energy, and mean angular data for each history type to be predicted using the pencil beam algorithm. Pencil beam algorithm predictions for 6 and 24 MV incident photon beams were compared against full Monte Carlo simulations for several inhomogeneous phantoms, including approximations to a lateral neck, and a mediastinum treatment. The accuracy of predicted scattered photon fluence, mean energy, and mean angle was investigated as a function of air gap, field size, photon history, incident beam resolution, and phantom geometry. Maximum errors in mean energies were 0.65 and 0.25 MeV for the higher and lower energy spectra, respectively, and 15 degrees for mean angles. The ability of the pencil beam algorithm to predict scatter fluence decreases with decreasing air gap, with the largest error for each phantom occurring at the exit surface. The maximum predictive error was found to be 6.9% with respect to the total fluence on the central axis. By maintaining even a small air gap (approximately 10 cm), the error in predicted scatter fluence may be kept under 3% for the phantoms and beam energies studied here. It is concluded that this pencil beam algorithm is sufficiently accurate (using International Commission on Radiation Units and Measurements Report No. 24 guidelines for absorbed dose) over the majority of clinically relevant air gaps, for further investigation in a portal dose prediction algorithm.

Air↗