Dataset Information

Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.

ABSTRACT: 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.

SUBMITTER: Wieland SC

PROVIDER: S-EPMC1890507 | biostudies-literature | 2007 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.

Wieland Shannon C SC Brownstein John S JS Berger Bonnie B Mandl Kenneth D KD

Proceedings of the National Academy of Sciences of the United States of America 20070522 22

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 ...[more]

PMID: 17519338

Similar Datasets

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/.

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.

Project description:Identifying early and non-invasive biomarkers to detect individuals in the earliest stages of the Alzheimer's disease continuum is crucial. As a result, electrophysiology and plasma biomarkers are emerging as great candidates in this pursuit due to their low invasiveness. This is the first magnetoencephalography study to assess the relationship between minimum spanning tree parameters, an alternative to overcome the comparability and thresholding problem issues characteristic of conventional brain network analyses, and plasma phosphorylated tau231 levels in unimpaired individuals, with different risk levels of Alzheimer's disease. Seventy-six individuals with available magnetoencephalography recordings and phosphorylated tau231 plasma determination were included. The minimum spanning tree for the theta, alpha and beta bands for each subject was obtained, and the leaf fraction, tree hierarchy and diameter were calculated. To study the relationship between these topological parameters and phosphorylated tau231, we performed correlation analyses, for the whole sample and considering the two risk sub-groups separately. Increasing concentrations of phosphorylated tau231 were associated with greater leaf fraction and tree hierarchy values, along with lower diameter values, for the alpha and theta frequency bands. These results emerged for the whole sample and the higher risk group, but not for the lower risk group. Our results indicate that the network topology of cognitively unimpaired individuals with elevated plasma phosphorylated tau231 levels, a marker of Alzheimer's disease pathology and amyloid-β accumulation, is already altered, shifting towards a more integrated network increasing its vulnerability and hub-dependency, mostly in the alpha band. This is indicated by increases in leaf fraction and tree hierarchy, along with reductions in diameter. These results match the initial trajectory proposed by theoretical models of disease progression and network disruption and suggest that changes in brain function and organization begin early on.

Dataset Information

Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.

Publications

Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets