• Title/Summary/Keyword: Microarray gene expression data

Search Result 315, Processing Time 0.026 seconds

The Sliding Window Gene-Shaving Algorithm for Microarray Data Analysis

  • 이혜선;최대우;전치혁
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2002.06a
    • /
    • pp.139-152
    • /
    • 2002
  • Gene-shaving(Hastie et al, 2000) is a very useful method to identify a meaningful group of genes when the variation of expression is large. By shaving off the low-correlated genes with the leading principal component, the primary genes with the coherent expression pattern can be identified. Gene-shaving method works well If expression levels are varied enough, but it may not catch the meaningful cluster in low expression level or different expression time even with coherent patterns. The sliding window gene-shaving method which is to apply gene-shaving in each sliding window after hierarchical clustering is to compensate losing a meaningful set of genes whose variation is not large but distinct. The performance to identify expression patterns is compared for the simulated profile data by the different variance and expression level.

  • PDF

GEDA: New Knowledge Base of Gene Expression in Drug Addiction

  • Suh, Young-Ju;Yang, Moon-Hee;Yoon, Suk-Joon;Park, Jong-Hoon
    • BMB Reports
    • /
    • v.39 no.4
    • /
    • pp.441-447
    • /
    • 2006
  • Abuse of drugs can elicit compulsive drug seeking behaviors upon repeated administration, and ultimately leads to the phenomenon of addiction. We developed a procedure for the standardization of microarray gene expression data of rat brain in drug addiction and stored them in a single integrated database system, focusing on more effective data processing and interpretation. Another characteristic of the present database is that it has a systematic flexibility for statistical analysis and linking with other databases. Basically, we adopt an intelligent SQL querying system, as the foundation of our DB, in order to set up an interactive module which can automatically read the raw gene expression data in the standardized format. We maximize the usability of this DB, helping users study significant gene expression and identify biological function of the genes through integrated up-to-date gene information such as GO annotation and metabolic pathway. For collecting the latest information of selected gene from the database, we also set up the local BLAST search engine and non-redundant sequence database updated by NCBI server on a daily basis. We find that the present database is a useful query interface and data-mining tool, specifically for finding out the genes related to drug addiction. We apply this system to the identification and characterization of methamphetamine-induced genes' behavior in rat brain.

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

Descriptive and Systematic Comparison of Clustering Methods in Microarray Data Analysis

  • Kim, Seo-Young
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.1
    • /
    • pp.89-106
    • /
    • 2009
  • There have been many new advances in the development of improved clustering methods for microarray data analysis, but traditional clustering methods are still often used in genomic data analysis, which maY be more due to their conceptual simplicity and their broad usability in commercial software packages than to their intrinsic merits. Thus, it is crucial to assess the performance of each existing method through a comprehensive comparative analysis so as to provide informed guidelines on choosing clustering methods. In this study, we investigated existing clustering methods applied to microarray data in various real scenarios. To this end, we focused on how the various methods differ, and why a particular method does not perform well. We applied both internal and external validation methods to the following eight clustering methods using various simulated data sets and real microarray data sets.

Gene filtering based on fuzzy pattern matching for whole genome micro array data analysis (마이크로어레이 데이터의 게놈수준 분석을 위한 퍼지 패턴 매칭에 의한 유전자 필터링)

  • Lee, Sun-A;Lee, Keon-Myung;Lee, Seung-Joo;Kim, Wun-Jea;Kim, Yong-June;Bae, Suk-Cheol
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.471-475
    • /
    • 2008
  • Microarray technology in biological science enables molecular level observations and analyses on the biological phenomina by allowing to measure the RNA expression profiles in cells. Microarray data analysis is applied in various purposes such as identifying significant genes which react to drug treatment, understanding the genome scale phenomina. In drug response experiments, the microarray-based gene expression analysis could provide meaningful information. It is sometimes needed to identify the genes which shows different expression behavior for treatment group and normal group each other. When the normal group shows the medium level expression, it is not easy to discriminate the group just by expression level comparison. This paper proposes a method which selects group-wise representative values for each gene and sets the value range of the groups in order to filter out the genes with specific pattern. It also shows some experiment results.

Microarray Profiling of Genes Differentially Expressed during Erythroid Differentiation of Murine Erythroleukemia Cells

  • Heo, Hyen Seok;Kim, Ju Hyun;Lee, Young Jin;Kim, Sung-Hyun;Cho, Yoon Shin;Kim, Chul Geun
    • Molecules and Cells
    • /
    • v.20 no.1
    • /
    • pp.57-68
    • /
    • 2005
  • Murine erythroleukemia (MEL) cells are widely used to study erythroid differentiation thanks to their ability to terminally differentiate in vitro in response to chemical induction. At the molecular level, not much is known of their terminal differentiation apart from activation of adult-type globin gene expression. We examined changes in gene expression during the terminal differentiation of these cells using microarray-based technology. We identified 180 genes whose expression changed significantly during differentiation. The microarray data were analyzed by hierarchical and k-means clustering and confirmed by semi-quantitative RT-PCR. We identified several genes including H1f0, Bnip3, Mgl2, ST7L, and Cbll1 that could be useful markers for erythropoiesis. These genetic markers should be a valuable resource both as potential regulators in functional studies of erythroid differentiation, and as straightforward cell type markers.

Balanced Experimental Designs for cDNA Microarray data

  • Choi, Kuey-Chung
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.121-129
    • /
    • 2006
  • Two color or cDNA microarrays are extensively used to study relative expression levels of thousands of genes simultaneously. 0かy two tissue samples can be hybridized on a single microarray slide. Thus, a microarray slide necessarily forms an incomplete block design with block size two when more than two tissue samples are under study. We also need to control for variability in gene expression values due to the two dyes. Thus, red and green dyes form the second blocking factor in addition to slides. General design problem for these microarray experiments is discussed in this paper. Designs for factorial cDNA microarrays are also discussed.

  • PDF

Comparison of clustering methods of microarray gene expression data (마이크로어레이 유전자 발현 자료에 대한 군집 방법 비교)

  • Lim, Jin-Soo;Lim, Dong-Hoon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.1
    • /
    • pp.39-51
    • /
    • 2012
  • Cluster analysis has proven to be a useful tool for investigating the association structure among genes and samples in a microarray data set. We applied several cluster validation measures to evaluate the performance of clustering algorithms for analyzing microarray gene expression data, including hierarchical clustering, K-means, PAM, SOM and model-based clustering. The available validation measures fall into the three general categories of internal, stability and biological. The performance of clustering algorithms is evaluated using simulated and SRBCT microarray data. Our results from simulated data show that nearly every methods have good results with same result as the number of classes in the original data. For the SRBCT data the best choice for the number of clusters is less clear than the simulated data. It appeared that PAM, SOM, model-based method showed similar results to simulated data under Silhouette with of internal measure as well as PAM and model-based method under biological measure, while model-based clustering has the best value of stability measure.

A Pattern Consistency Index for Detecting Heterogeneous Time Series in Clustering Time Course Gene Expression Data (시간경로 유전자 발현자료의 군집분석에서 이질적인 시계열의 탐지를 위한 패턴일치지수)

  • Son, Young-Sook;Baek, Jang-Sun
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.2
    • /
    • pp.371-379
    • /
    • 2005
  • In this paper, we propose a pattern consistency index for detecting heterogeneous time series that deviate from the representative pattern of each cluster in clustering time course gene expression data using the Pearson correlation coefficient. We examine its usefulness by applying this index to serum time course gene expression data from microarrays.