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

PubMed1984

An automated algorithm for radionuclide angiocardiographic quantitation of circulatory shunting.

Circulatory shunting may be quantitated by analysis of time-activity curves obtained from radionuclide angiocardiography. A new automated algorithm for performing this analysis is proposed. The algorithm uses mathematical deconvolution techniques to increase the temporal separation of the components of this curve and thereby improves the accuracy of the analysis. The stability of the algorithm to random data errors was assessed by experiments on simulated time-activity curves degraded with pseudorandom noise. Excellent performance was obtained on a set of test problems previously used in the literature. The algorithm was used to quantitate left-to-right shunting in patients undergoing radionuclide angiocardiography during cardiac catheterization. A strong correlation (r = 0.96) was found between pulmonary to systemic flow ratios (Qp:Qs) obtained using the algorithm on radionuclide angiocardiographic data and Qp:Qs values obtained by oximetry at cardiac catheterization.

Adolescent↗

PubMed1983

Algorithms for processing spatial information.

Pairs of stimuli taken from a psychometric measure of spatial aptitude were shown to 9-year-olds, 13-year-olds, and adults. The stimuli in pairs were (a) either identical or mirror images, and (b) presented in orientations that differed by 0-150 degrees. Individuals judged, as rapidly as possible, if the stimuli in a pair would be identical or mirror images if presented at the same orientation. In Experiment 1, in which the stimuli were letter-like characters, at all ages most persons solved the problems using an algorithm in which an individual encodes the stimuli in working memory, mentally rotates one stimulus to the orientation of the other, compares them to determine if they are identical, and responds. In Experiment 2, the stimuli were multielement flags; here, the modal algorithm for both 9- and 13-year-olds differed from the previously described algorithm in that if the comparison process revealed that the stimuli were dissimilar, individuals did not respond immediately, but continued processing until a self-imposed deadline was reached. Among adults, the modal algorithm was the same one used in Experiment 1. Results are discussed in terms of the roles of encoding in contributing to the use of a particular algorithm.

Adolescent↗

PubMed1986

Fluid resuscitation of hypotensive emergency patients with and without an algorithm.

Seventy-seven consecutive hypotensive (mean arterial pressure (MAP) less than 80 mmHg) surgical emergency patients were resuscitated according to either physicians' individual orders (38 patients) or an algorithm (39 patients). The shock was mainly caused by accidental injuries or acute gastrointestinal bleeding. The patients of the algorithm group were given more plasma expanders than the patients of the control group, while the total amount of fluids administered was similar in both groups. The primary goal of the resuscitation (MAP greater than 80 mmHg) was reached within 30 min in three cases in the control group and in seven cases in the algorithm group. The treatment times at the emergency department and the intensive care unit were similar for the groups. The number of severe and moderate pulmonary disturbances was the same, but mild disturbances were significantly more common in the control group. Renal failure was somewhat more common in the control group and the renal function disturbances were significantly more severe among the control patients. The results suggest that the physicians in some extent altered their practices in fluid resuscitation when the algorithm was put to use, and that this change, perhaps, produced the somewhat better outcome of the patients. The authors recommend the algorithm to be used as a basis of shock treatment and particularly in those emergency departments where the resuscitation of hypotensive patients is performed by junior or inexperienced physicians.

Adolescent↗

PubMed1994

A fast random cost algorithm for physical mapping.

Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational/statistical problem in genetics. Here we present a physical mapping algorithm for creating ordered genomic libraries or contig maps by using a random cost approach [Berg, A. (1993) Nature (London) 361, 708-710]. This random cost algorithm is 5-10 times faster than existing physical mapping algorithms and has optimization performance comparable to existing procedures. The speedup in the algorithm makes practical the widespread use of bootstrap resampling to assess the statistical reliability of links in the physical map as well as the use of more elaborate physical mapping criteria to improve map quality. The random cost algorithm is illustrated by its application in assembling a physical map of chromosome IV from the filamentous fungus Aspergillus nidulans.

Aspergillus nidulans↗

PubMed1986

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.

There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n. These algorithms allow mismatches, deletions and insertions. Algorithms to date run in O(mn) time. Let us define an integer, k, which is the maximal number of differences allowed. We present a simple algorithm showing that sequences can be optimally aligned in O(k2n) time. For long sequences the gain factor over the currently used algorithms is very large.

Amino Acid Sequence↗

PubMed1986

A microcomputer algorithm for solving compartmental models involving radionuclide transformations.

An algorithm for solving first-order non-recycling compartment models is described. Given the initial amounts of a radioactive material in each compartment and the fundamental transfer rate constants between each compartment, the algorithm gives both the amount of material remaining at any time t and the integrated number of transformations that would occur up to time t. The method is analytical, and consequently, is ideally suited for implementation on a microcomputer. For a typical microcomputer with 64 kilobytes of random access memory, a model containing up to 100 compartments, with any number of interconnecting translocation routes, can be solved in a few seconds; providing that no recycling occurs. An example computer program, written in 30 lines of Microsoft BASIC, is included in an appendix to demonstrate the use of the algorithm. A detailed description is included to show how the algorithm is modified to satisfy the requirements commonly encountered in compartment modelling, for example, continuous intake, partitioning of activity, and transformations from radioactive progeny. Although the algorithm does not solve models involving recycling, it is often possible to represent such cases by a non-recycling model which is mathematically equivalent.

Computers↗

PubMed1985

A new scan conversion algorithm for ultrasound compound scanning.

An improved scan conversion algorithm for ultrasound compound scanning is proposed. In this algorithm, the input data in the spatial domain is sampled by the concentric square raster sampling (CSRS) method, and the display pixel data are filled by one-dimensional linear interpolation. The reconstruction error of the proposed algorithm is much smaller than that of other algorithms, because only one-dimensional, rather than two-dimensional, interpolation is involved. This algorithm greatly simplifies implementation of a real-time digital scan converter (DSC) for spatial compounding of ultrasound images.

Mathematics↗

PubMed1985

Image reconstruction from coded data: I. Reconstruction algorithms and experimental results.

Two algorithms have been developed for reconstructing objects from their coded images and a priori knowledge of the object class. Reconstructions from both algorithms are presented, but the results appear to be largely independent of the algorithm used. One of the algorithms, a Monte Carlo approach, is used to investigate the quality of the reconstruction of two- and three-dimensional objects from simulated coded-image data with respect to viewing geometry and multiplexing (mixing) of the data. The cases examined include reconstructions from data with and without signal-dependent photon noise. It is found that reconstructing from multiplexed data is not so serious a problem as reconstructing from data obtained with a limited viewing angle. Also, when photon noise is included in the data, reconstructions obtained from multiplexed data are better than those obtained from unmultiplexed data because of the higher photon count made available by multiplexing. It appears that the fidelity of a reconstruction depends much more strongly on the design of the data-taking system (the coded apertures) than on the reconstruction algorithm.

Models, Structural↗

PubMed1982

Phased trial of a proven algorithm at a new primary care clinic.

A previous study showed that a clinical algorithm for respiratory illnesses, consisting of a checklist, a set of instructions (logic), and computer audit/feedback, could reduce costs significantly while maintaining a high quality of care. The results of this study show that the algorithm system, developed and validated at one primary care clinic, can be successfully imported to another primary care clinic. In the present study, the algorithm system significantly improved the completeness of the medical records, reduced the use of medical tests by 20 per cent-75 per cent, and reduced non-provider costs by 36 per cent per patient visit. This study also shows that all three components of the algorithm system appear to be necessary to achieve these improvements and maintain a high quality of medical care. These results suggest that a wider use of the algorithm system for minor acute medical problems is both feasible and useful in providing high-quality cost-effective care that is auditable.

Adult↗

PubMed1983

Accuracy of deconvolution algorithms assessed by simulation studies: concise communication.

Deconvolution has been used to correct first-pass radionuclide angiocardiography for the time course of the delivery of radiopharmaceutical into the cardiopulmonary system. The extreme sensitivity of deconvolution to random errors in the data may account for some of the problems encountered in practice. We implemented several deconvolution algorithms that were suitable for use with the unimodal and multimodal superior vena caval and pulmonary curves found in left-to-right shunt quantification. The sensitivity of the algorithms to random errors was assessed using mathematical test problems degraded with pseudorandom noise. An algorithm that constrained the deconvolved pulmonary curve to be expressable as the non-negative sum of a set of lagged normal curves was found to have the smallest maximum error on the curves tested. Comparison with results from a previously published test problem indicated an error reduction of greater than 50% over previously used algorithms. Use of this algorithm may permit more accurate deconvolution of pulmonary time-activity curves and thereby improve shunt quantification.

Heart↗

PubMed1980

[Differential diagnosis of endometrial diseases by scrapings based on setting up an algorithm of the histological study].

In order to facilitate the diagnostic analysis of histologic changes in biopsies of endometrial diseases, it is suggested that the use should be made of the first order algorithm developed on the basis of the experience gained so far. This algorithm excludes the oversight of visible changes and predetermines the subsequent activities of an assistant. During differential diagnosis of endometrial diseases the staged synthesis is effected by making up the second order algorithm from the first order algorithmic elements. The suggested diagnostic procedure developed on the basis of algorithmization and probable concepts is time-saving and creats conditions for more successful verification of the pathological process.

Biopsy↗

PubMed1981

Evaluating antimicrobial use with an algorithm.

An algorithm (integrated series of screening criteria) for evaluating antimicrobial use is described. The algorithm was initially designed during a survey of the antimicrobial use for 117 patients. After the survey, the criteria in the algorithm were refined by a literature search; 10 criteria in the algorithm were added, six of which concerned the prophylactic use of antimicrobials. Two hospitals used the algorithm and reported that it reduced the number of hours needed to establish final audit criteria.

Anti-Infective Agents↗

PubMed1991

Comparison of analytic algorithms for detecting glaucomatous visual field loss.

The sensitivity and specificity of alternate analytic strategies for recognizing glaucomatous visual field loss from automated threshold perimetry (C-30-2 test of the Humphrey Field Analyzer) were compared among one eye each of 106 patients with glaucoma and 249 normal subjects. Algorithms included commercially available global indexes and cross-meridional differences (Statpac 1 and Statpac 2), as well as cross-meridional and cluster analyses that were developed independently for natural history studies and clinical trials. The sensitivity of most algorithms was high, except for those that used only diffuse loss as an indicator of abnormality. Specificity was acceptably high for all algorithms. Subjects who failed to meet the manufacturer's standard for reliability had much reduced specificity, but sensitivity was also affected. Algorithms that were based on any of the alternate definitions of localized reduction in retinal sensitivity performed equally well, which suggests that any of these approaches is useful in searching for glaucomatous visual loss as typified by this database. Availability, familiarity, and convenience may govern the selection of any one analytic approach for use in a particular setting.

Algorithms↗

PubMed1993

Quantitative evaluation of several partial Fourier reconstruction algorithms used in MRI.

Partial Fourier reconstruction algorithms exploit the redundancy in magnetic resonance data sets so that half of the data is calculated during image reconstruction rather than acquired. The conjugate synthesis, Margosian, homodyne detection, Cuppen and POCS algorithms are evaluated using spatial frequency domain analysis to show their characteristics and where limitations may occur. The phase correction used in partial Fourier reconstruction is equivalent to a convolution in the frequency domain and the importance of accurately implementing this convolution is demonstrated. New reconstruction approaches, based on passing the partial data through a phase correcting, finite impulse response (FIR), digital filter are suggested. These FIR and MoFIR algorithms have a speed near that of the Margosian and homodyne detection reconstructions, but with a lower error; close to that of the Cuppen/POCS iterative approaches. Quantitative analysis of the partial Fourier algorithms, tested with three phase estimation techniques, are provided by comparing artificial and clinical data reconstructed using full and partial Fourier techniques.

Algorithms↗

PubMed1995

Continuous and discontinuous domains: an algorithm for the automatic generation of reliable protein domain definitions.

An algorithm is presented for the fast and accurate definition of protein structural domains from coordinate data without prior knowledge of the number or type of domains. The algorithm explicitly locates domains that comprise one or two continuous segments of protein chain. Domains that include more than two segments are also located. The algorithm was applied to a nonredundant database of 230 protein structures and the results compared to domain definitions obtained from the literature, or by inspection of the coordinates on molecular graphics. For 70% of the proteins, the derived domains agree with the reference definitions, 18% show minor differences and only 12% (28 proteins) show very different definitions. Three screens were applied to identify the derived domains least likely to agree with the subjective definition set. These screens revealed a set of 173 proteins, 97% of which agree well with the subjective definitions. The algorithm represents a practical domain identification tool that can be run routinely on the entire structural database. Adjustment of parameters also allows smaller compact units to be identified in proteins.

Actins↗

PubMed1993

A fast algorithm for the optimal alignment of three strings.

Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting algorithm has worst-case time-complexity O(nd2) and space-complexity O(d3), where the string lengths are ñ and d is the three-way edit-distance based on tree-costs. In practice, the algorithm usually runs in O(n + d3) time. The algorithm is particularly fast when the strings are similar, in which case, d << n. Three-way alignment is an important special case in string alignment. Each internal node in an unrooted, binary evolutionary-tree has three neighbours. The algorithm presented can be used as an iterative step in a heuristic multiple-alignment program for more than three strings.

Algorithms↗

PubMed1995

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↗

PubMed1996

A tissue composition-based algorithm for predicting tissue:air partition coefficients of organic chemicals.

The objectives of the present study were (i) to develop an algorithm for predicting the tissue:air partition coefficients (PCs) of volatile organic chemicals (VOCs) and (ii) to apply this algorithm to predict the rat tissue:air PCs of 45 VOCs. The approach consisted of estimating the tissue:air PCs by dividing the tissue solubility of chemicals by their saturable vapor concentrations. The tissue solubility of chemicals was calculated as the sum total of their solubility in neutral lipid, phospholipid, and water fractions of tissues. The rat liver:air, muscle:air, and adipose tissue:air PCs predicted using this algorithm compared well with literature data available for several ketones, alcohols, acetate esters, alkanes, haloalkanes, aromatic hydrocarbons, and diethyl ether. The average ratios between the predicted and experimental values of the tissue:air PC values were 0.94 (liver), 0.93 (muscle), and 1.10 (adipose tissue). The mechanistic algorithm developed in the present study should be useful for predicting tissue:air PCs of VOCs and for verifying the current default assumption of considering tissue:air PCs to be species-invariant.

Adipose Tissue↗