PubMed Health⌕ Search

PubMed · 10435822

Proton dosimetry intercomparison based on the ICRU report 59 protocol.

Abstract

BACKGROUND AND PURPOSE: A new protocol for calibration of proton beams was established by the ICRU in report 59 on proton dosimetry. In this paper we report the results of an international proton dosimetry intercomparison, which was held at Loma Linda University Medical Center. The goals of the intercomparison were, first, to estimate the level of consistency in absorbed dose delivered to patients if proton beams at various clinics were calibrated with the new ICRU protocol, and second, to evaluate the differences in absorbed dose determination due to differences in 60Co-based ionization chamber calibration factors. MATERIALS AND METHODS: Eleven institutions participated in the intercomparison. Measurements were performed in a polystyrene phantom at a depth of 10.27 cm water equivalent thickness in a 6-cm modulated proton beam with an accelerator energy of 155 MeV and an incident energy of approximately 135 MeV. Most participants used ionization chambers calibrated in terms of exposure or air kerma. Four ionization chambers had 60Co-based calibration in terms of absorbed dose-to-water. Two chambers were calibrated in a 60Co beam at the NIST both in terms of air kerma and absorbed dose-to-water to provide a comparison of ionization chambers with different calibrations. RESULTS: The intercomparison showed that use of the ICRU report 59 protocol would result in absorbed doses being delivered to patients at their participating institutions to within +/-0.9% (one standard deviation). The maximum difference between doses determined by the participants was found to be 2.9%. Differences between proton doses derived from the measurements with ionization chambers with N(K)-, or N(W) - calibration type depended on chamber type. CONCLUSIONS: Using ionization chambers with 60Co calibration factors traceable to standard laboratories and the ICRU report 59 protocol, a distribution of stated proton absorbed dose is achieved with a difference less than 3%. The ICRU protocol should be adopted for clinical proton beam calibration. A comparison of proton doses derived from measurements with different chambers indicates that the difference in results cannot be explained only by differences in 60Co calibration factors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S Vatnitsky, M Moyers, D Miller, G Abell, J M Slater, E Pedroni, A Coray, A Mazal, W Newhauser, O Jaekel, J Heese, A Fukumura, Y Futami, L Verhey, I Daftari, E Grusell, A Molokanov, C Bloch. 1999. Proton dosimetry intercomparison based on the ICRU report 59 protocol.. https://doi.org/10.1016/s0167-8140(99)00060-2

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↗