{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:09:06Z","timestamp":1742947746679,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181734"},{"type":"electronic","value":"9783030181741"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18174-1_4","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:15:30Z","timestamp":1558361730000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Different Graphlet Measures for Evaluating Network Model Fits to BioGRID PPI Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8702-0578","authenticated-orcid":false,"given":"Sridevi","family":"Maharaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1693-3505","authenticated-orcid":false,"given":"Zarin","family":"Ohiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3310-6042","authenticated-orcid":false,"given":"Wayne","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.cpc.2015.05.028","volume":"196","author":"R Aldecoa","year":"2015","unstructured":"Aldecoa, R., Orsini, C., Krioukov, D.: Hyperbolic graph generator. Comput. Phys. Commun. 196, 492\u2013496 (2015)","journal-title":"Comput. Phys. Commun."},{"issue":"5439","key":"4_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"4_CR3","unstructured":"Barab\u00e1si, A., Dezso, Z., Ravasz, E., Yook, Z.H., Oltvai, Z.N.: Scale-free and hierarchical structures in complex networks. In: Modeling of Complex Systems: Seventh Granada Lectures. AIP Conference Proceedings, vol. 661, pp. 1\u201316 (2003)"},{"issue":"28","key":"4_CR4","doi-asserted-by":"publisher","first-page":"11433","DOI":"10.1073\/pnas.0811511106","volume":"106","author":"G Bianconi","year":"2009","unstructured":"Bianconi, G., Pin, P., Marsili, M.: Assessing the relevance of node features for network structure. Proc. Nat. Acad. Sci. 106(28), 11433\u201311438 (2009)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"D1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"D369","DOI":"10.1093\/nar\/gkw1102","volume":"45","author":"A Chatr-Aryamontri","year":"2017","unstructured":"Chatr-Aryamontri, A., et al.: The BioGRID interaction database: 2017 update. Nucleic Acids Res. 45(D1), D369\u2013D379 (2017)","journal-title":"Nucleic Acids Res."},{"issue":"10","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1093\/bioinformatics\/btv026","volume":"31","author":"D Davis","year":"2015","unstructured":"Davis, D., Yavero\u011flu, \u00d6.N., Malod-Dognin, N., Stojmirovic, A., Pr\u017eulj, N.: Topology-function conservation in protein-protein interaction networks. Bioinformatics 31(10), 1632\u20131639 (2015). https:\/\/doi.org\/10.1093\/bioinformatics\/btv026","journal-title":"Bioinformatics"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 233\u2013240. ACM (2006)","DOI":"10.1145\/1143844.1143874"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1093\/bioinformatics\/bts729","volume":"29","author":"W Hayes","year":"2013","unstructured":"Hayes, W., Sun, K., Pr\u017eulj, N.: Graphlet-based measures are suitable for biological network comparison. Bioinformatics 29(4), 483\u2013491 (2013)","journal-title":"Bioinformatics"},{"issue":"8","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1093\/bioinformatics\/btn079","volume":"24","author":"D Higham","year":"2008","unstructured":"Higham, D., Ra\u0161ajski, M., Pr\u017eulj, N.: Fitting a geometric graph to a protein-protein interaction network. Bioinformatics 24(8), 1093\u20131099 (2008)","journal-title":"Bioinformatics"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: A combinatorial approach to graphlet counting. Bioinformatics 30(4), 559\u2013565 (2014). https:\/\/doi.org\/10.1093\/bioinformatics\/btt717","journal-title":"Bioinformatics"},{"issue":"2","key":"4_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1515\/jib-2014-238","volume":"11","author":"V Janji\u0107","year":"2014","unstructured":"Janji\u0107, V., Pr\u017eulj, N.: The topology of the growing human interactome data. J. Integr. Bioinform. 11(2), 27\u201342 (2014)","journal-title":"J. Integr. Bioinform."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"4273","DOI":"10.1038\/srep04273","volume":"4","author":"V Janji\u0107","year":"2014","unstructured":"Janji\u0107, V., Sharan, R., Pr\u017eulj, N.: Modelling the yeast interactome. Sci. Rep. 4, 4273 (2014)","journal-title":"Sci. Rep."},{"issue":"10","key":"4_CR14","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1038\/nrm2503","volume":"9","author":"G Karlebach","year":"2008","unstructured":"Karlebach, G., Shamir, R.: Modelling and analysis of gene regulatory networks. Nat. Rev. Mol. Cell Biol. 9(10), 770 (2008)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"issue":"11","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"issue":"D1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"D581","DOI":"10.1093\/nar\/gky1037","volume":"47","author":"M Kotlyar","year":"2018","unstructured":"Kotlyar, M., Pastrello, C., Malik, Z., Jurisica, I.: IID 2018 update: context-specific physical protein-protein interactions in human, model organisms and domesticated species. Nucleic Acids Res. 47(D1), D581\u2013D589 (2018)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1093\/bioinformatics\/btr127","volume":"27","author":"O Kuchaiev","year":"2011","unstructured":"Kuchaiev, O., Pr\u017eulj, N.: Integrative network alignment reveals large regions of global network similarity in yeast and human. Bioinformatics 27, 1390\u20131396 (2011). https:\/\/doi.org\/10.1093\/bioinformatics\/btr127","journal-title":"Bioinformatics"},{"issue":"50","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","volume":"7","author":"O Kuchaiev","year":"2010","unstructured":"Kuchaiev, O., Milenkovi\u0107, T., Memi\u0161evi\u0107, V., Hayes, W., Pr\u017eulj, N.: Topological network alignment uncovers biological function and phylogeny. J. R. Soc. Interface 7(50), 1341\u20131354 (2010). https:\/\/doi.org\/10.1098\/rsif.2010.0063","journal-title":"J. R. Soc. Interface"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tibs.2017.02.006","volume":"42","author":"K Luck","year":"2017","unstructured":"Luck, K., Sheynkman, G.M., Zhang, I., Vidal, M.: Proteome-scale human interactomics. Trends Biochem. Sci. 42, 342\u2013354 (2017)","journal-title":"Trends Biochem. Sci."},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1093\/bioinformatics\/btl562","volume":"23","author":"F Luo","year":"2006","unstructured":"Luo, F., Yang, Y., Chen, C.F., Chang, R., Zhou, J., Scheuermann, R.H.: Modular organization of protein interaction networks. Bioinformatics 23(2), 207\u2013214 (2006)","journal-title":"Bioinformatics"},{"issue":"13","key":"4_CR22","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1093\/bioinformatics\/btv130","volume":"31","author":"N Malod-Dognin","year":"2015","unstructured":"Malod-Dognin, N., Pr\u017eulj, N.: L-GRAAL: Lagrangian graphlet-based network aligner. Bioinformatics 31(13), 2182\u20132189 (2015)","journal-title":"Bioinformatics"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"2156","DOI":"10.1093\/bioinformatics\/btx090","volume":"33","author":"N Mamano","year":"2017","unstructured":"Mamano, N., Hayes, W.B.: SANA: simulated annealing far outperforms many other search algorithms for biological network alignment. Bioinformatics 33, 2156\u20132164 (2017)","journal-title":"Bioinformatics"},{"issue":"6","key":"4_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1186\/s12859-017-1635-7","volume":"18","author":"M Milano","year":"2017","unstructured":"Milano, M., et al.: An extensive assessment of network alignment algorithms for comparison of brain connectomes. BMC Bioinform. 18(6), 235 (2017)","journal-title":"BMC Bioinform."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1186\/1471-2105-9-70","volume":"9","author":"T Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107, T., Lai, J., Pr\u017eulj, N.: GraphCrunch: a tool for large network analyses. BMC Bioinform. 9, 70 (2008)","journal-title":"BMC Bioinform."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107, T., Pr\u017eulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Inform. 6, 257\u2013273 (2008)","journal-title":"Cancer Inform."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4137\/CIN.S4744","volume":"9","author":"T Milenkovi\u0107","year":"2010","unstructured":"Milenkovi\u0107, T., Ng, W.L., Hayes, W., Pr\u017eulj, N.: Optimal network alignment with graphlet degree vectors. Cancer Inform. 9, 121\u2013137 (2010). https:\/\/doi.org\/10.4137\/CIN.S4744 . http:\/\/www.la-press.com\/optimal-network-alignment-with-graphlet-degree-vectors-article-a2141","journal-title":"Cancer Inform."},{"key":"4_CR28","series-title":"Oxford Studies in Probability","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability. Oxford University Press, Oxford (2003)"},{"key":"4_CR29","unstructured":"Petit, J., Kavelaars, J., Gladman, B., Loredo, T.: Size distribution of multikilometer transneptunian objects. In: The Solar System Beyond Neptune, pp. 71\u201387 (2008)"},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"e1000659","DOI":"10.1371\/journal.pcbi.1000659","volume":"6","author":"S Pinkert","year":"2010","unstructured":"Pinkert, S., Schultz, J., Reichardt, J.: Protein interaction networks-more than mere modules. PLoS Comput. Biol. 6(1), e1000659 (2010)","journal-title":"PLoS Comput. Biol."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"20","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 20, e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"18","key":"4_CR32","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics 20(18), 3508\u20133515 (2004). https:\/\/doi.org\/10.1093\/bioinformatics\/bth436 . http:\/\/bioinformatics.oxfordjournals.org\/content\/20\/18\/3508.abstract","journal-title":"Bioinformatics"},{"issue":"10","key":"4_CR33","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1098\/rsif.2006.0147","volume":"3","author":"N Pr\u017eulj","year":"2006","unstructured":"Pr\u017eulj, N., Higham, D.: Modelling protein-protein interaction networks via a stickiness index. J. R. Soc. Interface 3(10), 711\u2013716 (2006)","journal-title":"J. R. Soc. Interface"},{"key":"4_CR34","unstructured":"Pr\u017eulj, N., Kuchaiev, O., Stevanovi\u0107, A., Hayes, W.: Geometric evolutionary dynamics of protein interaction networks. In: Pacific Symposium on Biocomputing (2010)"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Pr\u017eulj, N., Kuchaiev, O., Stevanovi\u0107, A., Hayes, W.: Geometric evolutionary dynamics of protein interaction networks. In: Proceedings of the 2010 Pacific Symposium on Biocomputing (PSB), 4\u20138 January 2010, Big Island, Hawaii (2010)","DOI":"10.1142\/9789814295291_0020"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Pr\u017eulj, N., Milenkovi\u0107, T.: Computational methods for analyzing and modeling biological networks. In: Chen, J., Lonardi, S. (eds.) Biological Data Mining. CRC Press (2009, To appear)","DOI":"10.1201\/9781420086850.ch17"},{"issue":"2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"18","key":"4_CR38","doi-asserted-by":"publisher","first-page":"i611","DOI":"10.1093\/bioinformatics\/btq386","volume":"26","author":"T Rito","year":"2010","unstructured":"Rito, T., Wang, Z., Deane, C.M., Reinert, G.: How threshold behaviour affects the use of subgraphs for network comparison. Bioinformatics 26(18), i611\u2013i617 (2010). https:\/\/doi.org\/10.1093\/bioinformatics\/btq386","journal-title":"Bioinformatics"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1098\/rsif.2005.0072","volume":"2","author":"M Salath\u00e9","year":"2005","unstructured":"Salath\u00e9, M., May, R.M., Bonhoeffer, S.: The evolution of network topology by selective removal. R. Soc. Interface 2, 533\u2013536 (2005)","journal-title":"R. Soc. Interface"},{"issue":"1","key":"4_CR40","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S Shen-Orr","year":"2002","unstructured":"Shen-Orr, S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet. 31(1), 64\u201368 (2002)","journal-title":"Nat. Genet."},{"key":"4_CR41","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: Artificial Intelligence and Statistics, pp. 488\u2013495 (2009)"},{"issue":"6644","key":"4_CR42","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1038\/41996","volume":"388","author":"RV Sole","year":"1997","unstructured":"Sole, R.V., Manrubia, S.C., Benton, M., Bak, P.: Self-similarity of extinction statistics in the fossil record. Nature 388(6644), 764 (1997)","journal-title":"Nature"},{"issue":"1","key":"4_CR43","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1159\/000067642","volume":"1","author":"A V\u00e1zquez","year":"2003","unstructured":"V\u00e1zquez, A., Flammini, A., Maritan, A., Vespignani, A.: Modeling of protein interaction networks. Complexus 1(1), 38\u201344 (2003)","journal-title":"Complexus"},{"key":"4_CR44","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1093\/bioinformatics\/btv161","volume":"31","author":"V Vijayan","year":"2015","unstructured":"Vijayan, V., Saraph, V., Milenkovi\u0107, T.: MAGNA++: maximizing accuracy in global network alignment via both node and edge conservation. Bioinformatics 31, 2409\u20132411 (2015)","journal-title":"Bioinformatics"},{"issue":"01","key":"4_CR45","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0219633602000117","volume":"1","author":"S Vishveshwara","year":"2002","unstructured":"Vishveshwara, S., Brinda, K., Kannan, N.: Protein structure: insights from graph theory. J. Theor. Comput. Chem. 1(01), 187\u2013211 (2002)","journal-title":"J. Theor. Comput. Chem."},{"issue":"6","key":"4_CR46","doi-asserted-by":"publisher","first-page":"e107","DOI":"10.1371\/journal.pcbi.0030107","volume":"3","author":"Z Wang","year":"2007","unstructured":"Wang, Z., Zhang, J.: In search of the biological significance of modular structures in protein networks. PLoS Comput. Biol. 3(6), e107 (2007)","journal-title":"PLoS Comput. Biol."},{"key":"4_CR47","doi-asserted-by":"publisher","first-page":"4547","DOI":"10.1038\/srep04547","volume":"4","author":"N Yavero\u011flu","year":"2014","unstructured":"Yavero\u011flu, N., et al.: Revealing the hidden language of complex networks. Sci. Rep. 4, 4547 (2014)","journal-title":"Sci. Rep."},{"issue":"16","key":"4_CR48","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1093\/bioinformatics\/btv170","volume":"31","author":"\u00d6N Yavero\u011flu","year":"2015","unstructured":"Yavero\u011flu, \u00d6.N., Milenkovi\u0107, T., Pr\u017eulj, N.: Proper evaluation of alignment-free network comparison methods. Bioinformatics 31(16), 2697\u20132704 (2015)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18174-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T19:17:46Z","timestamp":1694891866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berkeley, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alcob2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One paper of an invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}