Paired test of matrix graphs and brain connectivity analysis.
Ontology highlight
ABSTRACT:
SUBMITTER: Ye Y
PROVIDER: S-EPMC8035996 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Human brain connectivity is complex. Graph theory based analysis has become a powerful and popular approach for analyzing brain imaging data, largely because of its potential to quantitatively illuminate the networks, the static architecture in structure and function, the organization of dynamic behavior over time, and disease related brain changes. The first step in creating brain graphs is to define the nodes and edges connecting them. We review a number of approaches for defining brain nodes including fixed versus data-driven nodes. Expanding the narrow view of most studies which focus on static and/or single modality brain connectivity, we also survey advanced approaches and their performances in building dynamic and multi-modal brain graphs. We show results from both simulated and real data from healthy controls and patients with mental illnesse. We outline the advantages and challenges of these various techniques. By summarizing and inspecting recent studies which analyzed brain imaging data based on graph theory, this article provides a guide for developing new powerful tools to explore complex brain networks.
| S-EPMC6197492 | biostudies-literature
Project description:Neuroimaging research involves analyses of huge amounts of biological data that might or might not be related with cognition. This relationship is usually approached using univariate methods, and, therefore, correction methods are mandatory for reducing false positives. Nevertheless, the probability of false negatives is also increased. Multivariate frameworks have been proposed for helping to alleviate this balance. Here we apply multivariate distance matrix regression for the simultaneous analysis of biological and cognitive data, namely, structural connections among 82 brain regions and several latent factors estimating cognitive performance. We tested whether cognitive differences predict distances among individuals regarding their connectivity pattern. Beginning with 3,321 connections among regions, the 36 edges better predicted by the individuals' cognitive scores were selected. Cognitive scores were related to connectivity distances in both the full (3,321) and reduced (36) connectivity patterns. The selected edges connect regions distributed across the entire brain and the network defined by these edges supports high-order cognitive processes such as (a) (fluid) executive control, (b) (crystallized) recognition, learning, and language processing, and (c) visuospatial processing. This multivariate study suggests that one widespread, but limited number, of regions in the human brain, supports high-level cognitive ability differences. Hum Brain Mapp 38:803-816, 2017. © 2016 Wiley Periodicals, Inc.
| S-EPMC6866971 | biostudies-literature
Project description:We present a novel voxel-based connectivity approach for paired functional magnetic resonance imaging (fMRI) data collected under two different conditions labeled the Coupled Intrinsic Connectivity Distribution (coupled-ICD). Our proposed method jointly models both conditions to incorporate additional paired information into the connectivity metric. Voxel-based connectivity holds promise as a clinical tool to characterize a wide range of neurological and psychiatric diseases, and monitor their treatment. As such, examining paired connectivity data such as scans acquired pre- and post-intervention is an important application for connectivity methodologically. When presented with data from paired conditions, conventional voxel-based methods analyze each condition separately. However, summarizing each connection separately can misrepresent patterns of changes in connectivity. We show that commonly used methods can underestimate functional changes and subsequently introduce and evaluate our solution to this problem, the coupled-ICD metric, using two studies: 1) healthy controls scanned awake and under anesthesia, and 2) cocaine-dependent subjects and healthy controls scanned while being presented with relaxing or drug-related imagery cues. The coupled-ICD approach detected differences between paired conditions in similar brain regions as the conventional approaches while also revealing additional changes in regions not identified using conventional voxel-based connectivity analyses. Follow-up seed-based analyses on data independent from the voxel-based results also showed connectivity differences between conditions in regions detected by coupled-ICD. This approach of jointly analyzing paired resting-state scans provides a new and important tool with many applications for clinical and basic neuroscience research.
| S-EPMC3968179 | biostudies-literature
Project description:The formation and maintenance of connectivity are critically important for the processing and storage of information in neuronal networks. The brain extracellular matrix (ECM) appears during postnatal development and surrounds most neurons in the adult mammalian brain. Importantly, the removal of the ECM was shown to improve plasticity and post-traumatic recovery in the CNS, but little is known about the mechanisms. Here, we investigated the role of the ECM in the regulation of the network activity in dissociated hippocampal cultures grown on microelectrode arrays (MEAs). We found that enzymatic removal of the ECM in mature cultures led to transient enhancement of neuronal activity, but prevented disinhibition-induced hyperexcitability that was evident in age-matched control cultures with intact ECM. Furthermore, the ECM degradation followed by disinhibition strongly affected the network interaction so that it strongly resembled the juvenile pattern seen in naïve developing cultures. Taken together, our results demonstrate that the ECM plays an important role in retention of existing connectivity in mature neuronal networks that can be exerted through synaptic confinement of glutamate. On the other hand, removal of the ECM can play a permissive role in modification of connectivity and adaptive exploration of novel network architecture.
| S-EPMC4586818 | biostudies-literature
Project description:Matrix-valued data, where the sampling unit is a matrix consisting of rows and columns of measurements, are emerging in numerous scientific and business applications. Matrix Gaussian graphical model is a useful tool to characterize the conditional dependence structure of rows and columns. In this article, we employ nonconvex penalization to tackle the estimation of multiple graphs from matrix-valued data under a matrix normal distribution. We propose a highly efficient nonconvex optimization algorithm that can scale up for graphs with hundreds of nodes. We establish the asymptotic properties of the estimator, which requires less stringent conditions and has a sharper probability error bound than existing results. We demonstrate the efficacy of our proposed method through both simulations and real functional magnetic resonance imaging analyses.
| S-EPMC6261498 | biostudies-literature
Project description:Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displaying the whole network, only a relevant subset is shown. Query-based techniques for analyzing connectivity in graphs, however, can also easily suffer from cluttering if the query result is big enough. To remedy this, we introduce techniques that provide an overview of the connectivity and reveal details on demand. We have two main contributions: (1) two novel visualization techniques that work in concert for summarizing graph connectivity; and (2) Graffinity, an open-source implementation of these visualizations supplemented by detail views to enable a complete analysis workflow. Graffinity was designed in a close collaboration with neuroscientists and is optimized for connectomics data analysis, yet the technique is applicable across domains. We validate the connectivity overview and our open-source tool with illustrative examples using flight and connectomics data.
| S-EPMC5821473 | biostudies-literature
Project description:Growing evidence has shown that the brain connectivity network experiences alterations for complex diseases such as Alzheimer's disease (AD). Network comparison, also known as differential network analysis, is thus particularly powerful to reveal the disease pathologies and identify clinical biomarkers for medical diagnoses (classification). Data from neurophysiological measurements are multidimensional and in matrix-form. Naive vectorization method is not sufficient as it ignores the structural information within the matrix. In the article, we adopt the Kronecker product covariance matrices framework to capture both spatial and temporal correlations of the matrix-variate data while the temporal covariance matrix is treated as a nuisance parameter. By recognizing that the strengths of network connections may vary across subjects, we develop an ensemble-learning procedure, which identifies the differential interaction patterns of brain regions between the case group and the control group and conducts medical diagnosis (classification) of the disease simultaneously. Simulation studies are conducted to assess the performance of the proposed method. We apply the proposed procedure to the functional connectivity analysis of an functional magnetic resonance imaging study on AD. The hub nodes and differential interaction patterns identified are consistent with existing experimental studies, and satisfactory out-of-sample classification performance is achieved for medical diagnosis of AD.
| S-EPMC9295187 | biostudies-literature
Project description:BackgroundGraph-based analysis of fMRI data has recently emerged as a promising approach to study brain networks. Based on the assessment of synchronous fMRI activity at separate brain sites, functional connectivity graphs are constructed and analyzed using graph-theoretical concepts. Most previous studies investigated region-level graphs, which are computationally inexpensive, but bring along the problem of choosing sensible regions and involve blurring of more detailed information. In contrast, voxel-level graphs provide the finest granularity attainable from the data, enabling analyses at superior spatial resolution. They are, however, associated with considerable computational demands, which can render high-resolution analyses infeasible. In response, many existing studies investigating functional connectivity at the voxel-level reduced the computational burden by sacrificing spatial resolution.MethodsHere, a novel, time-efficient method for graph construction is presented that retains the original spatial resolution. Performance gains are instead achieved through data reduction in the temporal domain based on dichotomization of voxel time series combined with tetrachoric correlation estimation and efficient implementation.ResultsBy comparison with graph construction based on Pearson's r, the technique used by the majority of previous studies, we find that the novel approach produces highly similar results an order of magnitude faster.ConclusionsIts demonstrated performance makes the proposed approach a sensible and efficient alternative to customary practice. An open source software package containing the created programs is freely available for download.
| S-EPMC4081498 | biostudies-literature
Project description:Motivation:The de Bruijn graph is a simple and efficient data structure that is used in many areas of sequence analysis including genome assembly, read error correction and variant calling. The data structure has a single parameter k, is straightforward to implement and is tractable for large genomes with high sequencing depth. It also enables representation of multiple samples simultaneously to facilitate comparison. However, unlike the string graph, a de Bruijn graph does not retain long range information that is inherent in the read data. For this reason, applications that rely on de Bruijn graphs can produce sub-optimal results given their input data. Results:We present a novel assembly graph data structure: the Linked de Bruijn Graph (LdBG). Constructed by adding annotations on top of a de Bruijn graph, it stores long range connectivity information through the graph. We show that with error-free data it is possible to losslessly store and recover sequence from a Linked de Bruijn graph. With assembly simulations we demonstrate that the LdBG data structure outperforms both our de Bruijn graph and the String Graph Assembler (SGA). Finally we apply the LdBG to Klebsiella pneumoniae short read data to make large (12 kbp) variant calls, which we validate using PacBio sequencing data, and to characterize the genomic context of drug-resistance genes. Availability and implementation:Linked de Bruijn Graphs and associated algorithms are implemented as part of McCortex, which is available under the MIT license at https://github.com/mcveanlab/mccortex. Supplementary information:Supplementary data are available at Bioinformatics online.
| S-EPMC6061703 | biostudies-literature