{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:14:35Z","timestamp":1758474875271,"version":"3.32.0"},"reference-count":29,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572094"],"award-info":[{"award-number":["61572094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["DUT2017TB02","DUT14QY07"],"award-info":[{"award-number":["DUT2017TB02","DUT14QY07"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quant. Biol."],"published-print":{"date-parts":[[2018,12]]},"abstract":"<jats:sec><jats:title>Background<\/jats:title><jats:p>Statistical validation of predicted complexes is a fundamental issue in proteomics and bioinformatics. The target is to measure the statistical significance of each predicted complex in terms of <jats:italic>p<\/jats:italic>\u2010values. Surprisingly, this issue has not received much attention in the literature. To our knowledge, only a few research efforts have been made towards this direction.<\/jats:p><\/jats:sec><jats:sec><jats:title>Methods<\/jats:title><jats:p>In this article, we propose a novel method for calculating the <jats:italic>p<\/jats:italic>\u2010value of a predicted complex. The null hypothesis is that there is no difference between the number of edges in target protein complex and that in the random null model. In addition, we assume that a true protein complex must be a connected subgraph. Based on this null hypothesis, we present an algorithm to compute the <jats:italic>p<\/jats:italic>\u2010value of a given predicted complex.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>We test our method on five benchmark data sets to evaluate its effectiveness.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>The experimental results show that our method is superior to the state\u2010of\u2010the\u2010art algorithms on assessing the statistical significance of candidate protein complexes.<\/jats:p><\/jats:sec>","DOI":"10.1007\/s40484-018-0153-6","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T04:29:07Z","timestamp":1542688147000},"page":"313-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the statistical significance of protein complex"],"prefix":"10.1002","volume":"6","author":[{"given":"Youfu","family":"Su","sequence":"first","affiliation":[{"name":"<!--1--> School of Software Dalian University of Technology Dalian 116024 China"}]},{"given":"Can","family":"Zhao","sequence":"additional","affiliation":[{"name":"<!--1--> School of Software Dalian University of Technology Dalian 116024 China"}]},{"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[{"name":"<!--1--> School of Software Dalian University of Technology Dalian 116024 China"}]},{"given":"Bo","family":"Tian","sequence":"additional","affiliation":[{"name":"<!--1--> School of Software Dalian University of Technology Dalian 116024 China"}]},{"given":"Zengyou","family":"He","sequence":"additional","affiliation":[{"name":"<!--1--> School of Software Dalian University of Technology Dalian 116024 China"},{"name":"<!--2--> Key Laboratory for Ubiquitous Network and Service Software of Liaoning Dalian 116024 China"}]}],"member":"311","published-online":{"date-parts":[[2018,12]]},"reference":[{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/35001009"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature04532"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1938"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbu038"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2017.0037"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbt039"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.225"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471\u20102164\u201011\u2010S1\u2010S3"},{"key":"e_1_2_8_10_2","doi-asserted-by":"crossref","first-page":"S10","DOI":"10.1186\/1471-2164-11-S3-S10","article-title":"Recent advances in clustering methods for protein interaction networks.","volume":"11","author":"Wang J.","year":"2010","journal-title":"BMC Genomics"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2492559"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471\u20102105\u20107\u2010488"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp551"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep02930"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.R014"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2032324100"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3091106"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1409770111"},{"key":"e_1_2_8_22_2","first-page":"1","article-title":"The Igraph software package for complex network research","volume":"1695","author":"Csardi G.","year":"2006","journal-title":"Inter. Journal Complex Systems"},{"key":"e_1_2_8_23_2","unstructured":"Nepusz T. Yu H.andPaccanaro A.Clusterone cytoscape plugin.http:\/\/www.paccanarolab.org\/static_content\/clusterone\/cl1\u2010cytoscape3\u20101.0.html"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1074\/mcp.M600381\u2010MCP200"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature04670"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj109"},{"key":"e_1_2_8_27_2","unstructured":"\u201cHow many connected graphs over v vertices and e edges?\u201dhttp:\/\/math.stackexchange.com\/questions\/689526\/how\u2010many\u2010connected\u2010graphs\u2010over\u2010v\u2010vertices\u2010and\u2010e\u2010edges"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097\u20103165(95)90022\u20105"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1137\/0111030"},{"key":"e_1_2_8_30_2","doi-asserted-by":"crossref","unstructured":"Mor\u00e9 J.(1977)The levenberg\u2013marquardt algorithm: Implementation and theory. InConference on Numerical Analysis. Dundee UK","DOI":"10.1007\/BFb0067700"}],"container-title":["Quantitative Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40484-018-0153-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40484-018-0153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40484-018-0153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1007\/s40484-018-0153-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T09:59:27Z","timestamp":1735898367000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1007\/s40484-018-0153-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["10.1007\/s40484-018-0153-6"],"URL":"https:\/\/doi.org\/10.1007\/s40484-018-0153-6","archive":["Portico"],"relation":{},"ISSN":["2095-4689","2095-4697"],"issn-type":[{"type":"print","value":"2095-4689"},{"type":"electronic","value":"2095-4697"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"30 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}