PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 2008174

Pencil-beam redefinition algorithm for electron dose distributions.

A S Shiu·K R Hogstrom
View original source ↗Export metadata ↓

Abstract

A pencil-beam redefinition algorithm has been developed for the calculation of electron-beam dose distributions on a three-dimensional grid utilizing 3-D inhomogeneity correction. The concept of redefinition was first used for both fixed and arced electron beams by Hogstrom et al. but was limited to a single redefinition. The success of those works stimulated the development of the pencil-beam redefinition algorithm, the aim of which is to solve the dosimetry problems presented by deep inhomogeneities through development of a model that redefines the pencil beams continuously with depth. This type of algorithm was developed independently by Storchi and Huizenga who termed it the "moments method." Such a pencil beam within the patient is characterized by a complex angular distribution, which is approximated by a Gaussian distribution having the same first three moments as the actual distribution. Three physical quantities required for dose calculation and subsequent radiation transport--namely planar fluence, mean direction, and root-mean-square spread about the mean direction--are obtained from these moments. The primary difference between the moments method and the redefinition algorithm is that the latter subdivides the pencil beams into multiple energy bins. The algorithm then becomes a macroscopic method for transporting the complete phase space of the beam and allows the calculation of physical quantities such as fluence, dose, and energy distribution. Comparison of calculated dose distributions with measured dose distributions for a homogeneous water phantom, and for phantoms with inhomogeneities deep relative to the surface, show agreement superior to that achieved with the pencil-beam algorithm of Hogstrom et al. in the penumbral region and beneath the edges of air and bone inhomogeneities. The accuracy of the redefinition algorithm is within 4% and appears sufficient for clinical use, and the algorithm is structured for further expansion of the physical model if required for site-specific treatment planning problems.

Explore related subjects

AlgorithmsElectronsHumansModels, StructuralRadiotherapy DosageRadiotherapy Planning, Computer-AssistedJournal ArticleResearch Support, U.S. Gov't, P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A S Shiu, K R Hogstrom. Pencil-beam redefinition algorithm for electron dose distributions.. https://doi.org/10.1118/1.596697

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↗