{"title":"蛋白质网络聚类图中子聚类的构造","authors":"Tsitsiashvili Gurami","doi":"10.4172/2155-6180.1000405","DOIUrl":null,"url":null,"abstract":"Previously an algorithm is constructed to replace each cluster (a class of cyclically equivalent vertices) in a directed graph (representing a protein network) with an acyclic sub-graph preserving all input and output vertices. This algorithm is continuing by an introduction of minimal number of edges between the output vertices and the input vertices in order to introduce feedbacks, stabilizing the functioning of the network. Citation: Gurami T (2018) Construction of Sub-Clusters in the Cluster of Graph Representing the Protein Network. J Biom Biostat 9: 405. doi: 10.4172/2155-6180.1000405","PeriodicalId":87294,"journal":{"name":"Journal of biometrics & biostatistics","volume":"09 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4172/2155-6180.1000405","citationCount":"0","resultStr":"{\"title\":\"Construction of Sub-Clusters in the Cluster of Graph Representing the Protein Network\",\"authors\":\"Tsitsiashvili Gurami\",\"doi\":\"10.4172/2155-6180.1000405\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Previously an algorithm is constructed to replace each cluster (a class of cyclically equivalent vertices) in a directed graph (representing a protein network) with an acyclic sub-graph preserving all input and output vertices. This algorithm is continuing by an introduction of minimal number of edges between the output vertices and the input vertices in order to introduce feedbacks, stabilizing the functioning of the network. Citation: Gurami T (2018) Construction of Sub-Clusters in the Cluster of Graph Representing the Protein Network. J Biom Biostat 9: 405. doi: 10.4172/2155-6180.1000405\",\"PeriodicalId\":87294,\"journal\":{\"name\":\"Journal of biometrics & biostatistics\",\"volume\":\"09 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.4172/2155-6180.1000405\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of biometrics & biostatistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4172/2155-6180.1000405\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of biometrics & biostatistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4172/2155-6180.1000405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
先前构造了一种算法，将有向图(表示蛋白质网络)中的每个簇(一类循环等效顶点)替换为保留所有输入和输出顶点的无环子图。该算法通过引入输出点和输入点之间的最小边数来继续引入反馈，稳定网络的功能。引用本文:Gurami T (2018) the Cluster of Graph of Cluster of Sub-Clusters of representation the Protein Network。[J] .中国生物医学工程学报，9(5):444。doi: 10.4172 / 2155 - 6180.1000405
Construction of Sub-Clusters in the Cluster of Graph Representing the Protein Network
Previously an algorithm is constructed to replace each cluster (a class of cyclically equivalent vertices) in a directed graph (representing a protein network) with an acyclic sub-graph preserving all input and output vertices. This algorithm is continuing by an introduction of minimal number of edges between the output vertices and the input vertices in order to introduce feedbacks, stabilizing the functioning of the network. Citation: Gurami T (2018) Construction of Sub-Clusters in the Cluster of Graph Representing the Protein Network. J Biom Biostat 9: 405. doi: 10.4172/2155-6180.1000405
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
