PubMed Health⌕ Search

PubMed · 9681895

First clinical tests using a liquid-filled electronic portal imaging device and a convolution model for the verification of the midplane dose.

Abstract

BACKGROUND AND PURPOSE: Recently, algorithms have been developed to derive the patient dose from portal dose measurements using a liquid-filled electronic portal imaging device. These algorithms have already been validated for several phantom geometries irradiated under clinical conditions. It is the aim of the present study to investigate the applicability of a liquid-filled electronic portal imaging device in combination with these algorithms for two-dimensional midplane dose verification in clinical practice. MEASUREMENTS AND METHODS: Portal dose images were obtained during several patient treatments under routine clinical conditions. Measurements were performed to verify the midplane dose during radiotherapy of larynx cancer with 4 MV beams, breast and lung cancer with 8 MV beams and prostate cancer with both 8 and 18 MV beams. Midplane doses, determined from portal dose measurements and analyzed with our algorithms, were compared with midplane doses calculated with our three-dimensional (3D) treatment planning system (TPS). RESULTS: For the larynx treatment the measured 2D midplane dose agreed within 2.0% with TPS calculations in most parts of the field. Larger differences were found in a small region below the skin due to the absence of electron equilibrium, which is not taken into account in our portal dose analysis. For breast irradiations the measured midplane dose showed a homogeneous distribution in the AP direction in the axial plane, while high dose regions were observed in the cranial and caudal part of the breast. Portal dose measurements and TPS calculations agreed within 2.5% for most of the prostate and lung irradiations. For a few of the prostate and lung treatments larger local differences were found due to differences between the actual patient anatomy and the planning CT data, e.g. as a result of variable gas filling in the rectum and anatomical changes in the lung. CONCLUSIONS: Portal dose measurements with a liquid-filled electronic portal imaging device can be used to determine the 2D midplane dose for various treatment sites in clinical practice. Portal in vivo dosimetry has proven to be important in detecting changes in the patient's anatomy and its influence on the dose delivery. It is concluded that portal dosimetry is an excellent tool for accurate and independent verification of the dose in the entire (2D) midplane during patient treatment. However, a limited number of patients were involved in this study and the results are therefore preliminary. More research is needed to fully assess the clinical value of portal dose measurements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R Boellaard, M van Herk, H Uiterwaal, B Mijnheer. 1998. First clinical tests using a liquid-filled electronic portal imaging device and a convolution model for the verification of the midplane dose.. https://doi.org/10.1016/s0167-8140(98)00008-5

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↗