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 127 records · Page 7Linked to original sources

Combining neural network and genetic algorithm for prediction of lung sounds.

Recognition of lung sounds is an important goal in pulmonary medicine. In this work, we present a study for neural networks-genetic algorithm approach intended to aid in lung sound classification. Lung sound was captured from the chest wall of The subjects with different pulmonary diseases and also from the healthy subjects. Sound intervals with duration of 15-20 s were sampled from subjects. From each interval, full breath cycles were selected. Of each selected breath cycle, a 256-point Fourier Power Spectrum Density (PSD) was calculated. Total of 129 data values calculated by the spectral analysis are selected by genetic algorithm and applied to neural network. Multilayer perceptron (MLP) neural network employing backpropagation training algorithm was used to predict the presence or absence of adventitious sounds (wheeze and crackle). We used genetic algorithms to search for optimal structure and training parameters of neural network for a better predicting of lung sounds. This application resulted in designing of optimum network structure and, hence reducing the processing load and time.

Algorithms↗

An Excel spreadsheet computer program combining algorithms for prediction of protein structural characteristics.

A program running on personal computers (either Apple Macintosh or PC, using Excel worksheets) for the prediction of some protein structural characteristics is reported. The program runs according to the Chou and Fasman algorithm, with some modifications, for secondary structure prediction. The program also incorporates several complementary analyses for secondary structure prediction to help the user in the decision-making process: rules for amino acid preferences in the N-cap and C-cap of alpha-helices; prediction of the protein structural class and search of sequential motifs related to secondary structure. Additional algorithms performed by the program are: prediction of domain boundaries, prediction of loops, prediction of the state of cysteines (reduced or in disulfide bridge), hydropathy profiles according to Kyte and Doolittle, Hoop and Woods, and flexibility plot according to Karplus and Schulz.

Algorithms↗

Validation of an algorithm for predicting cardiac events in renal transplant candidates.

A 2-tiered noninvasive cardiac risk stratification algorithm was first evaluated in a test population with planar thallium myocardial perfusion imaging and subsequently in a validation population using single-photon emission computed tomographic (SPECT) thallium myocardial perfusion imaging. This study examines if SPECT imaging was as predictive of cardiac death as planar imaging and also if SPECT imaging predicted nonfatal cardiac events in the patient population. Renal transplant candidates were evaluated using a 2-tiered noninvasive cardiac risk stratification algorithm. The first tier of risk assessment utilized 5 variables: age >50 years, insulin-dependent diabetes mellitus, abnormal electrocardiogram, and a history of either angina or congestive heart failure. Patients without risk factors were considered low risk and underwent no further cardiac evaluation. Patients with > or =1 risk factor were considered high risk and underwent a second tier of risk assessment with planar (n = 95) or SPECT (n = 112) imaging. In the test population, 13 of 16 cardiac deaths (81%) occurred in high-risk patients with abnormal planar studies. In the validation group, all cardiac deaths (5 of 60) and nonfatal cardiac events (13 of 60) occurred in high-risk patients with abnormal SPECT studies. SPECT imaging was at least as predictive as planar imaging and also predicted nonfatal as well as fatal cardiac events. Pretransplant risk stratification by clinical variables identified low-risk patients who may not require further cardiac evaluation and high-risk patients with normal SPECT imaging who may not require angiography.

Adult↗

The precision of in vitro methods and algorithms for predicting the bioavailability of dietary iron.

Three factors determine how much iron will be absorbed from a meal. They are the physiological mechanisms that regulate uptake by and transfer through the enterocytes in the upper small intestine, the quantity of iron in the meal, and its availability to the cellular iron transporters. Established methods exist for predicting the effect of physiological regulation and for measuring or estimating meal iron content. Three approaches to estimating bioavailability have been advocated. Two are in vitro screening procedures: measurement of dialyzable iron and Caco-2 cell uptake, both carried out after in vitro simulated gastric and pancreatic digestion. The third is the use of algorithms based on the predicted effects of specific meal components on absorption derived from isotopic studies in human volunteers. The in vitro procedures have been very useful for identifying and characterizing factors that affect non-heme iron absorption, but direct comparisons between absorption predicted from the in vitro tests and measurements in human volunteers have only been made in a limited number of published studies. The available data indicate that dialysis and Caco-2 cell uptake are useful for ranking meals and single food items in terms of predicted iron bioavailability, but may not reflect the magnitudes of the effects of factors that influence absorption accurately. Algorithms based on estimates of the amounts of heme iron and of enhancers and inhibitors of non-heme iron absorption in foods make it possible to classify meals or diets as being of high, medium, or low bioavailability. The precision with which meal iron bioavailability can be predicted in a population, for which a specific algorithm has been developed, is improved by measuring the content of the most important enhancers and inhibitors. However, the accuracy of such predictions appears to be much lower when the algorithm is applied to meals eaten by different populations.

Algorithms↗

CEP: a conformational epitope prediction server.

CEP server (http://bioinfo.ernet.in/cep.htm) provides a web interface to the conformational epitope prediction algorithm developed in-house. The algorithm, apart from predicting conformational epitopes, also predicts antigenic determinants and sequential epitopes. The epitopes are predicted using 3D structure data of protein antigens, which can be visualized graphically. The algorithm employs structure-based Bioinformatics approach and solvent accessibility of amino acids in an explicit manner. Accuracy of the algorithm was found to be 75% when evaluated using X-ray crystal structures of Ag-Ab complexes available in the PDB. This is the first and the only method available for the prediction of conformational epitopes, which is an attempt to map probable antibody-binding sites of protein antigens.

Algorithms↗

Membrane topology mapping of the Na+-pumping NADH: quinone oxidoreductase from Vibrio cholerae by PhoA-green fluorescent protein fusion analysis.

The membrane topologies of the six subunits of Na+-translocating NADH:quinone oxidoreductase (Na+-NQR) from Vibrio cholerae were determined by a combination of topology prediction algorithms and the construction of C-terminal fusions. Fusion expression vectors contained either bacterial alkaline phosphatase (phoA) or green fluorescent protein (gfp) genes as reporters of periplasmic and cytoplasmic localization, respectively. A majority of the topology prediction algorithms did not predict any transmembrane helices for NqrA. A lack of PhoA activity when fused to the C terminus of NqrA and the observed fluorescence of the green fluorescent protein C-terminal fusion confirm that this subunit is localized to the cytoplasmic side of the membrane. Analysis of four PhoA fusions for NqrB indicates that this subunit has nine transmembrane helices and that residue T236, the binding site for flavin mononucleotide (FMN), resides in the cytoplasm. Three fusions confirm that the topology of NqrC consists of two transmembrane helices with the FMN binding site at residue T225 on the cytoplasmic side. Fusion analysis of NqrD and NqrE showed almost mirror image topologies, each consisting of six transmembrane helices; the results for NqrD and NqrE are consistent with the topologies of Escherichia coli homologs YdgQ and YdgL, respectively. The NADH, flavin adenine dinucleotide, and Fe-S center binding sites of NqrF were localized to the cytoplasm. The determination of the topologies of the subunits of Na+-NQR provides valuable insights into the location of cofactors and identifies targets for mutagenesis to characterize this enzyme in more detail. The finding that all the redox cofactors are localized to the cytoplasmic side of the membrane is discussed.

Algorithms↗

Method for prediction of protein function from sequence using the sequence-to-structure-to-function paradigm with application to glutaredoxins/thioredoxins and T1 ribonucleases.

The practical exploitation of the vast numbers of sequences in the genome sequence databases is crucially dependent on the ability to identify the function of each sequence. Unfortunately, current methods, including global sequence alignment and local sequence motif identification, are limited by the extent of sequence similarity between sequences of unknown and known function; these methods increasingly fail as the sequence identity diverges into and beyond the twilight zone of sequence identity. To address this problem, a novel method for identification of protein function based directly on the sequence-to-structure-to-function paradigm is described. Descriptors of protein active sites, termed "fuzzy functional forms" or FFFs, are created based on the geometry and conformation of the active site. By way of illustration, the active sites responsible for the disulfide oxidoreductase activity of the glutaredoxin/thioredoxin family and the RNA hydrolytic activity of the T1 ribonuclease family are presented. First, the FFFs are shown to correctly identify their corresponding active sites in a library of exact protein models produced by crystallography or NMR spectroscopy, most of which lack the specified activity. Next, these FFFs are used to screen for active sites in low-to-moderate resolution models produced by ab initio folding or threading prediction algorithms. Again, the FFFs can specifically identify the functional sites of these proteins from their predicted structures. The results demonstrate that low-to-moderate resolution models as produced by state-of-the-art tertiary structure prediction algorithms are sufficient to identify protein active sites. Prediction of a novel function for the gamma subunit of a yeast glycosyl transferase and prediction of the function of two hypothetical yeast proteins whose models were produced via threading are presented. This work suggests a means for the large-scale functional screening of genomic sequence databases based on the prediction of structure from sequence, then on the identification of functional active sites in the predicted structure.

Algorithms↗

Genetic algorithms for protein structure prediction.

Genetic algorithms are a general class of search methods that mimic natural gene-based optimization mechanisms. Mutation, cross-over and replication operations are performed on strings. When applied to structure prediction, each string describes a particular conformation of a protein molecule. There are many ways in which such search methods may be implemented. Recent results show potential for helping with protein structure prediction, but more data are needed before a complete assessment can be made.

Algorithms↗

Prediction of coronary heart disease using risk factor categories.

BACKGROUND: The objective of this study was to examine the association of Joint National Committee (JNC-V) blood pressure and National Cholesterol Education Program (NCEP) cholesterol categories with coronary heart disease (CHD) risk, to incorporate them into coronary prediction algorithms, and to compare the discrimination properties of this approach with other noncategorical prediction functions. METHODS AND RESULTS: This work was designed as a prospective, single-center study in the setting of a community-based cohort. The patients were 2489 men and 2856 women 30 to 74 years old at baseline with 12 years of follow-up. During the 12 years of follow-up, a total of 383 men and 227 women developed CHD, which was significantly associated with categories of blood pressure, total cholesterol, LDL cholesterol, and HDL cholesterol (all P<.001). Sex-specific prediction equations were formulated to predict CHD risk according to age, diabetes, smoking, JNC-V blood pressure categories, and NCEP total cholesterol and LDL cholesterol categories. The accuracy of this categorical approach was found to be comparable to CHD prediction when the continuous variables themselves were used. After adjustment for other factors, approximately 28% of CHD events in men and 29% in women were attributable to blood pressure levels that exceeded high normal (> or =130/85). The corresponding multivariable-adjusted attributable risk percent associated with elevated total cholesterol (> or =200 mg/dL) was 27% in men and 34% in women. CONCLUSIONS: Recommended guidelines of blood pressure, total cholesterol, and LDL cholesterol effectively predict CHD risk in a middle-aged white population sample. A simple coronary disease prediction algorithm was developed using categorical variables, which allows physicians to predict multivariate CHD risk in patients without overt CHD.

Adult↗

Prediction of the secondary structure of globular proteins by their amino acid sequence.

Prediction algorithms for protein secondary structures by amino acid sequence based on a statistical analysis of 46 proteins have been devised. The ith residual chain is assumed to be in one of four states: alpha-helix, beta-sheet, beta-turn or random coil conformation. It is shown that algorithm enables to predict properly 85.9% of the residual states in alpha-helical conformation, 72.4% in beta-sheet conformation, and 70.7% in beta-turn conformation. A comparison has been made with other prediction methods of the protein secondary structure, and it is pointed out that the algorithms proposed are the most effective ones.

Adenylate Kinase↗

'Neural network' algorithm to predict severity in epidermolysis bullosa simplex.

BACKGROUND AND AIMS: There are various genotypic variations known for the four phenotypic presentations of epidermolysis bullosa simplex (EBS). A neural network algorithm may be used to find the relationship between the various factors responsible for a particular phenotypic presentation. We assessed the value of neural network to predict the prognosis of epidermolysis bullosa simplex. METHODS: Cases of EBS in which sequencing had been performed to identify the position and type of mutation were collected by literature search and the resulting data was analyzed using neural network algorithm. RESULTS: The statistical prediction had an accuracy rate of 78%. CONCLUSION: Neural networks can identify hidden patterns in a huge database without the intervention of a skilled statistician. It has the potential to change the way we analyze clinical and experimental data at present.

Algorithms↗

Modeling structurally variable regions in homologous proteins with rosetta.

A major limitation of current comparative modeling methods is the accuracy with which regions that are structurally divergent from homologues of known structure can be modeled. Because structural differences between homologous proteins are responsible for variations in protein function and specificity, the ability to model these differences has important functional consequences. Although existing methods can provide reasonably accurate models of short loop regions, modeling longer structurally divergent regions is an unsolved problem. Here we describe a method based on the de novo structure prediction algorithm, Rosetta, for predicting conformations of structurally divergent regions in comparative models. Initial conformations for short segments are selected from the protein structure database, whereas longer segments are built up by using three- and nine-residue fragments drawn from the database and combined by using the Rosetta algorithm. A gap closure term in the potential in combination with modified Newton's method for gradient descent minimization is used to ensure continuity of the peptide backbone. Conformations of variable regions are refined in the context of a fixed template structure using Monte Carlo minimization together with rapid repacking of side-chains to iteratively optimize backbone torsion angles and side-chain rotamers. For short loops, mean accuracies of 0.69, 1.45, and 3.62 A are obtained for 4, 8, and 12 residue loops, respectively. In addition, the method can provide reasonable models of conformations of longer protein segments: predicted conformations of 3A root-mean-square deviation or better were obtained for 5 of 10 examples of segments ranging from 13 to 34 residues. In combination with a sequence alignment algorithm, this method generates complete, ungapped models of protein structures, including regions both similar to and divergent from a homologous structure. This combined method was used to make predictions for 28 protein domains in the Critical Assessment of Protein Structure 4 (CASP 4) and 59 domains in CASP 5, where the method ranked highly among comparative modeling and fold recognition methods. Model accuracy in these blind predictions is dominated by alignment quality, but in the context of accurate alignments, long protein segments can be accurately modeled. Notably, the method correctly predicted the local structure of a 39-residue insertion into a TIM barrel in CASP 5 target T0186.

Algorithms↗

JPred: a consensus secondary structure prediction server.

UNLABELLED: An interactive protein secondary structure prediction Internet server is presented. The server allows a single sequence or multiple alignment to be submitted, and returns predictions from six secondary structure prediction algorithms that exploit evolutionary information from multiple sequences. A consensus prediction is also returned which improves the average Q3 accuracy of prediction by 1% to 72.9%. The server simplifies the use of current prediction algorithms and allows conservation patterns important to structure and function to be identified. AVAILABILITY: http://barton.ebi.ac.uk/servers/jpred.h tml CONTACT: geoff@ebi.ac.uk

Algorithms↗

An algorithm to predict pregnancy in assisted reproduction.

BACKGROUND: Male fertility potential cannot be measured by conventional parameters for the assisted reproduction technique; ICSI. This study determines the relationship between testicular and ejaculated sperm mitochondrial (mt) DNA deletions, nuclear (n) DNA fragmentation, and fertilization and pregnancy rates in ICSI. METHODS: Ejaculated sperm were obtained from 77 men and testicular sperm from 28 men with obstructive azoospermia undergoing ICSI. Testicular sperm were retrieved using a Trucut needle. mtDNA was analysed using a long PCR. The alkaline Comet assay determined nDNA fragmentation. RESULTS: Of subjects who achieved a pregnancy (50%) using testicular sperm, only 26% had partners' sperm with wild-type (WT) mtDNA. Of pregnant subjects (38%) using ejaculated sperm, only 8% had partner sperm with WT mtDNA. In each, the successful group had less mtDNA deletions and less nDNA fragmentation. There were inverse relationships between pregnancy and mtDNA deletion numbers, size and nDNA fragmentation for both testicular and ejaculated sperm. No relationships were observed with fertilization rates. An algorithm for the prediction of pregnancy is presented based on the quality of sperm nDNA and mtDNA. CONCLUSION: In both testicular and ejaculated sperm, mtDNA deletions and nDNA fragmentation are closely associated with pregnancy in ICSI.

Algorithms↗

Identification of noncanonical melanoma-associated T cell epitopes for cancer immunotherapy.

The identification of tumor-associated T cell epitopes has contributed significantly to the understanding of the interrelationship of tumor and immune system and is instrumental in the development of therapeutic vaccines for the treatment of cancer. Most of the known epitopes have been identified with prediction algorithms that compute the potential capacity of a peptide to bind to HLA class I molecules. However, naturally expressed T cell epitopes need not necessarily be strong HLA binders. To overcome this limitation of the available prediction algorithms we established a strategy for the identification of T cell epitopes that include suboptimal HLA binders. To this end, an artificial neural network was developed that predicts HLA-binding peptides in protein sequences by taking the entire sequence context into consideration rather than computing the sum of the contribution of the individual amino acids. Using this algorithm, we predicted seven HLA A*0201-restricted potential T cell epitopes from known melanoma-associated Ags that do not conform to the canonical anchor motif for this HLA molecule. All seven epitopes were validated as T cell epitopes and three as naturally processed by melanoma tumor cells. T cells for four of the new epitopes were found at elevated frequencies in the peripheral blood of melanoma patients. Modification of the peptides to the canonical sequence motifs led to improved HLA binding and to improved capacity to stimulate T cells.

Antigen-Presenting Cells↗

Multicentric, randomized, controlled trial to evaluate blood glucose control by the model predictive control algorithm versus routine glucose management protocols in intensive care unit patients.

OBJECTIVE: To evaluate a fully automated algorithm for the establishment of tight glycemic control in critically ill patients and to compare the results with different routine glucose management protocols of three intensive care units (ICUs) across Europe (Graz, Prague, and London). RESEARCH DESIGN AND METHODS: Sixty patients undergoing cardiac surgery (age 67 +/- 9 years, BMI 27.7 +/- 4.9 kg/m2, 17 women) with postsurgery blood glucose levels >120 mg/dl (6.7 mmol/l) were investigated in three different ICUs (20 per center). Patients were randomized to either blood glucose management (target range 80-110 mg/dl [4.4-6.1 mmol/l]) by the fully automated model predictive control (MPC) algorithm (n = 30, 10 per center) or implemented routine glucose management protocols (n = 30, 10 per center). In all patients, arterial glucose was measured hourly to describe the glucose profile until the end of the ICU stay but for a maximum period of 48 h. RESULTS: Compared with routine protocols, MPC treatment resulted in a significantly higher percentage of time within the target glycemic range (% median [min-max]: 52 [17-92] vs. 19 [0-71]) over 0-24 h (P < 0.01). Improved glycemic control with MPC treatment was confirmed in patients remaining in the ICU for 48 h (0-24 h: 50 [17-71] vs. 21 [4-67], P < 0.05, and 24-48 h: 65 [38-96] vs. 25 [8-79], P < 0.05, for MPC [n = 16] vs. routine protocol [n = 13], respectively). Two hypoglycemic events (<54 mg/dl [3.0 mmol/l]) were observed with routine protocol treatment. No hypoglycemic event occurred with MPC. CONCLUSIONS: The data suggest that the MPC algorithm is safe and effective in controlling glycemia in critically ill postsurgery patients.

Aged↗

A novel method for apoptosis protein subcellular localization prediction combining encoding based on grouped weight and support vector machine.

Apoptosis proteins have a central role in the development and homeostasis of an organism. These proteins are very important for understanding the mechanism of programmed cell death. Based on the idea of coarse-grained description and grouping in physics, a new feature extraction method with grouped weight for protein sequence is presented, and applied to apoptosis protein subcellular localization prediction associated with support vector machine. For the same training dataset and the same predictive algorithm, the overall prediction accuracy of our method in Jackknife test is 13.2% and 15.3% higher than the accuracy based on the amino acid composition and instability index. Especially for the else class apoptosis proteins, the increment of prediction accuracy is 41.7 and 33.3 percentile, respectively. The experiment results show that the new feature extraction method is efficient to extract the structure information implicated in protein sequence and the method has reached a satisfied performance despite its simplicity. The overall prediction accuracy of EBGW_SVM model on dataset ZD98 reach 92.9% in Jackknife test, which is 8.2-20.4 percentile higher than other existing models. For a new dataset ZW225, the overall prediction accuracy of EBGW_SVM achieves 83.1%. Those implied that EBGW_SVM model is a simple but efficient prediction model for apoptosis protein subcellular location prediction.

Algorithms↗

Estimation of significant solvent concentration ranges and its application to the enhancement of the accuracy of gradient predictions.

The solvent concentration range actually useful for gradient predictions is significantly narrower than the total range scanned in a gradient run. This range, called "solvent informative range" (SIR), if known with the highest accuracy, allows to predict gradient retention times (t(g) with minimal error. The small size of the SIR supports the application of the linear solvent strength theory (LSST). Furthermore, LSST allows a closed-form solution to the integral required to predict gradient retention times, which eliminates numerical integration, needed with other retention models. A methodology that calculates the SIR by applying error analysis, and uses it to improve the accuracy in the prediction of t(g) from isocratic experiments, is proposed. The importance of those mobile-phase compositions that do not contribute significantly to the prediction of t(g) is selectively attenuated within the prediction algorithm, relying the predictions more heavily on the SIR. As a result, t(g) was found to be predicted with similar accuracy using isocratic training data with regard to predictions based on gradient training data. The approach is useful for all situations where the chromatographer is able to provide predictions of retention at constant solvent concentration, and wish to predict the retention in gradient mode.

Algorithms↗