Search PubMed⌕ Search

PubMed · 16370427

Modeling skin collimation using the electron pencil beam redefinition algorithm.

Abstract

Skin collimation is an important tool for electron beam therapy that is used to minimize the penumbra when treating near critical structures, at extended treatment distances, with bolus, or using arc therapy. It is usually made of lead or lead alloy material that conforms to and is placed on patient surface. Presently, commercially available treatment-planning systems lack the ability to model skin collimation and to accurately calculate dose in its presence. The purpose of the present work was to evaluate the use of the pencil beam redefinition algorithm (PBRA) in calculating dose in the presence of skin collimation. Skin collimation was incorporated into the PBRA by terminating the transport of electrons once they enter the skin collimator. Both fixed- and arced-beam dose calculations for arced-beam geometries were evaluated by comparing them with measured dose distributions for 10- and 15-MeV beams. Fixed-beam dose distributions were measured in water at 88-cm source-to-surface distance with an air gap of 32 cm. The 6 x 20-cm2 field (dimensions projected to isocenter) had a 10-mm thick lead collimator placed on the surface of the water with its edge 5 cm inside the field's edge located at +10 cm. Arced-beam dose distributions were measured in a 13.5-cm radius polystyrene circular phantom. The beam was arced 90 degrees (-45 degrees to +45 degrees), and 10-mm thick lead collimation was placed at +/- 30 degrees. For the fixed beam at 10 MeV, the PBRA- calculated dose agreed with measured dose to within 2.0-mm distance to agreement (DTA) in the regions of high-dose gradient and 2.0% in regions of low dose gradient. At 15 MeV, the PBRA agreed to within a 2.0-mm DTA in the regions of high-dose gradient; however, the PBRA underestimated the dose by as much as 5.3% over small regions at depths less than 2 cm because it did not model electrons scattered from the edge of the skin collimation. For arced beams at 10 MeV, the agreement was 1-mm DTA in the high-dose gradient regions, and 2% in the low-dose gradient regions. For arced beams at 15 MeV, the agreement was 1 mm in the high-dose gradient regions, and in the low-dose gradient region at depth less than 2 cm, as much as 5% dose difference was observed. This study demonstrated the ease with which skin collimation can be incorporated into the PBRA. The good agreement of PBRA calculated with measured dose shows that the PBRA is likely sufficiently accurate for clinical use in the presence of skin collimation for electron arc therapy. To further improve the accuracy of the PBRA in regions having significant electrons scattered from the edge of the skin collimation would require transporting the electrons through the lead skin collimation near its edges.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pai-Chun M Chi, Kenneth R Hogstrom, George Starkschall, John A Antolak, Robert A Boyd. 2005. Modeling skin collimation using the electron pencil beam redefinition algorithm.. https://doi.org/10.1118/1.2064808

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

KEEP EXPLORING

Related citations

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↗

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↗

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↗