PubMed Health⌕ Search

PubMed · 15798272

A particle track-repeating algorithm for proton beam dose calculation.

Abstract

A particle track-repeating algorithm has been developed for proton beam dose calculation for radiotherapy. Monoenergetic protons with 250 MeV kinetic energy were simulated in an infinite water phantom using the GEANT3 Monte Carlo code. The changes in location, angle and energy for every transport step and the energy deposition along the track were recorded for the primary protons and all secondary particles. When calculating dose for a patient with a realistic proton beam, the pre-generated particle tracks were repeated in the patient geometry consisting of air, soft tissue and bone. The medium and density for each dose scoring voxel in the patient geometry were derived from patient CT data. The starting point, at which a proton track was repeated, was determined according to the incident proton energy. Thus, any protons with kinetic energy less than 250 MeV can be simulated. Based on the direction of the incident proton, the tracks were first rotated and for the subsequent steps, the scattering angles were simply repeated for air and soft tissue but adjusted properly based on the scattering power for bone. The particle step lengths were adjusted based on the density for air and soft tissue and also on the stopping powers for bone while keeping the energy deposition unchanged in each step. The difference in nuclear interactions and secondary particle generation between water and these materials was ignored. The algorithm has been validated by comparing the dose distributions in uniform water and layered heterogeneous phantoms with those calculated using the GEANT3 code for 120, 150, 180 and 250 MeV proton beams. The differences between them were within 2%. The new algorithm was about 13 times faster than the GEANT3 Monte Carlo code for a uniform phantom geometry and over 700 times faster for a heterogeneous phantom geometry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J S Li, B Shahine, E Fourkal, C-M Ma. 2005-02-17. A particle track-repeating algorithm for proton beam dose calculation.. https://doi.org/10.1088/0031-9155%2F50%2F5%2F022

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↗