Probabilistic Inference of Transcription Factor Binding from Multiple Data Sources

被引:38
作者
Lahdesmaki, Harri [1 ]
Rust, Alistair G. [1 ]
Shmulevich, Ilya [1 ]
机构
[1] Inst Syst Biol, Seattle, WA USA
来源
PLOS ONE | 2008年 / 3卷 / 03期
关键词
D O I
10.1371/journal.pone.0001820
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
An important problem in molecular biology is to build a complete understanding of transcriptional regulatory processes in the cell. We have developed a flexible, probabilistic framework to predict TF binding from multiple data sources that differs from the standard hypothesis testing (scanning) methods in several ways. Our probabilistic modeling framework estimates the probability of binding and, thus, naturally reflects our degree of belief in binding. Probabilistic modeling also allows for easy and systematic integration of our binding predictions into other probabilistic modeling methods, such as expression-based gene network inference. The method answers the question of whether the whole analyzed promoter has a binding site, but can also be extended to estimate the binding probability at each nucleotide position. Further, we introduce an extension to model combinatorial regulation by several TFs. Most importantly, the proposed methods can make principled probabilistic inference from multiple evidence sources, such as, multiple statistical models (motifs) of the TFs, evolutionary conservation, regulatory potential, CpG islands, nucleosome positioning, DNase hypersensitive sites, ChIP-chip binding segments and other (prior) sequence-based biological knowledge. We developed both a likelihood and a Bayesian method, where the latter is implemented with a Markov chain Monte Carlo algorithm. Results on a carefully constructed test set from the mouse genome demonstrate that principled data fusion can significantly improve the performance of TF binding prediction methods. We also applied the probabilistic modeling framework to all promoters in the mouse genome and the results indicate a sparse connectivity between transcriptional regulators and their target promoters. To facilitate analysis of other sequences and additional data, we have developed an on-line web tool, ProbTF, which implements our probabilistic TF binding prediction method using multiple data sources. Test data set, a web tool, source codes and supplementary data are available at: http://www.probtf.org.
引用
收藏
页数:24
相关论文
共 91 条
  • [1] AMBESI I, 2006, BMC NEUROSCIENCE S1, V7, pS8
  • [2] [Anonymous], 2005, MONTE CARLO STAT MET
  • [3] Bailey T L, 1995, Proc Int Conf Intell Syst Mol Biol, V3, P21
  • [4] Bailey TL., 1994, P 2 INT C INT SYST M, V2, P28
  • [5] Detection-theoretic analysis of MatInspector
    Bajic, Ivan V.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (06) : 2388 - 2393
  • [6] CIS:: compound importance sampling method for protein-DNA binding site p-value estimation
    Barash, Y
    Elidan, G
    Kaplan, T
    Friedman, N
    [J]. BIOINFORMATICS, 2005, 21 (05) : 596 - 600
  • [7] BARASH Y, 2003, P 7 ANN INT C COMP B
  • [8] Predicting gene expression from sequence
    Beer, MA
    Tavazoie, S
    [J]. CELL, 2004, 117 (02) : 185 - 198
  • [9] Compact, universal DNA microarrays to comprehensively determine transcription-factor binding site specificities
    Berger, Michael F.
    Philippakis, Anthony A.
    Qureshi, Aaron M.
    He, Fangxue S.
    Estep, Preston W., III
    Bulyk, Martha L.
    [J]. NATURE BIOTECHNOLOGY, 2006, 24 (11) : 1429 - 1435
  • [10] Bernard A, 2005, PACIFIC SYMPOSIUM ON BIOCOMPUTING 2005, P459