{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:46:19Z","timestamp":1747291579073,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031047480"},{"type":"electronic","value":"9783031047497"}],"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-031-04749-7_16","type":"book-chapter","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:13:24Z","timestamp":1652285604000},"page":"263-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Complexity of\u00a0Approximate Pattern Matching on\u00a0de Bruijn Graphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gibney","sequence":"first","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Backurs, A., Hansen, T.D., Williams, V.V., Zamir, O.: Subtree isomorphism revisited. ACM Trans. Algorithms 14(3), 27:1\u201427:23 (2018). https:\/\/doi.org\/10.1145\/3093239","DOI":"10.1145\/3093239"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.R.: Generalized string matching. SIAM J. Comput. 16(6), 1039\u20131051 (1987). https:\/\/doi.org\/10.1137\/0216067","DOI":"10.1137\/0216067"},{"key":"16_CR3","unstructured":"Alanko, J., D\u2019Agostino, G., Policriti, A., Prezza, N.: Wheeler languages. CoRR abs\/2002.10303 (2020). https:\/\/arxiv.org\/abs\/2002.10303"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Alanko, J.N., Gagie, T., Navarro, G., Benkner, L.S.: Tunneling on wheeler graphs. In: Data Compression Conference, DCC 2019, Snowbird, UT, USA, 26\u201329 March 2019. pp. 122\u2013131 (2019). https:\/\/doi.org\/10.1109\/DCC.2019.00020","DOI":"10.1109\/DCC.2019.00020"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Almodaresi, F., Sarkar, H., Srivastava, A., Patro, R.: A space and time-efficient index for the compacted colored de Bruijn graph. Bioinform 34(13), i169\u2013i177 (2018). https:\/\/doi.org\/10.1093\/bioinformatics\/bty292","DOI":"10.1093\/bioinformatics\/bty292"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Amir, A., Lewenstein, M., Lewenstein, N.: Pattern matching in hypertext. J. Algorithms 35(1), 82\u201399 (2000). https:\/\/doi.org\/10.1006\/jagm.1999.1063","DOI":"10.1006\/jagm.1999.1063"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Which regular expression patterns are hard to match? In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, pp. 457\u2013466. Hyatt Regency, New Brunswick (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.56","DOI":"10.1109\/FOCS.2016.56"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Benoit, G., et al.: Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph. BMC Bioinform. 16, 288:1\u2013288:14 (2015). https:\/\/doi.org\/10.1186\/s12859-015-0709-7","DOI":"10.1186\/s12859-015-0709-7"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Chikhi, R., Limasset, A., Jackman, S., Simpson, J.T., Medvedev, P.: On the representation of de Bruijn graphs. J. Comput. Biol. 22(5), 336\u2013352 (2015). https:\/\/doi.org\/10.1089\/cmb.2014.0160","DOI":"10.1089\/cmb.2014.0160"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de Bruijn graph representation based on a bloom filter. Algorithms Mol. Biol. 8, 22 (2013). https:\/\/doi.org\/10.1186\/1748-7188-8-22","DOI":"10.1186\/1748-7188-8-22"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Dondi, R., Mauri, G., Zoppis, I.: Complexity issues of string to graph approximate matching. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 248\u2013259. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_17","DOI":"10.1007\/978-3-030-40608-0_17"},{"key":"16_CR12","unstructured":"Egidi, L., Louza, F.A., Manzini, G.: Space efficient merging of de Bruijn graphs and wheeler graphs. CoRR abs\/2009.03675 (2020). https:\/\/arxiv.org\/abs\/2009.03675"},{"key":"16_CR13","unstructured":"Equi, M., Grossi, R., M\u00e4kinen, V., Tomescu, A.I.: On the complexity of string matching for graphs. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, 9\u201312 July 2019, Patras, Greece. pp. 55:1\u201355:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.55"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Flick, P., Jain, C., Pan, T., Aluru, S.: Reprint of \u201ca parallel connectivity algorithm for de Bruijn graphs in metagenomic applications\u201d. Parallel Comput. 70, 54\u201365 (2017). https:\/\/doi.org\/10.1016\/j.parco.2017.09.002","DOI":"10.1016\/j.parco.2017.09.002"},{"key":"16_CR15","unstructured":"Gagie, T.: $$r$$-indexing wheeler graphs. CoRR abs\/2101.12341 (2021). https:\/\/arxiv.org\/abs\/2101.12341"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Gagie, T., Manzini, G., Sir\u00e9n, J.: Wheeler graphs: a framework for BWT-based data structures. Theor. Comput. Sci. 698, 67\u201378 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.06.016","DOI":"10.1016\/j.tcs.2017.06.016"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Georganas, E., Bulu\u00e7, A., Chapman, J., Oliker, L., Rokhsar, D., Yelick, K.A.: Parallel de Bruijn graph construction and traversal for de novo genome assembly. In: International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2014, New Orleans, LA, USA, 16\u201321 November 2014. pp. 437\u2013448 (2014). https:\/\/doi.org\/10.1109\/SC.2014.41","DOI":"10.1109\/SC.2014.41"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-59212-7_6","volume-title":"String Processing and Information Retrieval","author":"D Gibney","year":"2020","unstructured":"Gibney, D.: An efficient elastic-degenerate text index? not likely. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 76\u201388. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_6"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Gibney, D., Hoppenworth, G., Thankachan, S.V.: Simple reductions from formula-sat to pattern matching on labeled graphs and subtree isomorphism. In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, 11\u201312 January 2021. pp. 232\u2013242 (2021). https:\/\/doi.org\/10.1137\/1.9781611976496.26","DOI":"10.1137\/1.9781611976472.26"},{"key":"16_CR20","unstructured":"Gibney, D., Thankachan, S.V.: On the hardness and inapproximability of recognizing wheeler graphs. In: 27th Annual European Symposium on Algorithms, ESA 2019, 9\u201311 September 2019, Munich\/Garching, Germany. pp. 51:1\u201351:16 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.51"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Gibney, D., Thankachan, S.V., Aluru, S.: The complexity of approximate pattern matching on de Bruijn graphs (2022)","DOI":"10.1007\/978-3-031-04749-7_16"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Heydari, M., Miclotte, G., de Peer, Y.V., Fostier, J.: Browniealigner: accurate alignment of illumina sequencing data to de Bruijn graphs. BMC Bioinform. 19(1), 311:1\u2013311:10 (2018). https:\/\/doi.org\/10.1186\/s12859-018-2319-7","DOI":"10.1186\/s12859-018-2319-7"},{"key":"16_CR23","unstructured":"Holley, G., Peterlongo, P.: Blastgraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs. In: PSC 2012 (2012)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Holley, G., Wittler, R., Stoye, J., Hach, F.: Dynamic alignment-free and reference-free read compression. J. Comput. Biol. 25(7), 825\u2013836 (2018). https:\/\/doi.org\/10.1089\/cmb.2018.0068","DOI":"10.1089\/cmb.2018.0068"},{"key":"16_CR25","unstructured":"Hoppenworth, G., Bentley, J.W., Gibney, D., Thankachan, S.V.: The fine-grained complexity of median and center string problems under edit distance. In: 28th Annual European Symposium on Algorithms, ESA 2020, 7\u20139 September 2020, Pisa, Italy (Virtual Conference). pp. 61:1\u201361:19 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.61"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-17083-7_6","volume-title":"Research in Computational Molecular Biology","author":"C Jain","year":"2019","unstructured":"Jain, C., Zhang, H., Gao, Yu., Aluru, S.: On the complexity of sequence to graph alignment. In: Cowen, L.J. (ed.) RECOMB 2019. LNCS, vol. 11467, pp. 85\u2013100. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17083-7_6"},{"issue":"1","key":"16_CR27","first-page":"59","volume":"9","author":"MS Kamal","year":"2017","unstructured":"Kamal, M.S., Parvin, S., Ashour, A.S., Shi, F., Dey, N.: De-Bruijn graph with MapReduce framework towards metagenomic data classification. Int. J. Inf. Technol. 9(1), 59\u201375 (2017)","journal-title":"Int. J. Inf. Technol."},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-40453-5_6","volume-title":"Algorithms in Bioinformatics","author":"E Kapun","year":"2013","unstructured":"Kapun, E., Tsarev, F.: On NP-hardness of the paired de Bruijn sound cycle problem. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 59\u201369. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40453-5_6"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Kavya, V.N.S., Tayal, K., Srinivasan, R., Sivadasan, N.: Sequence alignment on directed graphs. J. Comput. Biol. 26(1), 53\u201367 (2019). https:\/\/doi.org\/10.1089\/cmb.2017.0264","DOI":"10.1089\/cmb.2017.0264"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Li, D., Liu, C., Luo, R., Sadakane, K., Lam, T.W.: MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph. Bioinformatics 31(10), 1674\u20131676 (2015). https:\/\/doi.org\/10.1093\/bioinformatics\/btv033","DOI":"10.1093\/bioinformatics\/btv033"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Limasset, A., Cazaux, B., Rivals, E., Peterlongo, P.: Read mapping on de Bruijn graphs. BMC Bioinform. 17, 237 (2016). https:\/\/doi.org\/10.1186\/s12859-016-1103-9","DOI":"10.1186\/s12859-016-1103-9"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Limasset, A., Flot, J., Peterlongo, P.: Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. Bioinformatics 36(2), 651 (2020). https:\/\/doi.org\/10.1093\/bioinformatics\/btz548","DOI":"10.1093\/bioinformatics\/btz548"},{"key":"16_CR33","unstructured":"Lin, Y., Shen, M.W., Yuan, J., Chaisson, M., Pevzner, P.A.: Assembly of long error-prone reads using de Bruijn graphs. In: Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, RECOMB 2016, Santa Monica, CA, USA, 17\u201321 April 2016, p. 265 (2016). https:\/\/link.springer.com\/content\/pdf\/bbm%3A978-3-319-31957-5%2F1.pdf"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Liu, B., Guo, H., Brudno, M., Wang, Y.: deBGA: read alignment with de Bruijn graph-based seed and extension. Bioinformatics 32(21), 3224\u20133232 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btw371","DOI":"10.1093\/bioinformatics\/btw371"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Morisse, P., Lecroq, T., Lefebvre, A.: Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph. Bioinformatics 34(24), 4213\u20134222 (2018). https:\/\/doi.org\/10.1093\/bioinformatics\/bty521","DOI":"10.1093\/bioinformatics\/bty521"},{"key":"16_CR36","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Improved approximate pattern matching on hypertext. Theor. Comput. Sci. 237(1\u20132), 455\u2013463 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00333-3","DOI":"10.1016\/S0304-3975(99)00333-3"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Pell, J., Hintze, A., Canino-Koning, R., Howe, A., Tiedje, J.M., Brown, C.T.: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Natl. Acad. Sci. USA 109(33), 13272\u201313277 (2012). https:\/\/doi.org\/10.1073\/pnas.1121464109","DOI":"10.1073\/pnas.1121464109"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S., Chin, F.Y.L.: IDBA - a practical iterative de Bruijn graph de novo assembler. In: Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2010, Lisbon, Portugal, 25\u201328 April 2010. pp. 426\u2013440 (2010). https:\/\/doi.org\/10.1007\/978-3-642-12683-3_28","DOI":"10.1007\/978-3-642-12683-3_28"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S., Lv, M., Zhu, X., Chin, F.Y.L.: IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels. Bioinformatics 29(13), 326\u2013334 (2013). https:\/\/doi.org\/10.1093\/bioinformatics\/btt219","DOI":"10.1093\/bioinformatics\/btt219"},{"issue":"1","key":"16_CR40","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"PA Pevzner","year":"1989","unstructured":"Pevzner, P.A.: 1-tuple DNA sequencing: computer analysis. J. Biomol. Struc. Dyn. 7(1), 63\u201373 (1989)","journal-title":"J. Biomol. Struc. Dyn."},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Plesn\u00edk, J.: The np-completeness of the hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett. 8(4), 199\u2013201 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90023-1","DOI":"10.1016\/0020-0190(79)90023-1"},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Rautiainen, M., Marschall, T.: Aligning sequences to general graphs in o (v+ me) time. bioRxiv p. 216127 (2017)","DOI":"10.1101\/216127"},{"issue":"12","key":"16_CR43","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0051188","volume":"7","author":"X Ren","year":"2012","unstructured":"Ren, X., et al.: Evaluating de Bruijn graph assemblers on 454 transcriptomic data. PLoS ONE 7(12), e51188 (2012)","journal-title":"PLoS ONE"},{"key":"16_CR44","unstructured":"Williams, V.V.: Hardness of easy problems: basing hardness on popular conjectures such as the strong exponential time hypothesis (invited talk). In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 16\u201318 September 2015, Patras, Greece. pp. 17\u201329 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2015.17"},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"Ye, Y., Tang, H.: Utilizing de Bruijn graph of metagenome assembly for metatranscriptome analysis. Bioinformatics 32(7), 1001\u20131008 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btv510","DOI":"10.1093\/bioinformatics\/btv510"},{"key":"16_CR46","doi-asserted-by":"crossref","unstructured":"Zerbino, D.R., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18(5), 821\u2013829 (2008)","DOI":"10.1101\/gr.074492.107"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04749-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T23:06:12Z","timestamp":1652310372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04749-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031047480","9783031047497"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04749-7_16","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":"29 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Diego, 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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2022.net\/","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":"188","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":"17","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":"23","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":"9% - 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.2","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":"6.5","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)"}}]}}