{"title":"蛋白质相互作用网络中的石墨烯排列","authors":"Mu-Fen Hsieh, S. Sze","doi":"10.1109/GENSIPS.2010.5719676","DOIUrl":null,"url":null,"abstract":"With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.","PeriodicalId":388703,"journal":{"name":"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graphlet alignment in protein interaction networks\",\"authors\":\"Mu-Fen Hsieh, S. Sze\",\"doi\":\"10.1109/GENSIPS.2010.5719676\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.\",\"PeriodicalId\":388703,\"journal\":{\"name\":\"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GENSIPS.2010.5719676\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GENSIPS.2010.5719676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graphlet alignment in protein interaction networks
With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.