PubMed Health⌕ Search

PubMed · 16084410

Update to pulse sequences for interventional MR imaging.

Abstract

The motivations for developing MR-guided minimally invasive therapy include its excellent soft tissue contrast, tomographic imaging in any direction (as opposed to projection imaging as in fluoroscopy), the absence of ionizing radiation,the abundance of contrast mechanisms (including bright blood pulse sequences that lead to excellent vessel conspicuity without exogenous contrast agent injection), the ability to obtain physiologic information such as perfusion, and an overall excellent safety profile. The main pulse sequences used today for interventional MR imaging are T1/T2-weighted FISP and TrueFISP, T2-weighted turbo spin-echo, and T1-weighted FLASH. The specific clinical question, the underlying pathophysiology,and the procedure to be performed dictate which sequence is used. Each of these sequences has been written to acquire data in conventional rectilinear trajectories, radial k-space paths, or even spirals. In many ways, the questions being researched in interventional MR imaging have been dictated by the primary issues in greatest need of resolution or that most directly facilitate new clinical development. A decade ago, research focused on exploration of new scan strategies for contrast and temporal resolution. Advancements in the last decade have made it possible to acquire and display greater than 10 images per second in realtime with millimeter resolution in all three directions. This temporal and spatial resolution is considered high enough to guide most interventions. With this capability, other research has focused on instrument tracking. The field has gone from the capability to track a single coil and superimpose it on a previously acquired roadmap to systems that follow, adapt, and provide high-resolution images due to the advent of multichannel receiver systems, improved graphics, higher processor speeds, and increases in speed and quantity of memory. Hence, instruments can be reliably identified and tracked and the information can be used to update pulse sequence parameters in real time, thereby opening new opportunities for interventional MR imaging that extend from biopsy and thermal therapy to image-guided vascular and cardiac procedures. Today, we see such issues as RF heating of wires used for device localization and the noise generated by rapid switching of MR gradients being significant obstacles yet to overcome to allow the full strength of MR-guided interventions to be realized clinically. It is anticipated that these topics will emerge as critical concepts in the next decade of interventional MR imaging research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jamal J Derakhshan, Jeffrey L Duerk. 2005. Update to pulse sequences for interventional MR imaging.. https://doi.org/10.1016/j.mric.2005.04.005

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↗