NeProc predicts binding segments in intrinsically disordered regions without learning binding region sequences

DOI Web Site 参考文献32件 オープンアクセス
  • Anbo Hiroto
    Department of Life Science and Informatics, Faculty of Engineering, Maebashi Institute of Technology
  • Amagai Hiroki
    Department of Life Science and Informatics, Faculty of Engineering, Maebashi Institute of Technology
  • Fukuchi Satoshi
    Department of Life Science and Informatics, Faculty of Engineering, Maebashi Institute of Technology

この論文をさがす

抄録

<p>Intrinsically disordered proteins are those proteins with intrinsically disordered regions. One of the unique characteristics of intrinsically disordered proteins is the existence of functional segments in intrinsically dis­ordered regions. These segments are involved in binding to partner molecules, such as protein and DNA, and play important roles in signaling pathways and/or transcriptional regulation. Although there are databases that gather information on such disordered binding regions, data remain limited. Therefore, it is desirable to develop programs to predict the disordered binding regions without using data for the binding regions. We developed a program, NeProc, to predict the disordered binding regions, which can be regarded as intrinsically disordered regions with a structural propensity. We only used data for the structural domains and intrinsically disordered regions to detect such regions. NeProc accepts a query amino acid sequence converted into a position specific score matrix, and uses two neural networks that employ different window sizes, a neural network of short windows, and a neural network of long windows. The performance of NeProc was comparable to that of existing programs of the disordered binding region prediction. This result presents the possibility to overcome the shortage of the disordered binding region data in the development of the prediction programs for these binding regions. NeProc is available at http://flab.neproc.org/neproc/index.html</p>

収録刊行物

参考文献 (32)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ