PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 11439491

A measured data set for evaluating electron-beam dose algorithms.

R A Boyd·K R Hogstrom·J A Antolak·A S Shiu
View original source ↗Export metadata ↓

Abstract

The purpose of this work was to develop an electron-beam dose algorithm verification data set of high precision and accuracy. Phantom geometries and treatment-beam configurations used in this study were similar to those in a subset of the verification data set produced by the Electron Collaborative Working Group (ECWG). Measurement techniques and quality-control measures were utilized in developing the data set to minimize systematic errors inherent in the ECWG data set. All measurements were made in water with p-type diode detectors and using a Wellhöfer dosimetry system. The 9 and 20 MeV, 15 x 15 cm2 beams from a single linear accelerator composed the treatment beams. Measurements were made in water at 100 and 110 cm source-to-surface distances. Irregular surface measurements included a "stepped surface" and a "nose-shaped surface." Internal heterogeneity measurements were made for bone and air cavities in differing orientations. Confidence in the accuracy of the measured data set was reinforced by a comparison with Monte Carlo (MC)-calculated dose distributions. The MC-calculated dose distributions were generated using the OMEGA/BEAM code to explicitly model the accelerator and phantom geometries of the measured data set. The precision of the measured data, estimated from multiple measurements, was better than 0.5% in regions of low-dose gradients. In general, the agreement between the measured data and the MC-calculated data was within 2%. The quality of the data set was superior to that of the ECWG data set, and should allow for a more accurate evaluation of an electron beam dose algorithm. The data set will be made publicly available from the Department of Radiation Physics at The University of Texas M. D. Anderson Cancer Center.

Explore related subjects

AlgorithmsBiophysical PhenomenaBiophysicsElectronsHumansMonte Carlo MethodPhantoms, ImagingRadiotherapy Planning, Computer-AssistedRadiotherapy, ConformalRadiotherapy, High-EnergyWaterComparative StudyEvaluation StudyJournal ArticleResearch Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R A Boyd, K R Hogstrom, J A Antolak, A S Shiu. 2001. A measured data set for evaluating electron-beam dose algorithms.. https://doi.org/10.1118/1.1374245

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↗