{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:35:55Z","timestamp":1743006955867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_1","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Problems Related to the Space of Optimal Tree Reconciliations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4099-1836","authenticated-orcid":false,"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9797-7592","authenticated-orcid":false,"given":"Blerina","family":"Sinaimeri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-00727-9_13","volume-title":"Bioinformatics and Computational Biology","author":"MS Bansal","year":"2009","unstructured":"Bansal, M.S., Chang, W.-C., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Generalized binary tanglegrams: algorithms and applications. In: Rajasekaran, S. (ed.) BICoB 2009. LNCS, vol. 5462, pp. 114\u2013125. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00727-9_13"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1111\/1755-0998.12897","volume":"18","author":"V Berry","year":"2018","unstructured":"Berry, V., Chevenet, F., Doyon, J.P., Jousselin, E.: A geography-aware reconciliation method to investigate diversification patterns in host\/parasite interactions. Mol. Ecol. Resour. 18(5), 1173\u20131184 (2018). https:\/\/doi.org\/10.1111\/1755-0998.12897","journal-title":"Mol. Ecol. Resour."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-11269-0_3","volume-title":"Parameterized and Exact Computation","author":"S B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., H\u00fcffner, F., Truss, A., Wahlstr\u00f6m, M.: A faster fixed-parameter approach to drawing binary tanglegrams. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 38\u201349. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_3"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1111\/j.1365-2699.2005.01315.x","volume":"32","author":"DR Brooks","year":"2005","unstructured":"Brooks, D.R., Ferrao, A.L.: The historical biogeography of co-evolution: emerging infectious diseases are evolutionary accidents waiting to happen. J. Biogeogr. 32, 1291\u20131299 (2005)","journal-title":"J. Biogeogr."},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-010-9456-3","volume":"62","author":"K Buchin","year":"2012","unstructured":"Buchin, K., et al.: Drawing (complete) binary tanglegrams. Algorithmica 62(1\u20132), 309\u2013332 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9456-3","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s00285-019-01385-w","volume":"79","author":"T Calamoneri","year":"2019","unstructured":"Calamoneri, T., Monti, A., Sinaimeri, B.: Co-divergence and tree topology. J. Math. Biol. 79(3), 1149\u20131167 (2019). https:\/\/doi.org\/10.1007\/s00285-019-01385-w","journal-title":"J. Math. Biol."},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Calamoneri, T., Tavernelli, D., Vocca, P.: Linear time reconciliation with bounded transfers of genes. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2020). https:\/\/doi.org\/10.1109\/TCBB.2020.3027207. https:\/\/ieeexplore.ieee.org\/document\/9207859","DOI":"10.1109\/TCBB.2020.3027207"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2019.12.024","volume":"815","author":"T Calamoneri","year":"2020","unstructured":"Calamoneri, T., Donato, V.D., Mariottini, D., Patrignani, M.: Visualizing co-phylogenetic reconciliations. Theoret. Comput. Sci. 815, 228\u2013245 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.12.024","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0025-5564(97)10012-8","volume":"149","author":"M Charleston","year":"1998","unstructured":"Charleston, M.: Jungles: a new solution to the host\/parasite phylogeny reconciliation problem. Math. Biosci. 149, 191\u2013223 (1998)","journal-title":"Math. Biosci."},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1093\/bioinformatics\/btv625","volume":"32","author":"F Chevenet","year":"2016","unstructured":"Chevenet, F., Doyon, J.P., Scornavacca, C., Jacox, E., Jousselin, E., Berry, V.: SylvX: a viewer for phylogenetic tree reconciliations. Bioinformatics 32(4), 608\u2013610 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btv625","journal-title":"Bioinformatics"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Donati, B., Baudet, C., Sinaimeri, B., Crescenzi, P., Sagot, M.F.: EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10(3), 1\u201311 (2015). https:\/\/doi.org\/10.1186\/s13015-014-0031-3","DOI":"10.1186\/s13015-014-0031-3"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-030-14160-8_2","volume-title":"Computational Intelligence Methods for Bioinformatics and Biostatistics","author":"M Gastaldello","year":"2019","unstructured":"Gastaldello, M., Calamoneri, T., Sagot, M.-F.: Extracting few representative reconciliations with host switches. In: Bartoletti, M., et al. (eds.) CIBB 2017. LNCS, vol. 10834, pp. 9\u201318. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14160-8_2"},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1109\/TCBB.2019.2942015","volume":"18","author":"M Grueter","year":"2019","unstructured":"Grueter, M., Duran, K., Ramalingam, R., Libeskind-Hadas, R.: Reconciliation reconsidered: in search of a most representative reconciliation in the duplication-transfer-loss model. IEEE\/ACM Trans. Comput. Biol. Bioinform. 18(6), 2136\u20132143 (2019). https:\/\/doi.org\/10.1109\/TCBB.2019.2942015","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TCBB.2018.2849732","volume":"16","author":"J Haack","year":"2019","unstructured":"Haack, J., Zupke, E., Ramirez, A., Wu, Y.C., Libeskind-Hadas, R.: Computing the diameter of the space of maximum parsimony reconciliations in the duplication-transfer-loss model. IEEE\/ACM Trans. Comput. Biol. Bioinf. 16(1), 14\u201322 (2019). https:\/\/doi.org\/10.1109\/TCBB.2018.2849732","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hallett, M.T., Lagergren, J.: Efficient algorithms for lateral gene transfer problems. In: Proceedings of the Fifth Annual International Conference on Computational Biology (RECOMB 2001), pp. 149\u2013156 (2001)","DOI":"10.1145\/369133.369188"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1093\/sysbio\/syy075","volume":"68","author":"KT Huber","year":"2018","unstructured":"Huber, K.T., Moulton, V., Sagot, M.F., Sinaimeri, B.: Exploring and visualizing spaces of tree reconciliations. Syst. Biol. 68(4), 607\u2013618 (2018). https:\/\/doi.org\/10.1093\/sysbio\/syy075","journal-title":"Syst. Biol."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2018.04.001","volume":"136","author":"KT Huber","year":"2018","unstructured":"Huber, K.T., Moulton, V., Sagot, M., Sinaimeri, B.: Geometric medians in reconciliation spaces of phylogenetic trees. Inf. Process. Lett. 136, 96\u2013101 (2018). https:\/\/doi.org\/10.1016\/j.ipl.2018.04.001","journal-title":"Inf. Process. Lett."},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw105","author":"E Jacox","year":"2016","unstructured":"Jacox, E., Chauve, C., Sz\u00f6ll\u0151si, G.J., Ponty, Y., Scornavacca, C.: ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btw105","journal-title":"Bioinformatics"},{"key":"1_CR19","unstructured":"Libeskind-Hadas, R.: Jane 4 - a software tool for the cophylogeny reconstruction problem. https:\/\/www.cs.hmc.edu\/~hadas\/jane\/"},{"issue":"Suppl. 1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-11-S1-S60","volume":"11","author":"D Merkle","year":"2010","unstructured":"Merkle, D., Middendorf, M., Wieseke, N.: A parameter-adaptive dynamic programming approach for inferring cophylogenies. BMC Bioinformatics 11(Suppl. 1), 1\u201310 (2010). https:\/\/doi.org\/10.1186\/1471-2105-11-S1-S60","journal-title":"BMC Bioinformatics"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28, 283\u2013291 (2012). https:\/\/doi.org\/10.1093\/bioinformatics\/bts225","journal-title":"Bioinformatics"},{"issue":"10","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0073667","volume":"8","author":"TH Nguyen","year":"2013","unstructured":"Nguyen, T.H., Ranwez, V., Berry, V., Scornavacca, C.: Support measures to estimate the reliability of evolutionary events predicted by reconciliation methods. PLoS ONE 8(10), 1\u201314 (2013). https:\/\/doi.org\/10.1371\/journal.pone.0073667","journal-title":"PLoS ONE"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"N\u00f6llenburg, M., V\u00f6lker, M., Wolff, A., Holten, D.: Drawing binary tanglegrams: an experimental evaluation. In: Finocchi, I., Hershberger, J. (eds.) ALENEX 2009, pp. 106\u2013119. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9781611972894.11","DOI":"10.1137\/1.9781611972894.11"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1089\/cmb.2009.0240","volume":"18","author":"YJ Ovadia","year":"2011","unstructured":"Ovadia, Y.J., Fielder, D., Conow, C., Libeskind-Hadas, R.: The cophylogeny reconstruction problem is np-complete. J. Comput. Biol. 18(1), 59\u201365 (2011). https:\/\/doi.org\/10.1089\/cmb.2009.0240","journal-title":"J. Comput. Biol."},{"key":"1_CR25","first-page":"58","volume":"43","author":"RDM Page","year":"1994","unstructured":"Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Syst. Biol. 43, 58\u201377 (1994)","journal-title":"Syst. Biol."},{"key":"1_CR26","unstructured":"Ronquist, F.: Parsimony analysis of coevolving species associations. In: Tangled Trees: Phylogeny, Cospeciation, and Coevolution (2002)"},{"key":"1_CR27","first-page":"159","volume":"27","author":"DE Rosen","year":"1978","unstructured":"Rosen, D.E.: Vicariant patterns and historical explanation in biogeography. Syst. Biol. 27, 159\u2013188 (1978)","journal-title":"Syst. Biol."},{"issue":"20","key":"1_CR28","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1186\/s12859-019-3203-9","volume":"20","author":"S Santichaivekin","year":"2019","unstructured":"Santichaivekin, S., Mawhorter, R., Libeskind-Hadas, R.: An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. BMC Bioinformatics 20(20), 636 (2019). https:\/\/doi.org\/10.1186\/s12859-019-3203-9","journal-title":"BMC Bioinformatics"},{"issue":"16","key":"1_CR29","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1093\/bioinformatics\/btaa978","volume":"37","author":"S Santichaivekin","year":"2020","unstructured":"Santichaivekin, S., et al.: eMPRess: a systematic cophylogeny reconciliation tool. Bioinformatics 37(16), 2481\u20132482 (2020). https:\/\/doi.org\/10.1093\/bioinformatics\/btaa978","journal-title":"Bioinformatics"},{"issue":"6","key":"1_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MCG.2011.103","volume":"31","author":"HJ Schulz","year":"2011","unstructured":"Schulz, H.J.: Treevis.net: a tree visualization reference. IEEE Comput. Graphics Appl. 31(6), 11\u201315 (2011). https:\/\/doi.org\/10.1109\/MCG.2011.103","journal-title":"IEEE Comput. Graphics Appl."},{"issue":"27","key":"1_CR31","doi-asserted-by":"publisher","first-page":"i248","DOI":"10.1093\/bioinformatics\/btr210","volume":"13","author":"C Scornavacca","year":"2011","unstructured":"Scornavacca, C., Zickmann, F., Huson, D.H.: Tanglegrams for rooted phylogenetic trees and networks. Bioinformatics 13(27), i248\u2013i256 (2011). https:\/\/doi.org\/10.1093\/bioinformatics\/btr210","journal-title":"Bioinformatics"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1186\/1471-2105-8-148","volume":"8","author":"B Sennblad","year":"2007","unstructured":"Sennblad, B., Schreil, E., Sonnhammer, A.C.B., Lagergren, J., Arvestad, L.: primetv: a viewer for reconciled trees. BMC Bioinformatics 8(1), 148 (2007)","journal-title":"BMC Bioinformatics"},{"issue":"18","key":"1_CR33","doi-asserted-by":"publisher","first-page":"i409","DOI":"10.1093\/bioinformatics\/bts386","volume":"28","author":"M Stolzer","year":"2012","unstructured":"Stolzer, M., Lai, H., Xu, M., Sathaye, D., Vernot, B., Durand, D.: Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinformatics 28(18), i409\u2013i415 (2012). https:\/\/doi.org\/10.1093\/bioinformatics\/bts386","journal-title":"Bioinformatics"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh, A., Hallett, M., Lagergren, J.: Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans. Comput. Biol. Bioinf. 8(2), 517\u2013535 (2011). https:\/\/doi.org\/10.1109\/TCBB.2010.14","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-50106-2_15","volume-title":"Graph Drawing and Network Visualization","author":"IG Tollis","year":"2016","unstructured":"Tollis, I.G., Kakoulis, K.G.: Algorithms for visualizing phylogenetic networks. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 183\u2013195. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_15"},{"issue":"14","key":"1_CR36","doi-asserted-by":"publisher","first-page":"4197","DOI":"10.1093\/bioinformatics\/btaa498","volume":"36","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Mary, A., Sagot, M., Sinaimeri, B.: Capybara: equivalence class enumeration of cophylogeny event-based reconciliations. Bioinformatics 36(14), 4197\u20134199 (2020). https:\/\/doi.org\/10.1093\/bioinformatics\/btaa498","journal-title":"Bioinformatics"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Wang, Y., Mary, A., Sagot, M., Sinaimeri, B.: Making sense of a cophylogeny output: efficient listing of representative reconciliations. In: 21st International Workshop on Algorithms in Bioinformatics, WABI 2021, 2\u20134 August 2021, Virtual Conference, pp. 3:1\u20133:18 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2021.3","DOI":"10.4230\/LIPIcs.WABI.2021.3"},{"issue":"6","key":"1_CR38","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1109\/TCBB.2015.2430336","volume":"12","author":"N Wieseke","year":"2015","unstructured":"Wieseke, N., Hartmann, T., Bernt, M., Middendorf, M.: Cophylogenetic reconciliation with ILP. IEEE\/ACM Trans. Comput. Biol. Bioinform. 12(6), 1227\u20131235 (2015). https:\/\/doi.org\/10.1109\/TCBB.2015.2430336","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Zhao, P., Liu, F., Li, Y.M., Cai, L.: Inferring phylogeny and speciation of Gymnosporangium species, and their coevolution with host plants. Sci. Rep. 6, Article No. 29339 (2016). https:\/\/doi.org\/10.1038\/srep29339","DOI":"10.1038\/srep29339"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:04Z","timestamp":1647389044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_1"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}