Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Dynamic Programming”

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 37 records · Page 2Linked to original sources
PubMed1992

A contig assembly program based on sensitive detection of fragment overlaps.

An effective computer program for assembling DNA fragments, the contig assembly program (CAP), has been developed. In the CAP program, a filter is used to eliminate quickly fragment pairs that could not possibly overlap, a dynamic programming algorithm is applied to compute the maximal-scoring overlapping alignment between each remaining pair of fragments, and a simple greedy approach is employed to assemble fragments in order of alignment scores. To identify the true fragment overlaps, the dynamic programming algorithm uses specially chosen sets of alignment parameters to tolerate sequencing errors and to penalize "mutational" changes between different copies of a repetitive sequence. The performance tests of the program on fragment data from genomic sequencing projects produced satisfactory results. The CAP program is efficient in computer time and memory; it took about 4 h to assemble a set of 1015 fragments into long contigs on a Sun workstation.

Algorithms↗
PubMed2026

Exhausted CD8+ T cell fate is programmed by dynamic CTCF-mediated enhancer activation and invariant CTCF-imposed barriers.

Exhausted CD8+ T (TEX) cells undergo extensive genome reorganization during differentiation, yet the drivers of this process remain elusive. Here we show that CTCF programmed CD8+ TEX cell fates through two distinct modes of action. CTCF acquired de novo binding sites and concordantly induced open chromatin in early CD8+ TEX cells responding to chronic viral infection. The dynamic CTCF binding activated enhancers and promoted chromatin looping. Consequently, genetic ablation of CTCF diminished chromatin accessibility and interaction strength, impairing CD8+ TEX cell proliferation, effector function and bioenergetic mobilization. Conversely, invariant CTCF binding acted as essential chromatin barriers, and loss of CTCF disrupted insulation and caused aberrant chromatin self-association and undue RNA polymerase II pausing, leading to excessive activation of exhaustion- and stemness-linked genes. Thus, CTCF balanced CD8+ TEX cell differentiation by gaining dynamic binding to induce cytotoxicity and sustain metabolic fitness, while its invariant binding compartmentalized exhaustion and stemness program genes to prevent their overexuberant activation.

CCCTC-Binding Factor↗
PubMed1992

Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory.

Given an amino acid sequence, we discuss how to find efficiently an optimal set of disjoint regions (substrings, domains, modules, etc.), each of which can be matched to some element of a predefined inventory containing, for example, consensus sequences, protosequences, or protein family profiles. A two-stage approach to sequence decomposition, consisting of the detection of all acceptable matches followed by the construction of an optimal subset of compatible matches, leads to computational difficulties. When the problem is reformulated in terms of network comparisons, it can be solved in time quadratic in the length of the sequence and linear with the number of templates in the inventory, by a single pass of a dynamic programming algorithm. This method has the advantage that the criterion for acceptable matches can be relaxed without materially affecting computing time. Except under special conditions it is more efficient than previous segmentation methods based on dynamic programming.

Algorithms↗
PubMed1991

A simple method to generate non-trivial alternate alignments of protein sequences.

A major problem in sequence alignments based on the standard dynamic programming method is that the optimal path does not necessarily yield the best equivalencing of residues assessed by structural or functional criteria. An algorithm is presented that finds suboptimal alignments of protein sequences by a simple modification to the standard dynamic programming method. The standard pairwise weight matrix elements are modified in order to penalize, but not eliminate, the equivalencing of residues obtained from previous alignments. The algorithm thereby yields a limited set of alternate alignments that can differ considerably from the optimal. The approach is benchmarked on the alignments of immunoglobulin domains. Without a prior knowledge of the optimal choice of gap penalty, one of the suboptimal alignments is shown to be more accurate than the optimal.

Algorithms↗
PubMed1989

A tool for multiple sequence alignment.

Multiple sequence alignment can be a useful technique for studying molecular evolution and analyzing sequence-structure relationships. Until recently, it has been impractical to apply dynamic programming, the most widely accepted method for producing pairwise alignments, to comparisons of more than three sequences. We describe the design and application of a tool for multiple alignment of amino acid sequences that implements a new algorithm that greatly reduces the computational demands of dynamic programming. This tool is able to align in reasonable time as many as eight sequences the length of an average protein.

Algorithms↗
PubMed1990

Genetic algorithms and evolution.

The genetic algorithm (GA) as developed by Holland (1975, Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press) is an optimization technique based on natural selection. We use a modified version of this technique to investigate which aspects of natural selection make it an efficient search procedure. Our main modification to Holland's GA is the subdividing of the population into semi-isolated demes. We consider two examples. One is a fitness landscape with many local optima. The other is a model of singing in birds that has been previously analysed using dynamic programming. Both examples have epistatic interactions. In the first example we show that the GA can find the global optimum and that its success is improved by subdividing the population. In the second example we show that GAs can evolve to the optimal policy found by dynamic programming.

Algorithms↗
PubMed1991

A novel randomized iterative strategy for aligning multiple protein sequences.

The rigorous alignment of multiple protein sequences becomes impractical even with a modest number of sequences, since computer memory and time requirements increase as the product of the lengths of the sequences. We have devised a strategy to approach such an optimal alignment, which modifies the intensive computer storage and time requirements of dynamic programming. Our algorithm randomly divides a group of unaligned sequences into two subgroups, between which an optimal alignment is then obtained by a Needleman-Wunsch style of algorithm. Our algorithm uses a matrix with dimensions corresponding to the lengths of the two aligned sequence subgroups. The pairwise alignment process is repeated using different random divisions of the whole group into two subgroups. Compared with the rigorous approach of solving the n-dimensional lattice by dynamic programming, our iterative algorithm results in alignments that match or are close to the optimal solution, on a limited set of test problems. We have implemented this algorithm in a computer program that runs on the IBM PC class of machines, together with a user-friendly environment for interactively selecting sequences or groups of sequences to be aligned either simultaneously or progressively.

Amino Acid Sequence↗
PubMed1992

Evolution of an automated ST-segment analysis program for dynamic real-time, noninvasive detection of coronary occlusion and reperfusion.

Patients in whom early and stable reperfusion through the infarct artery fails after thrombolytic treatment might benefit from further revascularization therapy. A reliable noninvasive technique able to detect both reperfusion and reocclusion would be useful to test this hypothesis. However, no such technique presently exists. ST-segment recovery analysis using continuous digital 12-lead ST monitoring has been shown to be an accurate predictor of infarct artery patency in real time. This method was dependent on a trained clinician's analysis of the recordings on a personal computer. For optimal bedside application, salient principles of this ST-segment recovery analysis were converted into algorithms and built into the ST monitor software. The essentials of these algorithms are described in this report.

Electrocardiography↗
PubMed2026

Episode clustering in phylogenetic networks.

MOTIVATION: The classical duplication episode clustering (EC) model introduced by Guigó et al. in the 1990s provides a foundational approach for inferring genomic duplication events crucial to understanding genome evolution. This model clusters single gene duplications from a collection of gene trees at locations in the species tree to minimize the total number of such locations, called duplication episodes. However, it does not capture reticulate evolutionary histories. RESULTS: Here, we introduce NetEC, a novel extension of this problem to phylogenetic networks. To solve NetEC, we first develop a polynomial-time dynamic programming (DP) algorithm for testing whether a given set of network nodes can serve as episode locations. We then propose a main inference algorithm that utilizes this DP component to optimize the episode count; while the feasibility test runs in polynomial time, the full optimization has exponential worst-case complexity, and an optional heuristic mode is provided for larger instances. We also propose an extended episode analysis procedure that identifies additional genomic duplication candidates below reticulation nodes, complementing the main algorithm by resolving potential upward clustering of duplications induced by reticulation. We evaluate our method on simulated data and on an empirical Pandanales dataset comprising over 29 000 gene trees, demonstrating exact and accurate inference of genomic duplication events even in the presence of multiple reticulations. AVAILABILITY AND IMPLEMENTATION: All experiments were conducted using the NetEC tool (https://github.com/ppgorecki/netec), with all input data, scripts, and parameter settings for reproduction available in the same repository.

Phylogeny↗
PubMed2026

Singletrack: an algorithm for improving memory consumption and performance of gap-affine sequence alignment.

MOTIVATION: Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy. RESULTS: We present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires storing a single DP matrix while preserving optimal alignment results. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e. 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. We demonstrate that Singletrack reduces memory consumption for both SK and WFA algorithms, lowering SK usage by 2× and 4× and WFA usage by 3× and 5× for gap-affine and dual gap-affine alignments, respectively. Moreover, replacing KSW2's memory-reduction technique with Singletrack accelerates its SK implementation by up to 1.4× at the cost of doubling memory consumption, while Singletrack increases the performance of the WFA implementation in WFA2-lib by 1.2-2.1×. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2× higher performance. AVAILABILITY AND IMPLEMENTATION: The Singletrack implementations presented in this work are available on Zenodo (DOI: 10.5281/zenodo.18770585) and GitHub (https://github.com/LorienLV/singletrack).

Algorithms↗
PubMed1976

Computer-aided anaesthesia administration.

Certain repetitive tasks of the anaesthesiologist are studied and modelled for automatic processing. These analyses make it possible for optimal control procedures to be programmed and administered by less trained anaesthesia professionals. A dynamic programming model is developed and validated with real data collected from several hospitals in the Cleveland, Ohio, area. By conjunctively monitoring certain transients in the anaesthesia administration process, the scarce supply of anaesthesiology manpower can be more efficiently deployed.

Anesthesia↗
PubMed1988

Statistical method for rapid homology search.

A new method for homology search of DNA sequences is suggested. This method may be used to find extensive and not strong homologies with point mutations and deletions. The running program time for comparing sequences is less then the dynamic program algorithms at least at two orders of magnitude. It makes possible to use the method for homology searching throughover the nucleotide bank by personal computers.

Algorithms↗
PubMed1985

Primary care of adolescents. Issues in program development and implementation.

Recent reviews of adolescent primary care urge the development of a dynamic program evaluation strategy. An action research evaluation model that combines service, training, and research to foster the development and implementation of primary care services is presented. The strategy includes description of patient populations, determination of patient health care needs, specification of service objectives, assessment of health care resources, and evaluation of service procedures and outcomes. Elements of the action research strategy are applied to evaluate two current issues in adolescent primary care: family-oriented versus adolescent-limited services and "new morbidity".

Adolescent↗
PubMed1978

Dynamic scintigraphy: calculatiion and imaging of regional distribution of quantitative parameters.

The theory and general method of calculation of the parametric (functional) images at dynamic studies is described briefly. This method is illustrated by a general program DYNAM. PARAM. PRESENT. created for Clincom apparatus. Moreover, the selection of parameters and algorithms for calculation, the problems associated with the filtration of data, the correction for dead time and for non-homogeneity are discussed. In addition to the general method, there are presented here the possible ways of application of the simplified methods of construction of the parametric images by means of algebraic operations between images in special cases. Some aspects of that method are completed by examples of practical parametric images of some organs.

Computers↗
PubMed1992

A graphics program for the analysis and display of molecular dynamics trajectories.

The program SCARECROW has been developed to help the molecular modeler to analyze and display the very big and complex data files produced by molecular dynamics programs. The molecular graphics program SCARECROW is written to support the display, animation, and extensive analysis of molecular dynamics trajectories. Using the macro language it is easy to make scripts for video animation and for the automated display and analysis of time series. Extensive coloring and atom selection commands are included to help the user to focus on relevant regions of the molecule. Time series can be produced and viewed on the screen or transferred to other programs.

Chemical Phenomena↗
PubMed1991

Optimal control for the active above-knee prosthesis.

Control of an active above-knee prosthesis has been simulated for a selected gait activity using a hierarchical closed-loop method. An extension of finite-state control, referred to as artificial reflex control, was adopted at the strategic level of control. At the actuator level of control an optimal tracking method, based on dynamic programming, is applied. This deals mainly with the actuator level of control, but considers the interaction of the leg dynamics and the switching effects of artificial reflex control. Optimal tracking at the actuator level of the above-knee prosthesis reduces the on-off effects of finite-state methods, such as artificial reflex control. The proposed method can also be used for the design of prosthetic elements. Specific attention is paid to the limited torque and power in the prosthetic joint actuator, which are imposed by the principle of self-containment in the artificial leg. The hierarchical structure, integrating artificial reflex control and optimal tracking, can be used in real time, as estimated from the number of computer operations required for the suggested method.

Artificial Limbs↗
PubMed1990

A precise analytical method for calculating the electrostatic energy of macromolecules in aqueous solution.

A new method for calculating the total electrostatic free energy of a macromolecule in solution is presented. It is applicable to molecules of arbitrary shape and size, including membranes or macromolecular assemblies with substrate molecules and ions. The method is derived from integrating the energy density of the electrostatic field and is termed the field energy method. It is based on the dielectric model, in which the solute and the surrounding water are regarded as different continuous dielectrics. The field energy method yields both the interaction energy between all charge pairs and the self energy of single charges, effectively accounting for the interaction with water. First, the dielectric boundary and mirror charges are determined for all charges of the solute. The energy is then given as a simple function of the interatomic distances, and the standard atomic partial charges and volumes. The interaction and self energy are shown to result from three-body and pairwise interactions. Both energy terms explicitly involve apolar atoms, revealing that apolar groups are also subject to electrostatic forces. We applied the field energy method to a spherical model protein. Comparison with the Kirkwood solution shows that errors are within a small percentage. As a further test, the field energy method was used to calculate the electrostatic potential of the protein superoxide dismutase. We obtained good agreement with the result from a program that implements the numerical finite difference algorithm. The field energy method provides a basis for energy minimization and dynamics programs that account for the solvent and screening effect of water at little computational expense.

Electricity↗
PubMed1988

A flexible multiple sequence alignment program.

The 'regions' method for multisequence alignment used in the previously reported program MALIGN has been generalized to include recursive refinement so that unaligned portions between two regions at the current level of resolution can be handled with increased resolution. Additionally, there is incorporated a limiting of the number of regions to be used at any level of resolution from which to abstract an alignment. This provides a significant increase in speed over the unlimited version. The program GENALIGN uses this improved regions method to execute fast pairwise alignments in the framework of Taylor's multisequence alignment procedure using clustered pairwise alignments. Pairwise alignments by dynamic programming are also provided in the program.

Algorithms↗