...
首页> 外文期刊>PLoS Computational Biology >Binding Site Graphs: A New Graph Theoretical Framework for Prediction of Transcription Factor Binding Sites
【24h】

Binding Site Graphs: A New Graph Theoretical Framework for Prediction of Transcription Factor Binding Sites

机译:结合位点图:预测转录因子结合位点的新图论框架

获取原文
           

摘要

Computational prediction of nucleotide binding specificity for transcription factors remains a fundamental and largely unsolved problem. Determination of binding positions is a prerequisite for research in gene regulation, a major mechanism controlling phenotypic diversity. Furthermore, an accurate determination of binding specificities from high-throughput data sources is necessary to realize the full potential of systems biology. Unfortunately, recently performed independent evaluation showed that more than half the predictions from most widely used algorithms are false. We introduce a graph-theoretical framework to describe local sequence similarity as the pair-wise distances between nucleotides in promoter sequences, and hypothesize that densely connected subgraphs are indicative of transcription factor binding sites. Using a well-established sampling algorithm coupled with simple clustering and scoring schemes, we identify sets of closely related nucleotides and test those for known TF binding activity. Using an independent benchmark, we find our algorithm predicts yeast binding motifs considerably better than currently available techniques and without manual curation. Importantly, we reduce the number of false positive predictions in yeast to less than 30%. We also develop a framework to evaluate the statistical significance of our motif predictions. We show that our approach is robust to the choice of input promoters, and thus can be used in the context of predicting binding positions from noisy experimental data. We apply our method to identify binding sites using data from genome scale ChIP–chip experiments. Results from these experiments are publicly available at http://cagt10.bu.edu/BSG. The graphical framework developed here may be useful when combining predictions from numerous computational and experimental measures. Finally, we discuss how our algorithm can be used to improve the sensitivity of computational predictions of transcription factor binding specificities.
机译:转录因子核苷酸结合特异性的计算预测仍然是一个基本且尚未解决的问题。确定结合位置是研究基因调控的先决条件,基因调控是控制表型多样性的主要机制。此外,从高通量数据源中准确确定结合特异性对于实现系统生物学的全部潜力是必要的。不幸的是,最近进行的独立评估表明,来自最广泛使用的算法的一半以上的预测是错误的。我们介绍了一种图形理论框架,以启动子序列中核苷酸之间的成对距离描述局部序列相似性,并假设紧密连接的子图指示转录因子结合位点。使用公认的采样算法,再加上简单的聚类和评分方案,我们确定了密切相关的核苷酸集并测试了已知的TF结合活性。使用一个独立的基准,我们发现我们的算法可以比目前可用的技术更好地预测酵母结合基序,并且无需人工管理。重要的是,我们将酵母中的假阳性预测数减少到少于30%。我们还开发了一个框架来评估我们的主题预测的统计意义。我们表明我们的方法对输入启动子的选择是鲁棒的,因此可以用于从嘈杂的实验数据预测结合位置的背景下。我们运用我们的方法来鉴定结合位点,使用的是基因组规模芯片实验的数据。这些实验的结果可在http://cagt10.bu.edu/BSG上公开获得。当结合来自众多计算和实验手段的预测时,此处开发的图形框架可能会很有用。最后,我们讨论了如何使用我们的算法来提高转录因子结合特异性的计算预测的敏感性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号