PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

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

At least 847 records · Page 47Linked to original sources

Contact interactions method: a new algorithm for protein folding simulations.

Computer simulations of simple exact lattice models are an aid in the study of protein folding process; they have sometimes resulted in predictions experimentally proved. The contact interactions (CI) method is here proposed as a new algorithm for the conformational search in the low-energy regions of protein chains modeled as copolymers of hydrophobic and polar monomers configured as self-avoiding walks on square or cubic lattices. It may be regarded as an extension of the standard Monte Carlo method improved by the concept of cooperativity deriving from nonlocal contact interactions. A major difference with respect to other algorithms is that criteria for the acceptance of new conformations generated during the simulations are not based on the energy of the entire molecule, but cooling factors associated with each residue define regions of the model protein with higher or lower mobility. Nine sequences of length ranging from 20 to 64 residues were used on the square lattice and 15 sequences of length ranging from 46 to 136 residues were used on the cubic lattice. The CI algorithm proved very efficient both in two and three dimensions, and allowed us to localize energy minima not localized by other searching algorithms described in the literature. Use of this algorithm is not limited to the conformational search, because it allows the exploration of thermodynamic and kinetic behavior of model protein chains.

Algorithms↗

A refined accuracy index to evaluate algorithms of protein secondary structure prediction.

Nowadays even a 1% increase of the accuracy for the secondary structure prediction is considered remarkable progress. In this case, we have to consider the reasonableness of the accuracy index Q3, which is used widely. A refined accuracy index, called Q8, is proposed to evaluate algorithms of secondary structure prediction. It is shown that Q8 is superior to the widely used index Q3 in that the former carries more information of the predictive accuracy matrix than does the latter. Therefore, algorithms are evaluated more objectively by Q8 than Q3. Based on 396 nonhomologous proteins, five currently available algorithms of secondary structure prediction were evaluated and compared using the new index Q8. Of the five algorithms, PHD turned out to be the unique algorithm, with Q8 accuracy better than 70%. It is suggested that Q3 should be replaced by Q8 in evaluating secondary structure prediction in future studies.

Algorithms↗

Knowledge-based voting algorithm for automated protein functional annotation.

Automated annotation of high-throughput genome sequences is one of the earliest steps toward a comprehensive understanding of the dynamic behavior of living organisms. However, the step is often error-prone because of its underlying algorithms, which rely mainly on a simple similarity analysis, and lack of guidance from biological rules. We present herein a knowledge-based protein annotation algorithm. Our objectives are to reduce errors and to improve annotation confidences. This algorithm consists of two major components: a knowledge system, called "RuleMiner," and a voting procedure. The knowledge system, which includes biological rules and functional profiles for each function, provides a platform for seamless integration of multiple sequence analysis tools and guidance for function annotation. The voting procedure, which relies on the knowledge system, is designed to make (possibly) unbiased judgments in functional assignments among complicated, sometimes conflicting, information. We have applied this algorithm to 10 prokaryotic bacterial genomes and observed a significant improvement in annotation confidences. We also discuss the current limitations of the algorithm and the potential for future improvement.

Algorithms↗

New algorithms for processing and peak detection in liquid chromatography/mass spectrometry data.

Two new algorithms for automated processing of liquid chromatography/mass spectrometry (LC/MS) data are presented. These algorithms were developed from an analysis of the noise and artifact distribution in such data. The noise distribution was analyzed by preparing histograms of the signal intensity in LC/MS data. These histograms are well fit by a sum of two normal distributions in the log scale. One new algorithm, median filtering, provides increased performance compared to averaging adjacent scans in removing noise that is not normally distributed in the linear scale. Another new algorithm, vectorized peak detection, provides increased robustness with respect to variation in the noise and artifact distribution compared to methods based on determining an intensity threshold for the entire dataset. Vectorized peak detection also permits the incorporation of existing algorithms for peak detection in ion chromatograms and/or mass spectra. The application of these methods to LC/MS spectra of complex biological samples is described.

Algorithms↗

Presentation of a general algorithm to include effect assessment on secondary poisoning in the derivation of environmental quality criteria. 2. Terrestrial food chains.

In a previous study a simple algorithm was presented for effect assessment on secondary poisoning of birds and mammals. This algorithm (MPC = NOECfish-eater/BCFfish) was drawn up by analyzing a two-step aquatic food chain (water-fish-bird/mammal). The algorithm was used to test whether quality criteria set for surface water, based on effect assessment for aquatic organisms, constitute a "safe" level for secondary poisoning. The present study analyzes whether this algorithm can equally well be used for effect assessment in a terrestrial food chain. The pathway soil-earthworm-bird/mammal was used as an example for a terrestrial food chain. Literature data of six selected compounds (lindane, dieldrin, DDT, PCP, cadmium, and mercury) on both bioconcentration factors for earthworms and toxicity data for birds and mammals were studied. Important differences were found between BCFs for this terrestrial pathway and BCFs for the aquatic pathway analyzed in the previous study. It was found that BCFs for earthworms were more dependent on soil-related properties than on compound-specific properties. Hence, it was concluded that the algorithm MPC = NOECworm-eater/BCFworm can be used only for effect assessment on terrestrial food chain in defined situations. By calculating maximum permissible concentrations for secondary poisoning (MPCsp) for a standard soil situation and comparing these to MPCs for soil organisms, it was concluded that secondary poisoning could be a critical pathway for cadmium and methyl mercury. For methyl mercury secondary poisoning in an aquatic food chain was also a critical pathway. Secondary poisoning of fish-eating birds and mammals is not likely to occur for cadmium at concentrations in water below the MPC calculated for aquatic organisms.

Algorithms↗

An expectation maximization algorithm for training hidden substitution models.

We derive an expectation maximization algorithm for maximum-likelihood training of substitution rate matrices from multiple sequence alignments. The algorithm can be used to train hidden substitution models, where the structural context of a residue is treated as a hidden variable that can evolve over time. We used the algorithm to train hidden substitution matrices on protein alignments in the Pfam database. Measuring the accuracy of multiple alignment algorithms with reference to BAliBASE (a database of structural reference alignments) our substitution matrices consistently outperform the PAM series, with the improvement steadily increasing as up to four hidden site classes are added. We discuss several applications of this algorithm in bioinformatics.

Algorithms↗

The subclass approach for mutational spectrum analysis: application of the SEM algorithm.

Analysis and comparison of mutational spectra represents an important problem in molecular biology. To analyse a mutational spectra we apply an algorithm based on the SEM subclass approach (Simulation, Expectation, Maximization). The algorithm tries to classify the mutational sites according to different mutation probabilities, and each site should belong to one class. Each class is approximated by binomial distribution and thus any real mutational spectrum is regarded as a mixture of binomial distributions. The separation process runs iteratively. Each iteration includes the simulation, maximization and estimation procedures. To evaluate the quality of the classification results, the X2 test is used. The algorithm has been checked on random spectra with preset parameters and on real mutational spectra. As has been shown, 17 out of 19 analysed real mutational spectra can be divided into two or more classes of sites, of which one contains hotspots of mutation. For the G:C-->A:T mutational spectra induced by Sn1 alkylating mutagenes (11 spectra) the classification accuracy was 0.95. To test different site volumes, each Sn1-induced spectrum was divided into the G-->A and C-->T spectra. The classification accuracy for these spectra was 0.96. From the analysis of classification errors it is possible to suggest that at least part of them cannot be ascribed to the faults of the algorithm but are caused by some special features of the mutagenesis itself. The results of the real data are in good relation with existing knowledge. The approach we present is an attempt to formalize the concept of a "mutational hotspot". The program implementing the SEM algorithm is available on the Web server (http:/(/)www.itba.mi.cnr.it/webmutation).

Algorithms↗

A robust numerical algorithm for studying biomolecular transport processes.

We present a numerical algorithm that is well suited for the study of biomolecular transport processes. In the algorithm a continuous Markov process is discretized as a jump process and the jump rates are derived from local solutions of the continuous system. Consequently, the algorithm has two advantages over standard numerical methods: (1) it preserves detailed balance for equilibrium processes, (2) it is able to handle discontinuous potentials. The formulation of the algorithm also allows us to calculate the effective diffusion coefficient or, equivalently, the randomness parameter. We provide several simple examples of how to implement the algorithm. All the MATLAB functions files needed to reproduce the results presented in the article are available from www.amath.unc.edu/Faculty/telston/matlab_functions.

Algorithms↗

A rapid heuristic algorithm for finding minimum evolution trees.

The minimum sum of branch lengths (S), or the minimum evolution (ME) principle, has been shown to be a good optimization criterion in phylogenetic inference. Unfortunately, the number of topologies to be analyzed is computationally prohibitive when a large number of taxa are involved. Therefore, simplified, heuristic methods, such as the neighbor-joining (NJ) method, are usually employed instead. The NJ method analyzes only a small number of trees (compared with the size of the entire search space); so, the tree obtained may not be the ME tree (for which the S value is minimum over the entire search space). Different compromises between very restrictive and exhaustive search spaces have been proposed recently. In particular, the "stepwise algorithm" (SA) utilizes what is known in computer science as the "beam search," whereas the NJ method employs a "greedy search." SA is virtually guaranteed to find the ME trees while being much faster than exhaustive search algorithms. In this study we propose an even faster method for finding the ME tree. The new algorithm adjusts its search exhaustiveness (from greedy to complete) according to the statistical reliability of the tree node being reconstructed. It is also virtually guaranteed to find the ME tree. The performances and computational efficiencies of ME, SA, NJ, and our new method were compared in extensive simulation studies. The new algorithm was found to perform practically as well as the SA (and, therefore, ME) methods and slightly better than the NJ method. For searching for the globally optimal ME tree, the new algorithm is significantly faster than existing ones, thus making it relatively practical for obtaining all trees with an S value equal to or smaller than that of the NJ tree, even when a large number of taxa is involved.

Algorithms↗

Evaluation of an algorithm for the automated sequential assignment of protein backbone resonances: a demonstration of the connectivity tracing assignment tools (CONTRAST) software package.

The peptide sequential assignment algorithm presented here was implemented as a macro within the CONnectivity TRacing ASsignment Tools (CONTRAST) computer software package. The algorithm provides a semi- or fully automated global means of sequentially assigning the NMR backbone resonances of proteins. The program's performance is demonstrated here by its analysis of realistic computer-generated data for IIIGlc, a 168-residue signal-transducing protein of Escherichia coli [Pelton et al. (1991) Biochemistry, 30, 10043-10057]. Missing experimental data (19 resonances) were generated so that a complete assignment set could be tested. The algorithm produces sequential assignments from appropriate peak lists of nD NMR data. It quantifies the ambiguity of each assignment and provides ranked alternatives. A 'best first' approach, in which high-scoring local assignments are made before and in preference to lower scoring assignments, is shown to be superior (in terms of the current set of CONTRAST scoring routines) to approaches such as simulated annealing that seek to maximize the combined scores of the individual assignments. The robustness of the algorithm was tested by evaluating the effects of imposed frequency imprecision (scatter), added false signals (noise), missing peaks (incomplete data), and variation in user-defined tolerances on the performance of the algorithm.

Algorithms↗

Optimisation of metric matrix embedding by genetic algorithms.

To improve the convergence properties of 'embedding' distance geometry, a new approach was developed by combining the distance-geometry methodology with a genetic algorithm. This new approach is called DG-OMEGA (DG omega, optimised metric matrix embedding by genetic algorithms). The genetic algorithm was used to combine well-defined parts of individual structures generated by the distance-geometry program, and to identify new lower and upper distance bounds within the original experimental restraints in order to restrict the sampling of the metrisation algorithm to promising regions of the conformational space. The algorithm was tested on cyclosporin A, which is notorious for its intrinsic difficult sampling properties. A set of 58 distance restraints was employed. It was shown that DG omega resulted in an improvement of convergence behaviour as well as sampling properties with respect to the standard distance-geometry protocol.

Algorithms↗

Noninvasive blood pressure monitoring from the supraorbital artery using an artificial neural network oscillometric algorithm.

OBJECTIVE: Our objective was to overcome the limitations of linear models of oscillometric blood pressure determination by using a nonlinear technique to model the relationship between the oscillometric envelope and systolic and diastolic blood pressures, and then to use that technique for near-continuous arterial pressure monitoring at the supraorbital artery. METHODS: An adhesive pressure pad and transducer were used to collect oscillometric data from the supraorbital artery of 85 subjects. These data were then used to train an artificial neural network (ANN) to report diastolic or systolic pressure. Arterial pressure measurements defined by brachial artery auscultation were used as a reference. ANN results were compared with those obtained using a standard oscillometric algorithm that determined pressures based on fixed percentages of the maximum oscillometric amplitude. RESULTS: The ANN produced better estimates of reference blood pressures than the standard oscillometric algorithm. Mean difference between target and actual output for the ANN was 0.50 +/- 5.73 mm Hg for systolic pressures, compared to the mean difference of the standard algorithm of 2.78 +/- 19.38 mm Hg. For diastolic pressures, the ANN had a mean difference of 0.04 +/- 4.70 mm Hg, while the mean difference of the standard algorithm was -0.34 +/- 9.75 mm Hg. CONCLUSIONS: The ANN produced a better model of the relationship between the oscillometric envelope and reference systolic and diastolic pressures than did the standard oscillometric algorithm. Noninvasive blood pressure measured from the supraorbital artery agreed with pressure measured by auscultation in the brachial artery, and may sometimes be more clinically useful than an arm cuff device.

Adult↗

Prototype ventilator and alarm algorithm for the NASA space station.

An alarm algorithm was developed to monitor the ventilator on the National Aeronautics and Space Administration space station. The algorithm automatically identifies and interprets critical events so that an untrained user can manage the mechanical ventilation of a critically injured crew member. The algorithm was tested in two healthy volunteers by simulating 260 critical events in each volunteer while the volunteer breathed via the ventilator. Thirteen critical events were induced eight times in random order, for the five different modes of ventilation. These events included various ventilator tubing disconnects, leaks, and occlusions, as well as power and gas supply failures. The algorithm identified the critical events and generated alarms in response to 99.2% (516 of 520, total) of the events. The alarm textual messages were correct 98% (505 of 516 messages) of the time. The alarm algorithm is an improvement over current alarms found on most ventilators because its alarm messages specifically identify failures in the patient breathing circuit or ventilator. The system may improve patient care by helping critical care personnel respond more rapidly and correctly to critical events.

Algorithms↗

Systematic comparison of different algorithms for apnoea detection based on electrocardiogram recordings.

Sleep apnoea is a common disorder that is usually diagnosed through expensive studies conducted in sleep laboratories. Sleep apnoea is accompanied by a characteristic cyclic variation in heart rate or other changes in the waveform of the electrocardiogram (ECG). If sleep apnoea could be diagnosed using only the ECG, it could be possible to diagnose sleep apnoea automatically and inexpensively from ECG recordings acquired in the patient's home. This study had two parts. The first was to assess the ability of an overnight ECG recording to distinguish between patients with and without apnoea. The second was to assess whether the ECG could detect apnoea during each minute of the recording. An expert, who used additional physiological signals, assessed each of the recordings for apnoea. Research groups were invited to access data via the world-wide web and submit algorithm results to an international challenge linked to a conference. A training set of 35 recordings was made available for algorithm development, and results from a test set of 35 different recordings were made available for independent scoring. Thirteen algorithms were compared. The best algorithms made use of frequency-domain features to estimate changes in heart rate and the effect of respiration on the ECG waveform. Four of these algorithms achieved perfect scores of 100% in the first part of the study, and two achieved an accuracy of over 90% in the second part of the study.

Algorithms↗

Genetic algorithm for the efficient selection of disyllabic word lists used in Mandarin speech discrimination tests.

Speech audiometric tests have been widely used for advanced hearing diagnoses and in rehabilitation. However, there are no standardised speech tests for more than 90% of the world's population, who do not speak English. A major problem in the design of a speech audiometric test is that the selection of test materials is subject to multiple criteria, and its complexity rises dramatically as the structure of test items changes from phonemic or monosyllabic forms to disyllabic or polysyllabic forms. A genetic algorithm is presented that can automatically select a set of disyllabic words from a large Mandarin corpus. The selection accords with the following principal criteria for the items constituting a speech discrimination test: similarity in structure, familiarity to the subjects, and a phonemically balanced composition. The performance of the genetic algorithm was evaluated by computation of the distance between a target vector, specifying the desired distribution of initial and final syllables and tone patterns for daily disyllabic word usage, and the vector derived by the search results of the algorithm. The use of the genetic algorithm was illustrated by its application to the selection of test lists from two Mandarin corpora. The results showed that, for a given corpus, at least 12 disyllabic word lists with a distance of less than 20 could be generated within 72 h. The genetic algorithm performed an efficient, robust and low-complexity search of the problem space and can be easily modified to adapt to the material selection of other languages.

Algorithms↗

Spectra of data sampled at frequency-modulated rates in application to cardiovascular signals: Part 2. Evaluation of Fourier transform algorithms.

For three direct Fourier transform algorithms we quantified the influence of pulse frequency modulation (PFM) on the spectral estimation of pulse amplitude modulation (PAM). The simulation study is based on sinusoid functions sampled according to a pulse sequence which is the output of an integral pulse frequency modulator (IPFM). One algorithm exactly reproduces the theoretical spectrum derived in Part 1. The other two, including the classical FFT, scale all PFM-induced components in a different way, and in addition, generate higher modulating frequency harmonics. For a PFM depth below 30%, the sum of spurious PFM components is almost linearly dependent on this modulation depth, for all three algorithms. Dividing the effect of PFM in a 'harmonic' and 'aliasing' distortion, we found that the FFT has a relatively high harmonic distortion, compared to an algorithm that takes into account the non-uniform character of the data. In the cardiovascular (worst) case of 30% modulation in heart rate (PFM) at a frequency of 0.1 Hz, the FFT spectrum of beat-to-beat systolic blood pressure variations contains approximately 20% of spurious components caused solely by the modulation in time occurrences of the blood pressure samples. The 'non-uniform' algorithm performs twice as well in this case.

Algorithms↗

The geriatric medication algorithm: a pilot study.

A geriatric medication algorithm designed to reduce inappropriate prescribing was tested in a resident outpatient clinic. The medications of patients over 65 years old taking more than three medications (n = 41) were compared pre- and post-algorithm using the paired t-test. Pre-algorithm, the average number of drugs was 5.8 per patient (SD 1.62). Fifteen medications (6.4%) were discontinued, seven were substituted for a less toxic medication, and five were added. Post-algorithm, the average number of drugs was 5.6 (SD 1.69), mean difference 0.3 (SD 0.67), p < 0.025. Drugs discontinued were more likely to be high risk compared with drugs used at baseline; drugs added were less likely to be high risk. In this pilot study, the authors conclude that the algorithm helps resident physicians reduce inappropriate prescribing.

Aged↗

The early diagnosis of acute myocardial infarction. Comparison of a simple algorithm with a computer program for electrocardiogram interpretation.

The sensitivity and specificity of electrocardiographic (ECG) interpretation by a simple algorithm was compared with a computer read ECG machine. Clinical data and ECG findings on 264 consecutive patients admitted to a coronary care unit with suspected acute myocardial infarction were prospectively entered into an algorithm with 13 end-points. These end-points were compared with the interpretations of a computer read ECG machine (Marquette MAC PC). 86 patients (32.5%) had confirmed acute infarction. 85% of those with infarction had some form of ST elevation on their initial ECG. Patients with ST elevation presented earlier (4.9 +/- 4.9 versus 8.0 +/- 9.7 hours after symptom onset, p < 0.001), and were older (66.5 +/- 11.0 versus 62.0 +/- 12.5 years, p < 0.01) than those without infarction. According to the algorithm 94.2% of patients with infarction had some form of ECG abnormality, compared with 55.6% of those without infarction (p < 0.001). The area under the receiver operating characteristic (ROC) curve of the algorithm was 92.3% of the area of the graph. This was more (p < 0.01) than the area under the ROC curve of the interpretations of the computer read ECG machine (83.9%). Marked ST elevation with reciprocal changes was the most specific indicators of infarction (Likelihood ratio 51.7). The algorithm, therefore, was comparatively sensitive and specific in the early diagnosis of acute infarction.

Adult↗