PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16266087

Brachytherapy source characterization for improved dose calculations using primary and scatter dose separation.

Kellie R Russell·Asa K Carlsson Tedgren·Anders Ahnesjö
View original source ↗Export metadata ↓

Abstract

In brachytherapy, tissue heterogeneities, source shielding, and finite patient/phantom extensions affect both the primary and scatter dose distributions. The primary dose is, due to the short range of secondary electrons, dependent only on the distribution of material located on the ray line between the source and dose deposition site. The scatter dose depends on both the direct irradiation pattern and the distribution of material in a large volume surrounding the point of interest, i.e., a much larger volume must be included in calculations to integrate many small dose contributions. It is therefore of interest to consider different methods for the primary and the scatter dose calculation to improve calculation accuracy with limited computer resources. The algorithms in present clinical use ignore these effects causing systematic dose errors in brachytherapy treatment planning. In this work we review a primary and scatter dose separation formalism (PSS) for brachytherapy source characterization to support separate calculation of the primary and scatter dose contributions. We show how the resulting source characterization data can be used to drive more accurate dose calculations using collapsed cone superposition for scatter dose calculations. Two types of source characterization data paths are used: a direct Monte Carlo simulation in water phantoms with subsequent parameterization of the results, and an alternative data path built on processing of AAPM TG43 formatted data to provide similar parameter sets. The latter path is motivated of the large amounts of data already existing in the TG43 format. We demonstrate the PSS methods using both data paths for a clinical 192Ir source. Results are shown for two geometries: a finite but homogeneous water phantom, and a half-slab consisting of water and air. The dose distributions are compared to results from full Monte Carlo simulations and we show significant improvement in scatter dose calculations when the collapsed-cone kernel-superposition algorithm is used compared to traditional table based calculations. The PSS source characterization method uses exponential fit functions derived from one-dimensional transport theory to describe both the primary and scatter dose contributions. We present data for the PSS characterization method to different 192Ir, 137Cs, and 60Cs brachytherapy sources. We also show how TG43 formatted data can be derived from our data to serve traditional treatment planning systems, as to enable for a gradual transfer to algorithms that provides improved modeling of heterogeneities in brachytherapy treatment planning.

Explore related subjects

AlgorithmsBrachytherapyHumansModels, BiologicalMonte Carlo MethodPhantoms, ImagingRadiotherapy DosageRadiotherapy Planning, Computer-AssistedScattering, RadiationJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kellie R Russell, Asa K Carlsson Tedgren, Anders Ahnesjö. 2005. Brachytherapy source characterization for improved dose calculations using primary and scatter dose separation.. https://doi.org/10.1118/1.1949767

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↗