PubMed Health⌕ Search

PubMed · 11764035

Discretizing large traceable vessels and using DE-MRI perfusion maps yields numerical temperature contours that match the MR noninvasive measurements.

Abstract

The success of hyperthermia treatments is dependent on thermal dose distribution. However, the three-dimensional temperature distribution remains largely unknown. Without this knowledge, the relationship between thermal dose and outcome is noisy, and therapy cannot be optimized. Accurate computations of thermal distribution can contribute to an optimized therapy. The hyperthermia modeling group in the Department of Radiotherapy, University Medical Center Utrecht devised a Discrete Vasculature [Kotte et al., Phys. Med. Biol. 41, 865-884 (1996)] model that accounts for the presence of vessel trees in the computational domain. The vessel tree geometry is tracked using magnetic resonance (MR) angiograms to a minimum diameter between 0.6 and 1 mm. However, smaller vessels (0.2-0.6 mm) are known to account for significant heat transfer. The hyperthermia group at Duke University Medical Center has proposed using perfusion maps derived from dynamic-enhanced magnetic resonance imaging to account for the tissue perfusion heterogeneity [Craciunescu et al., Int. J. Hyperthermia 17, 221-239 (2001)]. In addition, techniques for noninvasive temperature measurements have been devised to measure temperatures in vivo [Samulski et al., Int. J. Hypertherminal, 819-829 (1992)]. In this work, a patient with high-grade sarcoma has been retrospectively modeled to determine the temperature distribution achieved during a hyperthermia treatment. Available for this model were MR depicted geometry, angiograms, perfusion maps, as necessary for accurate thermal modeling, as well as MR thermometry data for validation purposes. The vasculature assembly through modifiable potential program [Van Leeuwen et al., IEEE Trans. Biomed. Eng. 45, 596-604 (1998)] was used in order to incorporate the traceable large vessels. Temperature simulations were made using different approaches to describe perfusion. The simulated cases were the bioheat equation with constant perfusion rates per tissue type, perfusion maps alone, tracked vessel tree and perfusion maps, and generated vessel tree. The results were compared with MR thermometry data for a single patient data set, concluding that a combination between large traceable vessels and perfusion map yields the best results for this particular patient. The technique has to be repeated on several patients, first with the same type of malignancy, and after that, on patients having malignancies at other different sites.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

O I Craciunescu, B W Raaymakers, A N Kotte, S K Das, T V Samulski, J J Lagendijk. 2001. Discretizing large traceable vessels and using DE-MRI perfusion maps yields numerical temperature contours that match the MR noninvasive measurements.. https://doi.org/10.1118/1.1408619

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↗