Downloads & Free Reading Options - Results

This article is from Bioinformatics , volume 28 . Abstract Summary: Finding significant differences between the expression levels of genes or proteins across diverse biological conditions is one of the primary goals in the analysis of functional genomics data. However, existing methods for identifying differentially expressed genes or sets of genes by comparing measures of the average expression across predefined sample groups do not detect differential variance in the expression levels across genes in cellular pathways. Since corresponding pathway deregulations occur frequently in microarray gene or protein expression data, we present a new dedicated web application, PathVar, to analyze these data sources. The software ranks pathway-representing gene/protein sets in terms of the differences of the variance in the within-pathway expression levels across different biological conditions. Apart from identifying new pathway deregulation patterns, the tool exploits these patterns by combining different machine learning methods to find clusters of similar samples and build sample classification models.Availability: freely available at http://pathvar.embl.deContact:[email protected] information:Supplementary data are available at Bioinformatics online.

This article is from Bioinformatics , volume 28 . Abstract Summary: Finding significant differences between the expression levels of genes or proteins across diverse biological conditions is one of the primary goals in the analysis of functional genomics data. However, existing methods for identifying differentially expressed genes or sets of genes by comparing measures of the average expression across predefined sample groups do not detect differential variance in the expression levels across genes in cellular pathways. Since corresponding pathway deregulations occur frequently in microarray gene or protein expression data, we present a new dedicated web application, PathVar, to analyze these data sources. The software ranks pathway-representing gene/protein sets in terms of the differences of the variance in the within-pathway expression levels across different biological conditions. Apart from identifying new pathway deregulation patterns, the tool exploits these patterns by combining different machine learning methods to find clusters of similar samples and build sample classification models.Availability: freely available at http://pathvar.embl.deContact:[email protected] information:Supplementary data are available at Bioinformatics online.

In this paper, we present a new approach for analyzing gene expression data that builds on topological characteristics of time series. Our goal is to identify cell cycle regulated genes in micro array dataset. We construct a point cloud out of time series using delay coordinate embeddings. Persistent homology is utilized to analyse the topology of the point cloud for detection of periodicity. This novel technique is accurate and robust to noise, missing data points and varying sampling intervals. Our experiments using Yeast Saccharomyces cerevisiae dataset substantiate the capabilities of the proposed method.

This article is from BMC Bioinformatics , volume 12 . Abstract Background: Clustering-based methods on gene-expression analysis have been shown to be useful in biomedical applications such as cancer subtype discovery. Among them, Matrix factorization (MF) is advantageous for clustering gene expression patterns from DNA microarray experiments, as it efficiently reduces the dimension of gene expression data. Although several MF methods have been proposed for clustering gene expression patterns, a systematic evaluation has not been reported yet. Results: Here we evaluated the clustering performance of orthogonal and non-orthogonal MFs by a total of nine measurements for performance in four gene expression datasets and one well-known dataset for clustering. Specifically, we employed a non-orthogonal MF algorithm, BSNMF (Bi-directional Sparse Non-negative Matrix Factorization), that applies bi-directional sparseness constraints superimposed on non-negative constraints, comprising a few dominantly co-expressed genes and samples together. Non-orthogonal MFs tended to show better clustering-quality and prediction-accuracy indices than orthogonal MFs as well as a traditional method, K-means. Moreover, BSNMF showed improved performance in these measurements. Non-orthogonal MFs including BSNMF showed also good performance in the functional enrichment test using Gene Ontology terms and biological pathways. Conclusions: In conclusion, the clustering performance of orthogonal and non-orthogonal MFs was appropriately evaluated for clustering microarray data by comprehensive measurements. This study showed that non-orthogonal MFs have better performance than orthogonal MFs and K-means for clustering microarray data.

This article is from BMC Bioinformatics , volume 12 . Abstract Background: Clustering-based methods on gene-expression analysis have been shown to be useful in biomedical applications such as cancer subtype discovery. Among them, Matrix factorization (MF) is advantageous for clustering gene expression patterns from DNA microarray experiments, as it efficiently reduces the dimension of gene expression data. Although several MF methods have been proposed for clustering gene expression patterns, a systematic evaluation has not been reported yet. Results: Here we evaluated the clustering performance of orthogonal and non-orthogonal MFs by a total of nine measurements for performance in four gene expression datasets and one well-known dataset for clustering. Specifically, we employed a non-orthogonal MF algorithm, BSNMF (Bi-directional Sparse Non-negative Matrix Factorization), that applies bi-directional sparseness constraints superimposed on non-negative constraints, comprising a few dominantly co-expressed genes and samples together. Non-orthogonal MFs tended to show better clustering-quality and prediction-accuracy indices than orthogonal MFs as well as a traditional method, K-means. Moreover, BSNMF showed improved performance in these measurements. Non-orthogonal MFs including BSNMF showed also good performance in the functional enrichment test using Gene Ontology terms and biological pathways. Conclusions: In conclusion, the clustering performance of orthogonal and non-orthogonal MFs was appropriately evaluated for clustering microarray data by comprehensive measurements. This study showed that non-orthogonal MFs have better performance than orthogonal MFs and K-means for clustering microarray data.

This article is from Nucleic Acids Research , volume 39 . Abstract Chromatin immunoprecipitation (ChIP) coupled with high-throughput techniques (ChIP-X), such as next generation sequencing (ChIP-Seq) and microarray (ChIP–chip), has been successfully used to map active transcription factor binding sites (TFBS) of a transcription factor (TF). The targeted genes can be activated or suppressed by the TF, or are unresponsive to the TF. Microarray technology has been used to measure the actual expression changes of thousands of genes under the perturbation of a TF, but is unable to determine if the affected genes are direct or indirect targets of the TF. Furthermore, both ChIP-X and microarray methods produce a large number of false positives. Combining microarray expression profiling and ChIP-X data allows more effective TFBS analysis for studying the function of a TF. However, current web servers only provide tools to analyze either ChIP-X or expression data, but not both. Here, we present ChIP-Array, a web server that integrates ChIP-X and expression data from human, mouse, yeast, fruit fly and Arabidopsis. This server will assist biologists to detect direct and indirect target genes regulated by a TF of interest and to aid in the functional characterization of the TF. ChIP-Array is available at http://jjwanglab.hku.hk/ChIP-Array, with free access to academic users.

Background : Microarray technology has revolutionized the way genomic analysis has been performed. High-throughput data acquisition, brought up a challenge in data comprehension i.e. in gene expression. Methods : k-means cluster obtained after analysis of miRNA expression data have been sorted by an algorithmic procedure. Results : The proposed method managed to sort k-means centroids and manifest a more simple way of drawing conclusions on studied tumor samples. miRNAs were unraveled that changed in expression levels with respect to tumor aggressiveness. Conclusions : In the present work we presented a new and simple approach in data analysis using a new analysis approach, which we termed sorted-k-means analysis.

Background : Microarray technology has revolutionized the way genomic analysis has been performed. High-throughput data acquisition, brought up a challenge in data comprehension i.e. in gene expression. Methods : k-means cluster obtained after analysis of miRNA expression data have been sorted by an algorithmic procedure. Results : The proposed method managed to sort k-means centroids and manifest a more simple way of drawing conclusions on studied tumor samples. miRNAs were unraveled that changed in expression levels with respect to tumor aggressiveness. Conclusions : In the present work we presented a new and simple approach in data analysis using a new analysis approach, which we termed sorted-k-means analysis.