A novel approach to understanding Parkinsonian cognitive decline using minimum spanning trees, edge cutting, and magnetoencephalography.
Ontology highlight
ABSTRACT:
SUBMITTER: Simon OB
PROVIDER: S-EPMC8492620 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:A vectorial representation of the vascular network that embodies quantitative features-location, direction, scale, and bifurcations-has many potential cardio- and neuro-vascular applications. We present VTrails, an end-to-end approach to extract geodesic vascular minimum spanning trees from angiographic data by solving a connectivity-optimized anisotropic level-set over a voxel-wise tensor field representing the orientation of the underlying vasculature. Evaluating real and synthetic vascular images, we compare VTrails against the state-of-the-art ridge detectors for tubular structures by assessing the connectedness of the vesselness map and inspecting the synthesized tensor field. The inferred geodesic trees are then quantitatively evaluated within a topologically aware framework, by comparing the proposed method against popular vascular segmentation tool kits on clinical angiographies. VTrails potentials are discussed towards integrating groupwise vascular image analyses. The performance of VTrails demonstrates its versatility and usefulness also for patient-specific applications in interventional neuroradiology and vascular surgery.
| S-EPMC6319031 | biostudies-other
Project description:BackgroundVisualization tools allow researchers to obtain a global view of the interrelationships between the probes or experiments of a gene expression (e.g. microarray) data set. Some existing methods include hierarchical clustering and k-means. In recent years, others have proposed applying minimum spanning trees (MST) for microarray clustering. Although MST-based clustering is formally equivalent to the dendrograms produced by hierarchical clustering under certain conditions; visually they can be quite different.MethodsHAMSTER (Helpful Abstraction using Minimum Spanning Trees for Expression Relations) is an open source system for generating a set of MSTs from the experiments of a microarray data set. While previous works have generated a single MST from a data set for data clustering, we recursively merge experiments and repeat this process to obtain a set of MSTs for data visualization. Depending on the parameters chosen, each tree is analogous to a snapshot of one step of the hierarchical clustering process. We scored and ranked these trees using one of three proposed schemes. HAMSTER is implemented in C++ and makes use of Graphviz for laying out each MST.ResultsWe report on the running time of HAMSTER and demonstrate using data sets from the NCBI Gene Expression Omnibus (GEO) that the images created by HAMSTER offer insights that differ from the dendrograms of hierarchical clustering. In addition to the C++ program which is available as open source, we also provided a web-based version (HAMSTER+) which allows users to apply our system through a web browser without any computer programming knowledge.ConclusionResearchers may find it helpful to include HAMSTER in their microarray analysis workflow as it can offer insights that differ from hierarchical clustering. We believe that HAMSTER would be useful for certain types of gradient data sets (e.g time-series data) and data that indicate relationships between cells/tissues. Both the source and the web server variant of HAMSTER are available from http://hamster.cbrc.jp/.
| S-EPMC2784758 | biostudies-literature
Project description:The chemical sciences are producing an unprecedented amount of large, high-dimensional data sets containing chemical structures and associated properties. However, there are currently no algorithms to visualize such data while preserving both global and local features with a sufficient level of detail to allow for human inspection and interpretation. Here, we propose a solution to this problem with a new data visualization method, TMAP, capable of representing data sets of up to millions of data points and arbitrary high dimensionality as a two-dimensional tree (http://tmap.gdb.tools). Visualizations based on TMAP are better suited than t-SNE or UMAP for the exploration and interpretation of large data sets due to their tree-like nature, increased local and global neighborhood and structure preservation, and the transparency of the methods the algorithm is based on. We apply TMAP to the most used chemistry data sets including databases of molecules such as ChEMBL, FDB17, the Natural Products Atlas, DSSTox, as well as to the MoleculeNet benchmark collection of data sets. We also show its broad applicability with further examples from biology, particle physics, and literature.
| S-EPMC7015965 | biostudies-literature
Project description:B cell receptor (BCR) genes exposed to an antigen undergo somatic hypermutations and Darwinian antigen selection, generating a large BCR-antibody diversity. This process, known as B cell affinity maturation, increases antibody affinity, forming a specific B cell lineage that includes the unmutated ancestor and mutated variants. In a B cell lineage, cells with a higher antigen affinity will undergo clonal expansion, while those with a lower affinity will not proliferate and probably be eliminated. Therefore, cellular (genotype) abundance provides a valuable perspective on the ongoing evolutionary process. Phylogenetic tree inference is often used to reconstruct B cell lineage trees and represents the evolutionary dynamic of BCR affinity maturation. However, such methods should process B-cell population data derived from experimental sampling that might contain different cellular abundances. There are a few phylogenetic methods for tracing the evolutionary events occurring in B cell lineages; best-performing solutions are time-demanding and restricted to analysing a reduced number of sequences, while time-efficient methods do not consider cellular abundances. We propose ClonalTree, a low-complexity and accurate approach to construct B-cell lineage trees that incorporates genotype abundances into minimum spanning tree (MST) algorithms. Using both simulated and experimental data, we demonstrate that ClonalTree outperforms MST-based algorithms and achieves a comparable performance to a method that explores tree-generating space exhaustively. Furthermore, ClonalTree has a lower running time, being more convenient for building B-cell lineage trees from high-throughput BCR sequencing data, mainly in biomedical applications, where a lower computational time is appreciable. It is hundreds to thousands of times faster than exhaustive approaches, enabling the analysis of a large set of sequences within minutes or seconds and without loss of accuracy. The source code is freely available at github.com/julibinho/ClonalTree.
| S-EPMC9972711 | biostudies-literature
Project description:Existing disease cluster detection methods cannot detect clusters of all shapes and sizes or identify highly irregular sets that overestimate the true extent of the cluster. We introduce a graph-theoretical method for detecting arbitrarily shaped clusters based on the Euclidean minimum spanning tree of cartogram-transformed case locations, which overcomes these shortcomings. The method is illustrated by using several clusters, including historical data sets from West Nile virus and inhalational anthrax outbreaks. Sensitivity and accuracy comparisons with the prevailing cluster detection method show that the method performs similarly on approximately circular historical clusters and greatly improves detection for noncircular clusters.
| S-EPMC1890507 | biostudies-literature
Project description:In the present study, a novel data-driven topological filtering technique is introduced to derive the backbone of functional brain networks relying on orthogonal minimal spanning trees (OMSTs). The method aims to identify the essential functional connections to ensure optimal information flow via the objective criterion of global efficiency minus the cost of surviving connections. The OMST technique was applied to multichannel, resting-state neuromagnetic recordings from four groups of participants: healthy adults (n = 50), adults who have suffered mild traumatic brain injury (n = 30), typically developing children (n = 27), and reading-disabled children (n = 25). Weighted interactions between network nodes (sensors) were computed using an integrated approach of dominant intrinsic coupling modes based on two alternative metrics (symbolic mutual information and phase lag index), resulting in excellent discrimination of individual cases according to their group membership. Classification results using OMST-derived functional networks were clearly superior to results using either relative power spectrum features or functional networks derived through the conventional minimal spanning tree algorithm.
| S-EPMC6435350 | biostudies-literature
Project description:Trees, including minimum spanning trees (MSTs), are commonly used in phylogenetic studies. But, for the research community, it may be unclear that the presented tree is just a hypothesis, chosen from among many possible alternatives. In this scenario, it is important to quantify our confidence in both the trees and the branches/edges included in such trees. In this paper, we address this problem for MSTs by introducing a new edge betweenness metric for undirected and weighted graphs. This spanning edge betweenness metric is defined as the fraction of equivalent MSTs where a given edge is present. The metric provides a per edge statistic that is similar to that of the bootstrap approach frequently used in phylogenetics to support the grouping of taxa. We provide methods for the exact computation of this metric based on the well known Kirchhoff's matrix tree theorem. Moreover, we implement and make available a module for the PHYLOViZ software and evaluate the proposed metric concerning both effectiveness and computational performance. Analysis of trees generated using multilocus sequence typing data (MLST) and the goeBURST algorithm revealed that the space of possible MSTs in real data sets is extremely large. Selection of the edge to be represented using bootstrap could lead to unreliable results since alternative edges are present in the same fraction of equivalent MSTs. The choice of the MST to be presented, results from criteria implemented in the algorithm that must be based in biologically plausible models.
| S-EPMC4370493 | biostudies-literature
Project description:BackgroundCognitive decline remains difficult to predict as structural brain damage cannot fully explain the extensive heterogeneity found between MS patients.ObjectiveTo investigate whether functional brain network organization measured with magnetoencephalography (MEG) predicts cognitive decline in MS patients after 5 years and to explore its value beyond structural pathology.MethodsResting-state MEG recordings, structural MRI, and neuropsychological assessments were analyzed of 146 MS patients, and 100 patients had a 5-year follow-up neuropsychological assessment. Network properties of the minimum spanning tree (i.e. backbone of the functional brain network) indicating network integration and overload were related to baseline and longitudinal cognition, correcting for structural damage.ResultsA more integrated beta band network (i.e. smaller diameter) and a less integrated delta band network (i.e. lower leaf fraction) predicted cognitive decline after 5 years (Radj2=15%), independent of structural damage. Cross-sectional analyses showed that a less integrated network (e.g. lower tree hierarchy) related to worse cognition, independent of frequency band.ConclusionsThe level of functional brain network integration was an independent predictive marker of cognitive decline, in addition to the severity of structural damage. This work thereby indicates the promise of MEG-derived network measures in predicting disease progression in MS.
| S-EPMC8474326 | biostudies-literature
Project description:Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to formulate some general conditions on the sum of vertex degrees. We analyze the performance of various combinations of these degree sum conditions in finding dense spanning subtrees and apply our approach to practical examples. After briefly describing our algorithm we also show how it can be used on variations of DST, motivated by variations of MST. Our work provide some insights on the role of various degree sums in forming dense spanning trees and hopefully lay the foundation for finding fast algorithms or heuristics for related problems.
| S-EPMC5605090 | biostudies-literature
Project description:Protease research has undergone a major expansion in the last decade, largely due to the extremely rapid development of new technologies, such as quantitative proteomics and in-vivo imaging, as well as an extensive use of in-vivo models. These have led to identification of physiological substrates and resulted in a paradigm shift from the concept of proteases as protein-degrading enzymes to proteases as key signalling molecules. However, we are still at the beginning of an understanding of protease signalling pathways. We have only identified a minor subset of true physiological substrates for a limited number of proteases, and their physiological regulation is still not well understood. Similarly, links with other signalling systems are not well established. Herein, we will highlight current challenges in protease research.
| S-EPMC3321211 | biostudies-literature