SEARCH · PubMed Health

Results for “Clustering Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61Linked to original sources

PubMed2006

Microarray data analysis: from disarray to consolidation and consensus.

In just a few years, microarrays have gone from obscurity to being almost ubiquitous in biological research. At the same time, the statistical methodology for microarray analysis has progressed from simple visual assessments of results to a weekly deluge of papers that describe purportedly novel algorithms for analysing changes in gene expression. Although the many procedures that are available might be bewildering to biologists who wish to apply them, statistical geneticists are recognizing commonalities among the different methods. Many are special cases of more general models, and points of consensus are emerging about the general approaches that warrant use and elaboration.

Algorithms↗

PubMed1992

Episodic thyrotropin (TSH) and prolactin (PRL) secretion during aging in postmenopausal women.

While aging is known to decrease episodic thyrotropin (TSH) secretion in men, no detailed information is available as to age-related alterations in the TSH and prolactin (PRL) release patterns in postmenopausal women (PMW). Accordingly, we compared the TSH and prolactin (PRL) secretory profiles of 6 euthyroid younger PMW (mean age: 53.0 years) with those of 7 euthyroid older PMW (mean age: 80.4 years). In all PMW, blood samples were obtained at 10 minute intervals for 10 hours for serial determinations of TSH and PRL by RIA. While thyroxine (T4) serum concentrations were not different in younger from older PMW, triiodothyronine (T3) levels markedly (p less than 0.05) decreased in older PMW. In both younger and older PMW, TSH and PRL were secreted episodically (by Cluster pulse algorithm), with considerable inter-individual variabilities in either study group. TSH and PRL pulse attributes (interpulse intervals, frequencies, amplitudes) were comparable in younger and older PMW, although a tendency of mean TSH to increase (p = 0.18) was noted for older PMW. Mean TSH and PRL serum concentrations were positively (r = 0.94, p less than 0.01) correlated in older, whereas not in younger PMW. These observations demonstrate that the pulse characteristics of episodic TSH and PRL secretion are preserved in PMW even of old age. However, in view of markedly decreased circulating T3 concentrations and of no substantial change in the TSH pulsatile secretion in older PMW, the negative feedback on the hypothalamic-pituitary unit may be impaired in elderly women.

Aged↗

PubMed2003

Prediction of clinical drug efficacy by classification of drug-induced genomic expression profiles in vitro.

Assays of drug action typically evaluate biochemical activity. However, accurately matching therapeutic efficacy with biochemical activity is a challenge. High-content cellular assays seek to bridge this gap by capturing broad information about the cellular physiology of drug action. Here, we present a method of predicting the general therapeutic classes into which various psychoactive drugs fall, based on high-content statistical categorization of gene expression profiles induced by these drugs. When we used the classification tree and random forest supervised classification algorithms to analyze microarray data, we derived general "efficacy profiles" of biomarker gene expression that correlate with anti-depressant, antipsychotic and opioid drug action on primary human neurons in vitro. These profiles were used as predictive models to classify naïve in vitro drug treatments with 83.3% (random forest) and 88.9% (classification tree) accuracy. Thus, the detailed information contained in genomic expression data is sufficient to match the physiological effect of a novel drug at the cellular level with its clinical relevance. This capacity to identify therapeutic efficacy on the basis of gene expression signatures in vitro has potential utility in drug discovery and drug target validation.

Algorithms↗

PubMed2003

A data mining technique for discovering distinct patterns of hand signs: implications in user training and computer interface design.

Hand signs are considered as one of the important ways to enter information into computers for certain tasks. Computers receive sensor data of hand signs for recognition. When using hand signs as computer inputs, we need to (1) train computer users in the sign language so that their hand signs can be easily recognized by computers, and (2) design the computer interface to avoid the use of confusing signs for improving user input performance and user satisfaction. For user training and computer interface design, it is important to have a knowledge of which signs can be easily recognized by computers and which signs are not distinguishable by computers. This paper presents a data mining technique to discover distinct patterns of hand signs from sensor data. Based on these patterns, we derive a group of indistinguishable signs by computers. Such information can in turn assist in user training and computer interface design.

Algorithms↗

PubMed2006

A serum proteomic pattern for the detection of colorectal adenocarcinoma using surface enhanced laser desorption and ionization mass spectrometry.

PURPOSE: New serum biomarkers are needed to improve the early detection of colorectal adenocarcinoma. We performed surface enhanced laser desorption and ionization time-of-flight mass spectrometry (SELDI-TOF-MS) to screen for differentially expressed proteins in serum and build a proteomic diagnostic pattern for the detection of colorectal adenocarcinoma to improve the prognosis of patients with this disease. EXPERIMENTAL DESIGN: In an attempt to improve current approaches to the serologic diagnosis of colorectal cancer, we analyzed serum samples from subjects with or without colorectal cancer using SELDI-MS. Using a case-control study design, SELDI-MS profile of serum samples from 74 colorectal adenocarcinoma patients were compared with 48 age-and sex-matched healthy subjects using a ProteinChip reader, PBSII-C. Proteomic MS spectra were generated using IMAC3 chips, and protein peaks clustering and classification analyses were performed to build a proteomic pattern that could differentiate patients with colorectal adenocarcinoma from healthy subjects utilizing Biomarker Wizard and Biomarker Patterns software packages, respectively. The constructed pattern was then used to test an independent set of masked serum samples from 60 colorectal cancer patients and 39 healthy subjects. RESULTS: Among the differentially expressed protein peaks identified by SELDI-MS profiling that had the ability to distinguish between patients and healthy subjects, we determined a minimum set of two protein peaks for system training and for developing a decision classification pattern. Masked analysis of an independent set of serum samples showed the diagnostic pattern could differentiate patients with different stages of colorectal cancer from healthy subjects with a sensitivity of 95.00 percent and specificity of 94.87 percent. CONCLUSION: SELDI-TOF-MS profiling of serum proteins combined with bioinformatics tools can be applied to accurately differentiate patients with colorectal cancer from healthy subjects. The high sensitivity and specificity achieved by the constructed clustering analysis algorithm show great potential for the early detection of colorectal cancer.

Adenocarcinoma↗

PubMed2002

In silico approaches to microarray-based disease classification and gene function discovery.

The automated analysis of transcriptional profiling data promises a wealth of information that may be used to develop a more complete understanding of gene function and interactions. Moreover, it may improve the effectiveness of complex diagnostic tasks. This article discusses important data mining and management techniques to analyse genome-wide expression data. It reviews some of the major discovery goals, methods and applications in a number of biomedical domains. Finally, this paper highlights key problems that need to be approached by a new generation of computational solutions.

Algorithms↗

PubMed2005

Head-and-neck IMRT treatments assessed with a Monte Carlo dose calculation engine.

IMRT is frequently used in the head-and-neck region, which contains materials of widely differing densities (soft tissue, bone, air-cavities). Conventional methods of dose computation for these complex, inhomogeneous IMRT cases involve significant approximations. In the present work, a methodology for the development, commissioning and implementation of a Monte Carlo (MC) dose calculation engine for intensity modulated radiotherapy (MC-IMRT) is proposed which can be used by radiotherapy centres interested in developing MC-IMRT capabilities for research or clinical evaluations. The method proposes three levels for developing, commissioning and maintaining a MC-IMRT dose calculation engine: (a) development of a MC model of the linear accelerator, (b) validation of MC model for IMRT and (c) periodic quality assurance (QA) of the MC-IMRT system. The first step, level (a), in developing an MC-IMRT system is to build a model of the linac that correctly predicts standard open field measurements for percentage depth-dose and off-axis ratios. Validation of MC-IMRT, level (b), can be performed in a rando phantom and in a homogeneous water equivalent phantom. Ultimately, periodic quality assurance of the MC-IMRT system is needed to verify the MC-IMRT dose calculation system, level (c). Once the MC-IMRT dose calculation system is commissioned it can be applied to more complex clinical IMRT treatments. The MC-IMRT system implemented at the Royal Marsden Hospital was used for IMRT calculations for a patient undergoing treatment for primary disease with nodal involvement in the head-and-neck region (primary treated to 65 Gy and nodes to 54 Gy), while sparing the spinal cord, brain stem and parotid glands. Preliminary MC results predict a decrease of approximately 1-2 Gy in the median dose of both the primary tumour and nodal volumes (compared with both pencil beam and collapsed cone). This is possibly due to the large air-cavity (the larynx of the patient) situated in the centre of the primary PTV and the approximations present in the dose calculation.

Algorithms↗

PubMed2000

Structure comparison and structure patterns.

This article investigates aspects of pairwise and multiple structure comparison, and the problem of automatically discover common patterns in a set of structures. Descriptions and representation of structures and patterns are described, as well as scoring and algorithms for comparison and discovery. A framework and nomenclature is developed for classifying different methods, and many of these are reviewed and placed into this framework.

Algorithms↗

PubMedDate not supplied

Dissimilarity-based algorithms for selecting structurally diverse sets of compounds.

This paper commences with a brief introduction to modern techniques for the computational analysis of molecular diversity and the design of combinatorial libraries. It then reviews dissimilarity-based algorithms for the selection of structurally diverse sets of compounds in chemical databases. Procedures are described for selecting a diverse subset of an entire database, and for selecting diverse combinatorial libraries using both reagent-based and product-based selection.

Algorithms↗

PubMed2006

Modeling the combinatorial functions of multiple transcription factors.

A considerable fraction of gene promoters are bound by multiple transcription factors. It is therefore important to understand how such factors interact in regulating the genes. In this paper, we propose a computational method to identify groups of co-regulated genes and the corresponding regulatory programs of multiple transcription factors from protein- DNA binding and gene expression data. The key concept is to characterize a regulatory program in terms of two properties of individual transcription factors: the function of a regulator as an activator or a repressor, and its direction of effectiveness as necessary or sufficient. We apply a greedy algorithm to find the regulatory models which best explain the available data. Empirical analysis indicates that the inferred regulatory models agree with known combinatorial interactions between regulators and are robust against various parameter choices.

Algorithms↗

PubMed2001

SVDMAN--singular value decomposition analysis of microarray data.

SUMMARY: We have developed two novel methods for Singular Value Decomposition analysis (SVD) of microarray data. The first is a threshold-based method for obtaining gene groups, and the second is a method for obtaining a measure of confidence in SVD analysis. Gene groups are obtained by identifying elements of the left singular vectors, or gene coefficient vectors, that are greater in magnitude than the threshold W N(-1/2), where N is the number of genes, and W is a weight factor whose default value is 3. The groups are non-exclusive and may contain genes of opposite (i.e. inversely correlated) regulatory response. The confidence measure is obtained by systematically deleting assays from the data set, interpolating the SVD of the reduced data set to reconstruct the missing assay, and calculating the Pearson correlation between the reconstructed assay and the original data. This confidence measure is applicable when each experimental assay corresponds to a value of parameter that can be interpolated, such as time, dose or concentration. Algorithms for the grouping method and the confidence measure are available in a software application called SVD Microarray ANalysis (SVDMAN). In addition to calculating the SVD for generic analysis, SVDMAN provides a new means for using microarray data to develop hypotheses for gene associations and provides a measure of confidence in the hypotheses, thus extending current SVD research in the area of global gene expression analysis.

Algorithms↗

PubMed2001

Generating protein interaction maps from incomplete data: application to fold assignment.

MOTIVATION: We present a framework to generate comprehensive overviews of protein-protein interactions. In the post-genomic view of cellular function, each biological entity is seen in the context of a complex network of interactions. Accordingly, we model functional space by representing protein-protein-interaction data as undirected graphs. We suggest a general approach to generate interaction maps of cellular networks in the presence of huge amounts of fragmented and incomplete data, and to derive representations of large networks which hide clutter while keeping the essential architecture of the interaction space. This is achieved by contracting the graphs according to domain-specific hierarchical classifications. The key concept here is the notion of induced interaction, which allows the integration, comparison and analysis of interaction data from different sources and different organisms at a given level of abstraction. RESULTS: We apply this approach to compute the overlap between the DIP compendium of interaction data and a dataset of yeast two-hybrid experiments. The architecture of this network is scale-free, as frequently seen in biological networks, and this property persists through many levels of abstraction. Connections in the network can be projected downwards from higher levels of abstraction down to the level of individual proteins. As an example, we describe an algorithm for fold assignment by network context. This method currently predicts protein folds at 30% accuracy without any requirement of detectable sequence similarity of the query protein to a protein of known structure. We used this algorithm to compile a list of structural assignments for previously unassigned genes from yeast. Finally we discuss ways forward to use interaction networks for the prediction of novel protein-protein interactions. AVAILABILITY: http://www.ebi.ac.uk/~lappe/FoldPred/.

Algorithms↗

PubMed2002

Statistical analysis of a small set of time-ordered gene expression data using linear splines.

MOTIVATION: Recently, the temporal response of genes to changes in their environment has been investigated using cDNA microarray technology by measuring the gene expression levels at a small number of time points. Conventional techniques for time series analysis are not suitable for such a short series of time-ordered data. The analysis of gene expression data has therefore usually been limited to a fold-change analysis, instead of a systematic statistical approach. METHODS: We use the maximum likelihood method together with Akaike's Information Criterion to fit linear splines to a small set of time-ordered gene expression data in order to infer statistically meaningful information from the measurements. The significance of measured gene expression data is assessed using Student's t-test. RESULTS: Previous gene expression measurements of the cyanobacterium Synechocystis sp. PCC6803 were reanalyzed using linear splines. The temporal response was identified of many genes that had been missed by a fold-change analysis. Based on our statistical analysis, we found that about four gene expression measurements or more are needed at each time point.

Algorithms↗

PubMed2002

Binary analysis and optimization-based normalization of gene expression data.

MOTIVATION: Most approaches to gene expression analysis use real-valued expression data, produced by high-throughput screening technologies, such as microarrays. Often, some measure of similarity must be computed in order to extract meaningful information from the observed data. The choice of this similarity measure frequently has a profound effect on the results of the analysis, yet no standards exist to guide the researcher. RESULTS: To address this issue, we propose to analyse gene expression data entirely in the binary domain. The natural measure of similarity becomes the Hamming distance and reflects the notion of similarity used by biologists. We also develop a novel data-dependent optimization-based method, based on Genetic Algorithms (GAs), for normalizing gene expression data. This is a necessary step before quantizing gene expression data into the binary domain and generally, for comparing data between different arrays. We then present an algorithm for binarizing gene expression data and illustrate the use of the above methods on two different sets of data. Using Multidimensional Scaling, we show that a reasonable degree of separation between different tumor types in each data set can be achieved by working solely in the binary domain. The binary approach offers several advantages, such as noise resilience and computational efficiency, making it a viable approach to extracting meaningful biological information from gene expression data.

Algorithms↗

PubMed2002

SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size.

MOTIVATION: Searches for near exact sequence matches are performed frequently in large-scale sequencing projects and in comparative genomics. The time and cost of performing these large-scale sequence-similarity searches is prohibitive using even the fastest of the extant algorithms. Faster algorithms are desired. RESULTS: We have developed an algorithm, called SST (Sequence Search Tree), that searches a database of DNA sequences for near-exact matches, in time proportional to the logarithm of the database size n. In SST, we partition each sequence into fragments of fixed length called 'windows' using multiple offsets. Each window is mapped into a vector of dimension 4(k) which contains the frequency of occurrence of its component k-tuples, with k a parameter typically in the range 4-6. Then we create a tree-structured index of the windows in vector space, with tree-structured vector quantization (TSVQ). We identify the nearest neighbors of a query sequence by partitioning the query into windows and searching the tree-structured index for nearest-neighbor windows in the database. When the tree is balanced this yields an O(logn) complexity for the search. This complexity was observed in our computations. SST is most effective for applications in which the target sequences show a high degree of similarity to the query sequence, such as assembling shotgun sequences or matching ESTs to genomic sequence. The algorithm is also an effective filtration method. Specifically, it can be used as a preprocessing step for other search methods to reduce the complexity of searching one large database against another. For the problem of identifying overlapping fragments in the assembly of 120 000 fragments from a 1.5 megabase genomic sequence, SST is 15 times faster than BLAST when we consider both building and searching the tree. For searching alone (i.e. after building the tree index), SST 27 times faster than BLAST. AVAILABILITY: Request from the authors.

Algorithms↗

PubMed2002

Mapping physiological states from microarray expression measurements.

MOTIVATION: The increasing use of DNA microarrays to probe cell physiology requires methods for visualizing different expression phenotypes and explicitly connecting individual genes to discriminating expression features. Such methods should be robust and maintain biological interpretability. RESULTS: We propose a method for the mapping of the physiological state of cells and tissues from multidimensional expression data such as those obtained with DNA microarrays. The method uses Fisher discriminant analysis to create a linear projection of gene expression measurements that maximizes the separation of different sample classes. Relative to other typical classification methods, this method provides insights into the discriminating characteristics of expression measurements in terms of the contribution of individual genes to the definition of distinct physiological states. This projection method also facilitates visualization of classification results in a reduced dimensional space. Examples from four different cases demonstrate the ability of the method to produce well-separated groups in the projection space and to identify important genes for defining physiological states. The method can be augmented to also include data from the proteomic and metabolic phenotypes and can be useful in disease diagnosis, drug screening and bioprocessing applications.

Algorithms↗

PubMed2002

Applications of Tree-Maps to hierarchical biological data.

UNLABELLED: A brief overview of Tree-Maps provides the basis for understanding two new implementations of Tree-Map methods. TreeMapClusterView provides a new way to view microarray gene expression data, and GenePlacer provides a view of gene ontology annotation data. We also discuss the benefits of Tree-Maps to visualize complex hierarchies in functional genomics. AVAILABILITY: Java class files are freely available at http://mendel.mc.duke.edu/bioinformatics/ CONTACT: mccon012@mc.duke.edu SUPPLEMENTARY INFORMATION: For more information on TreeMapClusterView (see http://mendel.mc.duke.edu/bioinformatics/software/boxclusterview/), and http://mendel.mc.duke.edu/bioinformatics/software/geneplacer/).

Algorithms↗

PubMed2002

Discovering statistically significant biclusters in gene expression data.

In gene expression data, a bicluster is a subset of the genes exhibiting consistent patterns over a subset of the conditions. We propose a new method to detect significant biclusters in large expression datasets. Our approach is graph theoretic coupled with statistical modelling of the data. Under plausible assumptions, our algorithm is polynomial and is guaranteed to find the most significant biclusters. We tested our method on a collection of yeast expression profiles and on a human cancer dataset. Cross validation results show high specificity in assigning function to genes based on their biclusters, and we are able to annotate in this way 196 uncharacterized yeast genes. We also demonstrate how the biclusters lead to detecting new concrete biological associations. In cancer data we are able to detect and relate finer tissue types than was previously possible. We also show that the method outperforms the biclustering algorithm of Cheng and Church (2000).

Algorithms↗