The coupled dipole model: an integrated model for multiple MEG/EEG data sets.

Fetsje Bijma; Jan C de Munck; Koen B E Böcker; Hilde M Huizenga; Rob M Heethaar

doi:10.1016/j.neuroimage.2004.06.038

Home/Archive/PubMed

PubMed · 15528089

The coupled dipole model: an integrated model for multiple MEG/EEG data sets.

Fetsje Bijma·Jan C de Munck·Koen B E Böcker·Hilde M Huizenga·Rob M Heethaar

View original source ↗Export metadata ↓

Abstract

Often MEG/EEG is measured in a few slightly different conditions to investigate the functionality of the human brain. This kind of data sets show similarities, though are different for each condition. When solving the inverse problem (IP), performing the source localization, one encounters the problem that this IP is ill-posed: constraints are necessary to solve and stabilize the solution to the IP. Moreover, a substantial amount of data is needed to avoid a signal to noise ratio (SNR) that is too poor for source localizations. In the case of similar conditions, this common information can be exploited by analyzing the data sets simultaneously. The here proposed coupled dipole model (CDM) provides an integrated method in which these similarities between conditions are used to solve and stabilize the inverse problem. The coupled dipole model is applicable when data sets contain common sources or common source time functions. The coupled dipole model uses a set of common sources and a set of common source time functions (STFs) to model all conditions in one single model. The data of each condition are mathematically described as a linear combination of these common spatial and common temporal components. This linear combination is specified in a coupling matrix for each data set. The coupled dipole model was applied in two simulation studies and in one experimental study. The simulations show that the errors in the estimated spatial and temporal parameters decrease compared to the standard separate analyses. A decrease in position error of a factor of 10 was shown for the localization of two nearby sources. In the experimental application, the coupled dipole model was shown to be necessary to obtain a plausible solution in at least 3 of 15 conditions investigated. Moreover, using the CDM, a direct comparison between parameters in different conditions is possible, whereas in separate models, the scaling of the amplitude parameters varies in general from data set to data set.

Explore related subjects

Algorithms Cerebral Cortex Computer Simulation Electroencephalography Humans Linear Models Magnetoencephalography Models, Neurological Nonlinear Dynamics Visual Cortex Clinical Trial Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fetsje Bijma, Jan C de Munck, Koen B E Böcker, Hilde M Huizenga, Rob M Heethaar. 2004. The coupled dipole model: an integrated model for multiple MEG/EEG data sets.. https://doi.org/10.1016/j.neuroimage.2004.06.038

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2026

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↗

PubMed2026

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↗

PubMed2026

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↗