PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 10075263

Planning of beam intensity modulation using an advanced 3D dose calculation algorithm and a simulated annealing method.

A T Redpath
View original source ↗Export metadata ↓

Abstract

PURPOSE: The aim of this work was to develop a fast inverse planning algorithm that will calculate optimum beam intensity distributions and beam shapes, and to incorporate the algorithm into a three-dimensional CT planning system. METHOD: The algorithm is based on the technique of simulated annealing and produces beam intensity distributions that could in principle be implemented clinically, either by the use of compensators or dynamic multileaf collimation. Dose distributions are calculated using a voxel beam model based on a spherical co-ordinate system, and transformations are given allowing the dose to be determined at any point within the patient. The dose calculation algorithm calculates primary and scattered dose separately from a knowledge of tissue/air ratios and differential scatter/air ratios, and both are corrected for the presence of heterogeneities in three dimensions. Specific attention is given to the execution time of the algorithm, and the methods developed allow satisfactory results to be achieved in calculation times which are sufficiently fast to be used interactively in the planning system. Several objective functions have been developed and can be selected in a simple manner by the user. In general, these attempt to achieve a uniform dose within the target while limiting the dose to organs at risk, either by upper dose limits or by specifying constraints on their dose volume histograms. RESULTS: The beam intensity distributions produced from the optimization have been used automatically by the forward planning system to produce three-dimensional dose distributions, and the results obtained in a number of clinical situations are presented. CONCLUSIONS: The inverse planning algorithm developed has been successfully incorporated into a three-dimensional planning system and is capable of producing beam intensity modulated distributions for clinical implementation. The execution time of the algorithm is sufficiently fast to be used as an optimization tool in an interactive forward planning system.

Explore related subjects

AlgorithmsBreast NeoplasmsComputer SimulationFemaleHumansLung NeoplasmsRadiotherapy DosageRadiotherapy Planning, Computer-AssistedReproducibility of ResultsSensitivity and SpecificitySpinal Cord NeoplasmsTomography, X-Ray ComputedUrinary Bladder NeoplasmsComparative StudyJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A T Redpath. 1998. Planning of beam intensity modulation using an advanced 3D dose calculation algorithm and a simulated annealing method.. https://doi.org/10.1016/s0167-8140(98)00083-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2026

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗
PubMed2026

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗
PubMed2026

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗