RESUMEN
Magnetoencephalography (MEG) is a noninvasive neuroimaging technique widely recognized for epilepsy and tumor mapping. MEG clinical reporting requires a multidisciplinary team, including expert input regarding each dipole's anatomic localization. Here, we introduce a novel tool, the "Magnetoencephalography Atlas Viewer" (MAV), which streamlines this anatomical analysis. The MAV normalizes the patient's Magnetic Resonance Imaging (MRI) to the Montreal Neurological Institute (MNI) space, reverse-normalizes MNI atlases to the native MRI, identifies MEG dipole files, and matches dipoles' coordinates to their spatial location in atlas files. It offers a user-friendly and interactive graphical user interface (GUI) for displaying individual dipoles, groups, coordinates, anatomical labels, and a tri-planar MRI view of the patient with dipole overlays. It evaluated over 273 dipoles obtained in clinical epilepsy subjects. Consensus-based ground truth was established by three neuroradiologists, with a minimum agreement threshold of two. The concordance between the ground truth and MAV labeling ranged from 79% to 84%, depending on the normalization method. Higher concordance rates were observed in subjects with minimal or no structural abnormalities on the MRI, ranging from 80% to 90%. The MAV provides a straightforward MEG dipole anatomic localization method, allowing a nonspecialist to prepopulate a report, thereby facilitating and reducing the time of clinical reporting.
RESUMEN
Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an RNA structure database can be stored into a suffix array. A fast substructure search algorithm has been proposed based on binary search on this suffix array. Using this substructure search algorithm, we present a fast algorithm that finds the largest common substructure of given multiple RNA structures in [Formula: see text] format. The multiple RNA structure comparison problem is NP-hard in its general formulation. We introduced a new problem for comparing multiple RNA structures. This problem has more strict similarity definition and objective, and we propose an algorithm that solves this problem efficiently. We also develop another comparison algorithm that iteratively calls this algorithm to locate nonoverlapping large common substructures in compared RNAs. With the new resulting tools, we improved the RNASSAC website (linked from http://faculty.tamuc.edu/aarslan ). This website now also includes two drawing tools: one specialized for preparing RNA substructures that can be used as input by the search tool, and another one for automatically drawing the entire RNA structure from a given structure sequence.
