PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16752577

Three-dimensional dose verification for intensity modulated radiation therapy using optical CT based polymer gel dosimetry.

Cheng-Shie Wuu·Y Xu
View original source ↗Export metadata ↓

Abstract

Dose distributions generated from intensity-modulated-radiation-therapy (IMRT) treatment planning present high dose gradient regions in the boundaries between the target and the surrounding critical organs. Dose accuracy in these areas can be critical, and may affect the treatment. With the increasing use of IMRT in radiotherapy, there is an increased need for a dosimeter that allows for accurate determination of three-dimensional (3D) dose distributions with high spatial resolution. In this study, polymer gel dosimetry and an optical CT scanner have been employed to implement 3D dose verification for IMRT. A plastic cylinder of 17 cm diameter and 12 cm height, filled with BANG3 polymer gels (MGS Research, Inc., Madison, CT) and modified to optimal dose-response characteristics, was used for IMRT dose verification. The cylindrical gel phantom was immersed in a 24 x 24 x 20 cm water tank for an IMRT irradiation. The irradiated gel sample was then scanned with an optical CT scanner (MGS Research Inc., Madison, CT) utilizing a single He-Ne laser beam and a single photodiode detector. Similar to the x-ray CT process, filtered back-projection was used to reconstruct the 3D dose distribution. The dose distributions measured from the gel were compared with those from the IMRT treatment planning system. For comparative dosimetry, a solid water phantom of 24 x 24 x 20 cm, having the same geometry as the water tank for the gel phantom, was used for EDR2 film and ion chamber measurements. Root mean square (rms) deviations for both dose difference and distance-to-agreement (DTA) were used in three-dimensional analysis of the dose distribution comparison between treatment planning calculations and the gel measurement. Comparison of planar dose distributions among gel dosimeter, film, and the treatment planning system showed that the isodose lines were in good agreement on selected planes in axial, coronal, and sagittal orientations. Absolute point-dose verification was performed with ion chamber measurements at four different points, varying from 48% to 110% of the prescribed dose. The measured and calculated doses were found to agree to within 4.2% at all measurement points. For the comparison between the gel measurement and treatment planning calculations, rms deviations were 2%-6% for dose difference and 1-3 mm for DTA, at 60%-110% doses levels. The results from this study show that optical CT based polymer gel dosimetry has the potential to provide a high resolution, accurate, three-dimensional tool for IMRT dose distribution verification.

Explore related subjects

AlgorithmsGelsImage Interpretation, Computer-AssistedImaging, Three-DimensionalPolymersRadiometryRadiotherapy DosageRadiotherapy Planning, Computer-AssistedRadiotherapy, ConformalTomography, OpticalEvaluation StudyJournal ArticleResearch Support, N.I.H., ExtramuralValidation Study

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cheng-Shie Wuu, Y Xu. 2006. Three-dimensional dose verification for intensity modulated radiation therapy using optical CT based polymer gel dosimetry.. https://doi.org/10.1118/1.2188820

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↗