{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:55:26Z","timestamp":1775638526600,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030170820","type":"print"},{"value":"9783030170837","type":"electronic"}],"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-17083-7_1","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:02:19Z","timestamp":1555268539000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An Efficient, Scalable and Exact Representation of High-Dimensional Color Information Enabled via de Bruijn Graph Search"],"prefix":"10.1007","author":[{"given":"Fatemeh","family":"Almodaresi","sequence":"first","affiliation":[]},{"given":"Prashant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Ferdman","sequence":"additional","affiliation":[]},{"given":"Rob","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Rob","family":"Patro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1038\/ng.102810.1038\/ng.1028","volume":"44","author":"Z Iqbal","year":"2012","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet. 44, 226\u2013232 (2012). \n                    https:\/\/doi.org\/10.1038\/ng.102810.1038\/ng.1028","journal-title":"Nat. Genet."},{"issue":"17","key":"1_CR2","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. National Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. National Acad. Sci."},{"issue":"Suppl. 1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"s225","DOI":"10.1093\/bioinformatics\/17.suppl_1.S225","volume":"17","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H.: Fragment assembly with double-barreled data. Bioinformatics 17(Suppl. 1), s225\u2013s233 (2001)","journal-title":"Bioinformatics"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-05269-4_4","volume-title":"Research in Computational Molecular Biology","author":"R Chikhi","year":"2014","unstructured":"Chikhi, R., Limasset, A., Jackman, S., Simpson, J.T., Medvedev, P.: On the representation of de bruijn graphs. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 35\u201355. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-05269-4_4"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Prashant, P., Fatemeh, A., Bender, M.A., Ferdman, M., Johnson, R., Patro, R.: Mantis: a fast, small, and exact large-scale sequence-search index. Cell Syst. 7(2), 201\u2013207.e4 (2018). \n                    https:\/\/doi.org\/10.1016\/j.cels.2018.05.021","DOI":"10.1016\/j.cels.2018.05.021"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1038\/nbt.3442","volume":"34","author":"B Solomon","year":"2016","unstructured":"Solomon, B., Kingsford, C.: Fast search of thousands of short-read sequencing experiments. Nat. Biotechnol. 34(3), 300\u2013302 (2016)","journal-title":"Nat. Biotechnol."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-56970-3_16","volume-title":"Research in Computational Molecular Biology","author":"B Solomon","year":"2017","unstructured":"Solomon, B., Kingsford, C.: Improved search of large transcriptomic sequencing databases using split sequence bloom trees. In: Sahinalp, S.C. (ed.) RECOMB 2017. LNCS, vol. 10229, pp. 257\u2013271. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-56970-3_16"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-56970-3_17","volume-title":"Research in Computational Molecular Biology","author":"C Sun","year":"2017","unstructured":"Sun, C., Harris, R.S., Chikhi, R., Medvedev, P.: AllSome sequence bloom trees. In: Sahinalp, S.C. (ed.) RECOMB 2017. LNCS, vol. 10229, pp. 272\u2013286. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-56970-3_17"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bradley, P., den Bakker, H., Rocha, E., McVean, G., Iqbal, Z.: Real-time search of all bacterial and viral genomic data. BioRxiv, p. 234955 (2017)","DOI":"10.1101\/234955"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1093\/bioinformatics\/btx067","volume":"33","author":"MD Muggli","year":"2017","unstructured":"Muggli, M.D., et al.: Succinct colored de bruijn graphs. Bioinformatics 33, 3181\u20133187 (2017)","journal-title":"Bioinformatics"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/s13015-016-0066-8","volume":"11","author":"G Holley","year":"2016","unstructured":"Holley, G., Wittler, R., Stoye, J.: Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms Mol. Biol. 11(1), 3 (2016)","journal-title":"Algorithms Mol. Biol."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Almodaresi, F., Pandey, P., Patro, R.: Rainbowfish: a succinct colored de Bruijn graph representation. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 88. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)","DOI":"10.1101\/138016"},{"issue":"21","key":"1_CR13","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1093\/bioinformatics\/btw371","volume":"32","author":"B Liu","year":"2016","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 (2016a)","journal-title":"Bioinformatics"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-33122-0_19","volume-title":"Algorithms in Bioinformatics","author":"R Chikhi","year":"2012","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de bruijn graph representation based on a bloom filter. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 236\u2013248. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33122-0_19"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1748-7188-9-2","volume":"9","author":"K Salikhov","year":"2014","unstructured":"Salikhov, K., Sacomoto, G., Kucherov, G.: Using cascading bloom filters to improve the memory usage for de brujin graphs. Algorithms Mol. Biol. 9(1), 2 (2014)","journal-title":"Algorithms Mol. Biol."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-33122-0_18","volume-title":"Algorithms in Bioinformatics","author":"A Bowe","year":"2012","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de bruijn graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 225\u2013235. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33122-0_18"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"4189","DOI":"10.1093\/bioinformatics\/bty500","volume":"34","author":"V Crawford","year":"2018","unstructured":"Crawford, V., Kuhnle, A., Boucher, C., Chikhi, R., Gagie, T., Hancock, J.: Practical dynamic de bruijn graphs. Bioinformatics 34, 4189\u20134195 (2018)","journal-title":"Bioinformatics"},{"issue":"14","key":"1_CR18","doi-asserted-by":"publisher","first-page":"i133","DOI":"10.1093\/bioinformatics\/btx261","volume":"33","author":"P Pandey","year":"2017","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: deBGR: an efficient and near-exact representation of the weighted de bruijn graph. Bioinformatics 33(14), i133\u2013i141 (2017)","journal-title":"Bioinformatics"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Mustafa, H., Schilken, I., Karasikov, M., Eickhoff, C., R\u00e4tsch, G., Kahles, A.: Dynamic compression schemes for graph coloring. Bioinformatics, p. bty632 (2018). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/bty632","DOI":"10.1093\/bioinformatics\/bty632"},{"key":"1_CR20","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm (1994)"},{"key":"1_CR21","unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242. Society for Industrial and Applied Mathematics (2002)"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM (JACM) 21(2), 246\u2013260 (1974)","journal-title":"J. ACM (JACM)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Raidl, G.R.: Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem. Ph.D. thesis (2008)","DOI":"10.1063\/1.2990958"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Althaus, E., Funke, S., Har-Peled, S., K\u00f6nemann, J., Ramos, E.A., Skutella, M.: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2):115\u2013120 (2005). \n                    https:\/\/doi.org\/10.1016\/j.orl.2004.05.005\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637704000719\n                    \n                  . ISSN 0167\u20136377","DOI":"10.1016\/j.orl.2004.05.005"},{"key":"1_CR25","unstructured":"Manyem, P., Stallmann, M.F.M.: Some approximation results in multicasting. Technical report, Raleigh, NC, USA (1996)"},{"key":"1_CR26","unstructured":"Khuller, S., Raghavachari, B., Young, N.E.: Balancing minimum spanning and shortest path trees. CoRR, cs.DS\/0205045 (2002). \n                    http:\/\/arxiv.org\/abs\/cs.DS\/0205045"},{"key":"1_CR27","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. CoRR, cs.CC\/9809103 (1998). \n                    http:\/\/arxiv.org\/abs\/cs.CC\/9809103"},{"issue":"6","key":"1_CR28","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"JT Simpson","year":"2009","unstructured":"Simpson, J.T., Wong, K., Jackman, S.D., Schein, J.E., Jones, S.J.M., Birol, I.: ABySS: a parallel assembler for short read sequence data. Genome Res. 19(6), 1117\u20131123 (2009)","journal-title":"Genome Res."},{"issue":"8","key":"1_CR29","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1093\/bioinformatics\/bts094","volume":"28","author":"MH Schulz","year":"2012","unstructured":"Schulz, M.H., Zerbino, D.R., Vingron, M., Birney, E.: Oases: robust de novo RNA-seq assembly across the dynamic range of expression levels. Bioinformatics 28(8), 1086\u20131092 (2012)","journal-title":"Bioinformatics"},{"issue":"5","key":"1_CR30","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"DR Zerbino","year":"2008","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)","journal-title":"Genome Res."},{"issue":"7","key":"1_CR31","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1038\/nbt.1883","volume":"29","author":"MG Grabherr","year":"2011","unstructured":"Grabherr, M.G., et al.: Full-length transcriptome assembly from RNA-seq data without a reference genome. Nature Biotechnol. 29(7), 644\u2013652 (2011)","journal-title":"Nature Biotechnol."},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1186\/s13059-015-0596-2","volume":"16","author":"Z Chang","year":"2015","unstructured":"Chang, Z., et al.: Bridger: a new framework for de novo transcriptome assembly using RNA-seq data. Genome Biol. 16(1), 30 (2015)","journal-title":"Genome Biol."},{"issue":"2","key":"1_CR33","doi-asserted-by":"publisher","first-page":"e1004772","DOI":"10.1371\/journal.pcbi.1004772","volume":"12","author":"J Liu","year":"2016","unstructured":"Liu, J., et al.: Binpacker: packing-based de novo transcriptome assembly from RNA-seq data. PLOS Comput. Biol. 12(2), e1004772 (2016b)","journal-title":"PLOS Comput. Biol."},{"issue":"13","key":"1_CR34","doi-asserted-by":"publisher","first-page":"i169","DOI":"10.1093\/bioinformatics\/bty292","volume":"34","author":"F Almodaresi","year":"2018","unstructured":"Almodaresi, F., Sarkar, H., Srivastava, A., Patro, R.: A space and time-efficient index for the compacted colored de Bruijn graph. Bioinformatics 34(13), i169\u2013i177 (2018)","journal-title":"Bioinformatics"},{"issue":"15","key":"1_CR35","doi-asserted-by":"publisher","first-page":"2556","DOI":"10.1093\/bioinformatics\/bty157","volume":"34","author":"I Turner","year":"2018","unstructured":"Turner, I., Garimella, K.V., Iqbal, Z., McVean, G.: Integrating long-range connectivity information into de Bruijn graphs. Bioinformatics 34(15), 2556\u20132565 (2018). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/bty157","journal-title":"Bioinformatics"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Alipanahi, B., Muggli, M.D., Jundi, M., Noyes, N., Boucher, C.: Resistome SNP calling via read colored de Bruijn graphs. bioRxiv, p. 156174 (2018)","DOI":"10.1101\/156174"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-00479-8_1","volume-title":"String Processing and Information Retrieval","author":"B Alipanahi","year":"2018","unstructured":"Alipanahi, B., Kuhnle, A., Boucher, C.: Recoloring the colored de Bruijn graph. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 1\u201311. Springer, Cham (2018b). \n                    https:\/\/doi.org\/10.1007\/978-3-030-00479-8_1"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: A general-purpose counting filter: making every bit count. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 775\u2013787. ACM (2017)","DOI":"10.1145\/3035918.3035963"},{"issue":"1","key":"1_CR39","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1186\/s13059-018-1535-9","volume":"19","author":"Y Yu","year":"2018","unstructured":"Yu, Y., et al.: SeqOthello: querying RNA-seq experiments at scale. Genome Biol. 19(1), 167 (2018). \n                    https:\/\/doi.org\/10.1186\/s13059-018-1535-9\n                    \n                  . ISSN 1474\u2013760X","journal-title":"Genome Biol."},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Venturini, R.: Partitioned Elias-Fano Indexes. In: Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 273\u2013282. ACM (2014)","DOI":"10.1145\/2600428.2609615"},{"issue":"3","key":"1_CR41","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1_CR42","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","volume":"16","author":"A Bookstein","year":"1991","unstructured":"Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inf. Syst. 16(4), 387\u2013400 (1991)","journal-title":"Inf. Syst."},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: Squeakr: an exact and approximate k-mer counting system. Bioinformatics, btx636 (2017). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btx636","DOI":"10.1093\/bioinformatics\/btx636"},{"key":"1_CR44","unstructured":"NIH. SRA (2017). \n                    https:\/\/www.ebi.ac.uk\/ena\/browse\n                    \n                  . Accessed 06 Nov 2017"},{"key":"1_CR45","unstructured":"O\u2019Leary, N.A., et al.: Reference sequence (RefSeq) database at NCBI: current status, taxonomic expansion, and functional annotation. Nucleic Acids Res. gkv1189 (2015)"},{"issue":"2","key":"1_CR46","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.cels.2015.08.004","volume":"1","author":"YW Yu","year":"2015","unstructured":"Yu, Y.W., Daniels, N.M., Danko, D.C., Berger, B.: Entropy-scaling search of massive biological data. Cell systems 1(2), 130\u2013140 (2015)","journal-title":"Cell systems"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17083-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:15:49Z","timestamp":1558343749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17083-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030170820","9783030170837"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17083-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 April 2019","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":"Washington, DC","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":"5 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2019.org\/","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":"175","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10% - 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":"7","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"}}]}}