PubMed Health⌕ Search

PubMed · 12377350

Evaluation of concave dose distributions created using an inverse planning system.

Abstract

PURPOSE: To evaluate and develop optimum inverse treatment planning strategies for the treatment of concave targets adjacent to normal tissue structures. METHODS AND MATERIALS: Optimized dose distributions were designed using an idealized geometry consisting of a cylindrical phantom with a concave kidney-shaped target (PTV) and cylindrical normal tissues (NT) placed 5-13 mm from the target. Targets with radii of curvature from 1 to 2.75 cm were paired with normal tissues with radii between 0.5 and 2.25 cm. The target was constrained to a prescription dose of 100% and minimum and maximum doses of 95% and 105% with relative penalties of 25. Maximum dose constraint parameters for the NT varied from 10% to 70% with penalties from 10 to 1000. Plans were evaluated using the PTV uniformity index (PTV D(max)/PTV D(95)) and maximum normal tissue doses (NT D(max)/PTV D(95)). RESULTS: In nearly all situations, the achievable PTV uniformity index and the maximum NT dose exceeded the corresponding constraints. This was particularly true for small PTV-NT separations (5-8 mm) or strict NT dose constraints (10%-30%), where the achievable doses differed from the requested by 30% or more. The same constraint parameters applied to different PTV-NT separations yielded different dose distributions. For most geometries, a range of constraints could be identified that would lead to acceptable plans. The optimization results were fairly independent of beam energy and radius of curvature, but improved as the number of beams increased, particularly for small PTV-NT separations or strict dose constraints. CONCLUSION: Optimized dose distributions are strongly affected by both the constraint parameters and target-normal tissue geometry. Standard site-specific constraint templates can serve as a starting point for optimization, but the final constraints must be determined iteratively for individual patients. A strategy whereby NT constraints and penalties are modified until the highest acceptable PTV uniformity index is achieved is discussed. This strategy can be used, in simple patient geometries, to ensure the lowest possible normal tissue dose. Strategies for setting the optimum dose constraints and penalties may vary for different optimization algorithms and objective functions. Increasing the number of beams can significantly improve normal tissue dose and target uniformity in situations where the PTV-NT separation is small or the normal tissue dose limits are severe. Setting unrealistically severe constraints in such situations often results in dose distributions that are inferior to plans achieved with more lenient constraints.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Margie A Hunt, Ching-Yeh Hsiung, Spirodon V Spirou, Chen-Shou Chui, Howard I Amols, Clifton C Ling. 2002-11-01. Evaluation of concave dose distributions created using an inverse planning system.. https://doi.org/10.1016/s0360-3016(02)03004-3

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↗