计算机科学
拓扑(电路)
网络拓扑
卷积神经网络
Boosting(机器学习)
计算拓扑学
蛋白质结构预测
树(集合论)
人工智能
计算生物学
持久同源性
蛋白质结构
机器学习
算法
生物
数学
组合数学
操作系统
分解
数学分析
生物化学
生态学
作者
Menglun Wang,Zixuan Cang,Guo‐Wei Wei
标识
DOI:10.1038/s42256-020-0149-6
摘要
The ability to predict protein–protein interactions is crucial to our understanding of a wide range of biological activities and functions in the human body, and for guiding drug discovery. Despite considerable efforts to develop suitable computational methods, predicting protein–protein interaction binding affinity changes following mutation (ΔΔG) remains a severe challenge. Algebraic topology, a champion in recent worldwide competitions for protein–ligand binding affinity predictions, is a promising approach to simplifying the complexity of biological structures. Here we introduce element- and site-specific persistent homology (a new branch of algebraic topology) to simplify the structural complexity of protein–protein complexes and embed crucial biological information into topological invariants. We also propose a new deep learning algorithm called NetTree to take advantage of convolutional neural networks and gradient-boosting trees. A topology-based network tree is constructed by integrating the topological representation and NetTree for predicting protein–protein interaction ΔΔG. Tests on major benchmark datasets indicate that the proposed topology-based network tree is an important improvement over the current state of the art in predicting ΔΔG. Persistent homology provides an efficient approach to simplifying the complexity of protein structure. Wang et al. combine this approach with convolutional neural networks and gradient-boosting trees to improve predictions of protein–protein interactions.
科研通智能强力驱动
Strongly Powered by AbleSci AI