PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 11578726

Optically guided intensity modulated radiotherapy.

W A Tomé·S L Meeks·T R McNutt·J M Buatti·F J Bova·W A Friedman·M Mehta
View original source ↗Export metadata ↓

Abstract

BACKGROUND AND PURPOSE: Previously, we reported on development of an optically guided system for 3D conformal intracranial radiotherapy using multiple noncoplanar fixed fields. In this paper we report on the extension of our system for stereotactic fractionated radiotherapy to include intensity modulated static ports. METHODS AND MATERIALS: A 3D treatment plan with maximum beam separation is developed in the stereotactic space established by an optically guided system. Gantry angles are chosen such that each beam has a unique entrance and exit pathway, avoids the critical structures, and has a minimal beam's eye view projection. Once, a satisfactory treatment plan is found using this geometric approach an inverse treatment plan is developed using the beam portals established previously. The purpose of adding inverse planing is two fold, on the one hand it allows further reduction of margins around the PTV, while on the other hand it affords the possibility of conformal avoidance of critical structures that are close to or abut the PTV. RESULTS: The use of the optically guided system in conjunction with intensity modulated noncoplanar radiotherapy treatment planning using fixed fields allows the generation of highly conformal treatment plans that exhibit smaller 90, 70, and 50% of prescription dose isodose volumes, improved PITV ratios, comparable or improved EUD, smaller NTD(mean) for the critical structures, and an inhomogeneity index that is within generally accepted limits. CONCLUSION: Because optically guided technology improves the accuracy of patient localization relative to the linac isocenter and allows real-time monitoring of patient position, the planning target volume needs to be corrected only for the limitations of image resolution. Intensity modulated static beam radiotherapy planning then provides the user the ability to further reduce margins on the PTV and to conform very closely to this smaller target volume, and enhances the normal tissue sparing, and high degree of conformality possible with 3D conformal radiotherapy. In addition, since optically guided technology affords improved patient localization and online monitoring of patient position during treatment delivery it allows for safe and efficient delivery of intensity modulated radiotherapy.

Explore related subjects

AlgorithmsHumansNeoplasmsOptics and PhotonicsPhantoms, ImagingRadiation MonitoringRadiotherapy DosageRadiotherapy Planning, Computer-AssistedRadiotherapy, ConformalCase ReportsComparative StudyJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

W A Tomé, S L Meeks, T R McNutt, J M Buatti, F J Bova, W A Friedman, M Mehta. 2001. Optically guided intensity modulated radiotherapy.. https://doi.org/10.1016/s0167-8140(01)00414-5

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↗