Transcriptome network component analysis with limited microarray data

被引:43
作者
Galbraith, Simon J.
Tran, Linh M.
Liao, James C. [1 ]
机构
[1] Univ Calif Los Angeles, Dept Chem Engn, Los Angeles, CA 90024 USA
[2] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90024 USA
基金
美国国家科学基金会;
关键词
D O I
10.1093/bioinformatics/btl279
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Network component analysis (NCA) is a method to deduce transcription factor (TF) activities and TF-gene regulation control strengths from gene expression data and a TF-gene binding connectivity network. Previously, this method could analyze a maximum number of regulators equal to the total sample size because of the identifiability limit in data decomposition. As such, the total number of source signal components was limited to the total number of experiments rather than the total number of biological regulators. However, networks that have less transcriptome data points than the number of regulators are of interest. Thus it is imperative to develop a theoretical basis that allows realistic source signal extraction based on relatively few data points. On the other hand, such methods would inherently increase numerical challenges leading to multiple solutions. Therefore, solutions to both the problems are needed. Results: We have improved NCA for transcription factor activity (TFA) estimation, based on the observation that most genes are regulated by only a few TFs. This observation leads to the derivation of a new identifiability criterion which is tested during numerical iteration that allows us to decompose data when the number of TFs is greater than the number of experiments. To show that our method works with real microarray data and has biological utility, we analyze Saccharomyces cerevisiae cell cycle microarray data (73 experiments) using a TF-gene connectivity network (96 TFs) derived from ChIP-chip binding data. We compare the results of NCA analysis with the results obtained from ChIP-chip regression methods, and we show that NCA and regression produce TFAs that are qualitatively similar, but the NCA TFAs outperform regression in statistical tests. We also show that NCA can extract subtle TFA signals that correlate with known cell cycle TF function and cell cycle phase. Overall we determined that 31 TFs have statistically periodic TFAs in one or more experiments, 75% of which are known cell cycle regulators. In addition, we find that the 12 TFAs that are periodic in two or more experiments correspond to well-known cell cycle regulators. We also investigated TFA sensitivity to the choice of connectivity network we constructed two networks using different ChIP-chip p-value cut-offs.
引用
收藏
页码:1886 / 1894
页数:9
相关论文
共 29 条
[1]   Robust detection of periodic time series measured from biological systems -: art. no. 117 [J].
Ahdesmäki, M ;
Lähdesmäki, H ;
Pearson, R ;
Huttunen, H ;
Yli-Harja, O .
BMC BIOINFORMATICS, 2005, 6 (1)
[2]  
Almeida Jonas S, 2003, Genome Inform, V14, P114
[3]   Integrative analysis of genome-scale data by using pseudoinverse projection predicts novel correlation between DNA replication and RNA transcription [J].
Alter, O ;
Golub, GH .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (47) :16577-16582
[4]   Singular value decomposition for genome-wide expression data processing and modeling [J].
Alter, O ;
Brown, PO ;
Botstein, D .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (18) :10101-10106
[5]  
Anderson TW., 1984, INTRO MULTIVARIATE S
[6]  
[Anonymous], 1976, BIOCH SYSTEMS ANAL S
[7]  
[Anonymous], 2021, Bayesian Data Analysis
[8]   Regulatory element detection using correlation with expression [J].
Bussemaker, HJ ;
Li, H ;
Siggia, ED .
NATURE GENETICS, 2001, 27 (02) :167-171
[9]   Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data [J].
Gao, F ;
Foat, BC ;
Bussemaker, HJ .
BMC BIOINFORMATICS, 2004, 5 (1)
[10]   Fast and robust fixed-point algorithms for independent component analysis [J].
Hyvärinen, A .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (03) :626-634