欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了进行对蛋白质相互作用网络的拓扑分析，应用最短路径技术对蛋白质相互作用数据库（DIP）中包括酵母在内的7个物种的8个蛋白质相互作用网络进行了研究，包括对网络直径、特征路径长度、连通效率、顶点介数与顶点度的相关性以及高介数边和长间隔边在网络连通中的作用的研究。分析发现，这些网络对随机移除一定数量的蛋白质顶点（或边）具有很好的健壮性，但对高介数顶点（或边）的确定性移除却相当脆弱，而且按顺序移除2％高介数顶点所引起的网络连通效率下降明显大于随机移除10％顶点所引起的网络连通效率变化；所研究的7个物种的网络都存在不同比例的边缺失替代路径，绝大多数网络在移除一定比例的长间隔边后网络连通效率下降。
英文摘要：
Eight protein-protein interaction networks of 7 species from the database of interacting proteins （DIP） were studied based on the shortest path technique for topological analysis of the protein-protein interaction networks of all species, including the studies of the networks＇ diameter, characteristic path length, connection efficiency, relation between vertex betweenness and degree, and the effect of edges with high betweenness and long range on network connection. The analyses show that all the 8 protein-protein interaction networks are robust against the arbitrary elimination of vertices （or edges）, but vulnerable to the sequential deletion of vertices （or edges） by betweenness. The connection efficiency of a network decreases faster when 2% of vertices are sequentially removed from the highest betweenness than that when 10% of vertices are removed at random. There are a certain number of edges without substitute paths in all the 8 protein-protein interaction networks of 7 species. Most networks are vulnerable to sequential removal of edges with long range.
同期刊论文项目
同项目期刊论文
Significant linkage and association between a functional (GT)n polymorphism in promoter of the N-met
A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments an
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Approximation algorithm based on chain implication for constrained minimum vertex covers in bipartit
A modified particle swarm optimization-based dynamic recurrent neural network for identifying and co
期刊信息
位置：