PubMed Health⌕ Search

PubMed · 12788195

Intraoperative dynamic dose optimization in permanent prostate implants.

Abstract

PURPOSE: With the advent of intraoperative optimized planning, the treatment of prostate cancer with permanent implants has reached an unprecedented level of dose conformity. However, because of well-documented (and unavoidable) inaccuracies in seed placement into the gland, carrying out a plan results in a large degree of variability relative to the intended dose distribution. This brings forth the need to periodically readjust the plan to allow for the real positions of seeds already implanted. In this paper, an algorithm for performing this task, hereby described as intraoperative dynamic dose optimization (IDDO), is presented and assessed. METHODS AND MATERIALS: The general scheme for performing IDDO consists of three steps: (1) at some point during the implant, coordinates of implanted seeds are identified; (2) seed images are projected onto the reference frame of the ultrasound images for planning; and (3) the plan is reoptimized. Work on the first two steps is reported elsewhere. Here, we focus on the strategy for implementing the reoptimization step. An optimal treatment plan is first obtained based on initial operating room-acquired ultrasound images. We analyze the sensitivity and effect of the IDDO procedure with respect to the total number of reoptimizations performed. Specifically, we consider reoptimizing 2, 3, and 4 times. When two reoptimizations are used, half of the seeds from the initial optimal plan are implanted. The first reoptimization is performed on the remaining possible seed positions, and all the seeds designated in this reoptimized plan are implanted. The second (final) reoptimization is done on the remaining unused seed positions to ensure 100% coverage of the gland and to eliminate possible cold spots in the gland. Similarly, when three reoptimization steps are used, one-third of the seeds from the initial optimized plan, one-half of the seeds from the first reoptimization, and all seeds from the second reoptimization are implanted. The third (final) reoptimization is performed to assist in eliminating possible cold spots. Reoptimizing four times proceeds in a like manner. Fifteen patient cases are used for comparison. Strict dose bounds of 100% and 120% of the prescription dose are imposed on the urethra, and 100% coverage is imposed on the prostate volume. To assist in achieving good conformity, prostate contour points are assigned a target upper dose bound of 150% of the prescription dose. RESULTS: A two-way comparison is performed: (a) initial optimized plan, (b) IDDO plan. Postimplant dose analysis, coverage and conformity measures, as well as actual dose received by urethra and rectum are used to gauge the results. The initial optimized plan consistently provides 93% prescription dose coverage to the gland with average conformity index of 1.32. The urethra dose ranges within 100% to 150%, and the maximum dose delivered to the rectum reaches 91% of the prescription dose. On average, about 50% of the urethra receives more than 120% of the prescription dose, and 19% of the rectum volume receives more than the 78% upper dose limit. For the IDDO plan, 100% postimplant coverage with 1.16 conformity is achieved. Urethra and rectum dose is maintained within the prescribed 100% to 120% range and 78% upper bound, respectively. CONCLUSIONS: With real-time treatment planning, it is possible to dynamically reoptimize treatment plans to account for actual seed positions (as opposed to planned positions) and needle-induced swelling to the gland during implantation. Postimplant analysis shows that the final seed configuration resulting from the IDDO method yields improved dosimetry. The algorithmic design ensures that one can achieve complete coverage while maintaining good conformity, thus sparing excess radiation to external tissue. The study also provides evidence of the possibility of morbidity reduction to urethra and rectum (because of reduced dose delivered to these structures) via the use of IDDO planning. Clinical studies are needed to validate the importance of our approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eva K Lee, Marco Zaider. 2003-07-01. Intraoperative dynamic dose optimization in permanent prostate implants.. https://doi.org/10.1016/s0360-3016(03)00291-8

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↗