PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 12033584

A Monte Carlo study on internal wedges using BEAM.

W van der Zee·J Welleweerd
View original source ↗Export metadata ↓

Abstract

To do calculations for wedged photon beams with the NRC Monte Carlo simulation package BEAM, a new Component Module for wedges called WEDGE has been designed and built. After an initial series of benchmarks using monoenergetic photon beams as well as realistic 6 MV and 10 MV beams, it was found, that the new CM did work fine for the large wedge (maximum field size 30 x 40 cm2) of the Elekta SL-linac. The next step was to calculate dose distributions and output factors for a range of wedged fields with field size from 3 x 3 cm2 to 30 x 30 cm2. Results from these simulations have been compared to measurements. Calculated values for the reference wedge transmission factor and the relative wedge transmission factors were within 1.5% from the measured data. Dose distributions showed an identical behavior; both depth-dose curves as well as cross profiles were within 1.5% from measured data, usually even better. Despite the increased mean energy, there was no indication that, as a result, the phantom scatter output factors will change for a 10 MV photon beam. It was found that by adding a wedge the contributions for the different sources of head scatter changed considerably as compared to the open fields, apart from the additional scatter from the wedge. Another consequence of inserting a wedge was an increase in the mean energy of both primary and scattered radiation with 0.3 MV and 0.7 MV, respectively, for all wedged fields with respect to the corresponding open fields. Despite the statistical uncertainty in the calculated data, which is in the same order of magnitude as the effect to be determined, it was possible to derive reliable data for the beam hardening from the calculated dose distributions. Only for the smallest field (field size 3 x 3 cm2) a large difference between the measured and calculated beam hardening factor was found due to the relative large voxel size of 1 x 1 x 1 cm3 compared to the field size. For a description of the influence of a wedge on a photon beam, the results of this study strongly support the use of a reference wedge transmission factor (determined under reference conditions) in combination with a relative wedge transmission factor. The product of these variables should replace the collimator scatter output factor used in open fields. The influence on the dose distribution should be incorporated by using the (field size dependent) beam hardening. The ultimate solution will be to make this beam hardening depending on the actual position in the radiation field, as the photon energy varies over the field (holds also for open fields).

Explore related subjects

AlgorithmsBiophysical PhenomenaBiophysicsHumansMonte Carlo MethodParticle AcceleratorsPhotonsRadiotherapy Planning, Computer-AssistedRadiotherapy, High-EnergyScattering, RadiationComparative StudyJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

W van der Zee, J Welleweerd. 2002. A Monte Carlo study on internal wedges using BEAM.. https://doi.org/10.1118/1.1473132

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↗