Search PubMed⌕ Search

PubMed · 16916714

Miniature array postdetection-encoded MRI.

Abstract

A method for performing nuclear magnetic resonance (NMR) measurements simultaneously from more than a single radiofrequency (RF) coil is presented. The method employs the detection of magnetic resonance signals in an array of detectors, where each detector is responsible for detecting a unique frequency bandwidth or a magnetic resonance signal from a unique location in a region in a primary, substantially homogeneous, static magnetic field. The detectors may be separated logically into groups, whereby all the detectors in a given group are essentially RF-decoupled from each other to substantially eliminate cross-talk by switching circuits or by being placed from each other sufficiently remotely. Sampling of detected signals from detectors in this array is done simultaneously over groups of noninteracting detectors. The detected signals from all detectors in a given group are simultaneously transmitted to a single preamplifier, thus increasing significantly the signal-to-noise ratio (SNR) in that preamplifier. Prior to transmitting each detected NMR signal of each detector to the preamplifier, each detected signal is separately and uniquely encoded electronically. This provides a method whereby the signal of each detector is uniquely encoded. Accumulating all these encoded signals, which were simultaneously received in a number of RF detectors into a single amplifier, results in the total signal having a high SNR ratio. This total amplified signal is later decoded into each detector's original signal by a decoding circuitry. Conventional magnetic resonance imaging (MRI) techniques may be thereafter applied to obtain an image. Or else, conventional NMR techniques may be thereafter applied to obtain an improved SNR from a sample, using a single preamplifier with a multitude of detectors. Applying this method to a large number of miniature and closely packed RF detectors placed in an array-like configuration results in an MRI technique with a very fast acquisition time, an increased SNR and a high spatial resolution equivalent to the number of detectors per unit of length. Deblurring and decoupling algorithms allow for images from layers as deep as 6 mm to be acquired.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Doron Kwiat, Boris Sorokopud, Yoav Eiges, Elad Sity. 2006-05-26. Miniature array postdetection-encoded MRI.. https://doi.org/10.1016/j.mri.2006.04.006

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↗