PubMed Health⌕ Search

PubMed · 16898464

Real-time tumor tracking using implanted positron emission markers: concept and simulation study.

Abstract

The delivery accuracy of radiation therapy for pulmonary and abdominal tumors suffers from tumor motion due to respiration. Respiratory gating should be applied to avoid the use of a large target volume margin that results in a substantial dose to the surrounding normal tissue. Precise respiratory gating requires the exact spatial position of the tumor to be determined in real time during treatment. Usually, fiducial markers are implanted inside or next to the tumor to provide both accurate patient setup and real-time tumor tracking. However, current tumor tracking systems require either substantial x-ray exposure to the patient or large fiducial markers that limit the value of their application for pulmonary tumors. We propose a real-time tumor tracking system using implanted positron emission markers (PeTrack). Each marker will be labeled with low activity positron emitting isotopes, such as 124I, 74As, or 84Rb. These isotopes have half-lives comparable to the duration of radiation therapy (from a few days to a few weeks). The size of the proposed PeTrack marker will be 0.5-0.8 mm, which is approximately one-half the size of markers currently employed in other techniques. By detecting annihilation gammas using position-sensitive detectors, multiple positron emission markers can be tracked in real time. A multimarker localization algorithm was developed using an Expectation-Maximization clustering technique. A Monte Carlo simulation model was developed for the PeTrack system. Patient dose, detector sensitivity, and scatter fraction were evaluated. Depending on the isotope, the lifetime dose from a 3.7 MBq PeTrack marker was determined to be 0.7-5.0 Gy at 10 mm from the marker. At the center of the field of view (FOV), the sensitivity of the PeTrack system was 240-320 counts/s per 1 MBq marker activity within a 30 cm thick patient. The sensitivity was reduced by 45% when the marker was near the edge of the FOV. The scatter fraction ranged from 12% (124I, 74As) to 16% (84Rb). In addition, four markers (labeled with 124I) inside a 30 cm diameter water phantom were simulated to evaluate the feasibility of the multimarker localization algorithm. Localization was considered successful if a marker was localized to within 2 mm from its true location. The success rate of marker localization was found to depend on the number of annihilation events used and the error in the initial estimate of the marker position. By detecting 250 positron annihilation events from 4 markers (average of 62 events per marker), the marker success rates for initial errors of +/-5, +/-10, and +/-15 mm were 99.9%, 99.6%, and 92.4%, respectively. Moreover, the average localization error was 0.55 (+/-0.27) mm, which was independent of initial error. The computing time for localizing four markers was less than 20 ms (Pentium 4, 2.8 GHz processor, 512 MB memory). In conclusion, preliminary results demonstrate that the PeTrack technique can potentially provide real-time tumor tracking with low doses associated with the marker's activity. Furthermore, the small size of PeTrack markers is expected to facilitate implantation and reduce patient risk.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tong Xu, Jerry T Wong, Polad M Shikhaliev, Justin L Ducote, Muthana S Al-Ghazi, Sabee Molloi. 2006. Real-time tumor tracking using implanted positron emission markers: concept and simulation study.. https://doi.org/10.1118/1.2207213

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↗