PubMed Health⌕ Search

PubMed · 9606050

Decomposing stimulus and response component waveforms in ERP.

Abstract

Event-related potentials (ERPs) are evoked brain potentials that are averaged across many trial repetitions with individual trials aligned (i.e. time-locked) to a specific behavioral event, typically the onset of the stimulus (s-lock) or the onset of the behavioral response (r-lock). These evoked potential averages may reflect brain activities during the stimulus encoding/analyzing stage (stimulus component waveform, or 'S-component'), during the response preparation/production stage (response component waveform, or 'R-component'), or a combination thereof. In the stimulus-locked average of the ensemble of the recorded waveforms (i.e. in the s-locked ERP), the contribution of an R-component will be convoluted, due to the trial-by-trial variance in reaction time (RT): so will an S-component in the r-locked ERP. It is shown here that the knowledge of (1) the s-locked and r-locked ERP waveforms constructed from the same ensemble of trials and (2) the RT distribution of this ensemble allows us to determine whether the recorded potential results from a single S-component, a single R-component, or a single intermediate ('decisional' or D-) component related to the transition of the two stochastically independent stages. If it can be assumed that the evoked potential is the result of a linear summation of an S-component and an R-component, then there is a unique recovery into these two components, such that the reconstructed waveform on an individual trial is a superposition of the two components with their relative offset determined by the RT of that trial and the ensemble average is the experimentally obtained s-locked and r-locked ERP waveforms. Two independent methods can be used to recover those components, one based on Fourier transform techniques which was first proposed by Hansen (1983) in the context of ERP component isolation and the other based on a recursive iteration approach through which the contamination of the R or S-component is successively removed from the s-locked or r-locked ERP waveforms, respectively. The iterative procedure is analytically proven to converge to the Fourier-based solution, demonstrating the equivalence of the two approaches. Finally, if the condition of a single intermediate D-component is satisfied, then one can recover this component waveform along with the probability distributions of the relative durations of the two underlying linear stages; however, there is always an equivalent pair of S- and R-component which also satisfy the same data set (s-locked and r-locked ERP waveforms and the overall RT distribution). In this case, the S/R-component assumption and the D-component assumption cannot be distinguished solely on the ground of the available data set. The technique developed here outlines the assumptions and the boundary conditions upon which ensemble ERP waveforms are to be analyzed and interpreted in terms of processing mechanisms related to stimulus, to response, or to the transition between the two.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J Zhang. 1998-03-13. Decomposing stimulus and response component waveforms in ERP.. https://doi.org/10.1016/s0165-0270(97)00194-5

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↗