{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:01:15Z","timestamp":1743112875561,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_6","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"79-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tandem Duplications, Segmental Duplications and Deletions, and Their Applications"],"prefix":"10.1007","author":[{"given":"Binhai","family":"Zhu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"12","key":"6_CR1","doi-asserted-by":"publisher","first-page":"7793","DOI":"10.1109\/TIT.2017.2730864","volume":"63","author":"N Alon","year":"2017","unstructured":"Alon, N., Bruck, J., Hassanzadeh, F.F., Jain, S.: Duplication distance to the root for binary sequences. IEEE Trans. Inf. Theory 63(12), 7793\u20137803 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13(1), 19\u201353 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR3","unstructured":"Benson, G., Dong, L.: Reconstructing the duplication history of a tandem repeat. In: Proceedings of ISMB 1999, pp. 44\u201353 (1999)"},{"key":"6_CR4","unstructured":"Bovet, D.P., Varricchio, S.: On the regularity of languages on a binary alphabet generated by copying systems. Inf. Process. Lett. 44(3), 119\u2013123 (1992)"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transposition is difficult. SIAM J. Discrete Math. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1038\/nature10166","volume":"474","author":"The Cancer Genome Atlas Research Network","year":"2011","unstructured":"The Cancer Genome Atlas Research Network: Integrated genomic analyses of ovarian carcinoma. Nature 474, 609\u2013615 (2011)","journal-title":"Nature"},{"issue":"6494","key":"6_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1038\/371215a0","volume":"371","author":"B Charlesworth","year":"1994","unstructured":"Charlesworth, B., Sniegowski, P., Stephan, W.: The evolutionary dynamics of repetitive DNA in eukaryotes. Nature 371(6494), 215\u2013220 (1994)","journal-title":"Nature"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Chen, K., Mihaescu, R., Rao, S.: On the tandem duplication-random loss model of genome rearrangement. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 564\u2013570 (2006)","DOI":"10.1145\/1109557.1109619"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00453-008-9209-8","volume":"54","author":"Z Chen","year":"2009","unstructured":"Chen, Z., Wang, L., Wang, Z.: Approximation algorithms for reconstructing the duplication history of tandem repeats. Algorithmica 54(4), 501\u2013529 (2009)","journal-title":"Algorithmica"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.tcs.2019.06.018","volume":"793","author":"D-J Cho","year":"2019","unstructured":"Cho, D.-J., Han, Y.-S., Kim, H.: Bound-decreasing duplication system. Theoret. Comput. Sci. 793, 152\u2013168 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"6_CR11","doi-asserted-by":"publisher","first-page":"e1003740","DOI":"10.1371\/journal.pcbi.1003740","volume":"10","author":"S Chowdhury","year":"2014","unstructured":"Chowdhury, S., Shackney, S., Heselmeyer-Haddad, K., Ried, T., Schaeffer, A., Schwartz, R.: Algorithms to model single gene, single chromosome, and whole genome copy number changes jointly in tumor phylogenetics. Plos Comput. Biol. 10(7), e1003740 (2014)","journal-title":"Plos Comput. Biol."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1038\/ng.2762","volume":"45","author":"G Ciriello","year":"2013","unstructured":"Ciriello, G., Killer, M., Aksoy, B., Senbabaoglu, Y., Schultz, N., Sanders, C.: Emerging landscape of oncogenic signatures across human cancers. Nat. Genet. 45, 1127\u20131133 (2013)","journal-title":"Nat. Genet."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1038\/sj.bjc.6605971","volume":"104","author":"S Cooke","year":"2011","unstructured":"Cooke, S., et al.: Intra-tumour genetic heterogeneity and poor chemoradiotherapy response in cervical cancer. Br. J. Cancer 104(2), 361\u2013368 (2011)","journal-title":"Br. J. Cancer"},{"issue":"12","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1016\/S1470-2045(11)70123-1","volume":"12","author":"S Cooke","year":"2011","unstructured":"Cooke, S., Brenton, J.: Evolution of platinum resistance in high-grade serous ovarian cancer. Lancet Oncol. 12(12), 1169\u20131174 (2011)","journal-title":"Lancet Oncol."},{"issue":"16","key":"6_CR15","doi-asserted-by":"publisher","first-page":"4060","DOI":"10.1158\/0008-5472.CAN-12-0203","volume":"72","author":"P Cowin","year":"2012","unstructured":"Cowin, P., et al.: LRP1B deletion in high-grade serous ovarian cancers is associated with acquired chemotherapy resistance to liposomal doxorubicin. Cancer Res. 72(16), 4060\u20134073 (2012)","journal-title":"Cancer Res."},{"key":"6_CR16","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, Second edn. MIT Press, Cambridge (2001)"},{"key":"6_CR17","first-page":"133","volume":"69","author":"J Dassow","year":"1999","unstructured":"Dassow, J., Mitrana, V., Paun, G.: On the regularity of the duplication closure. Bull. EATCS 69, 133\u2013136 (1999)","journal-title":"Bull. EATCS"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999). \n                  https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(84)90129-X","volume":"8","author":"A Ehrenfeucht","year":"1984","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On regularity of languages generated by copying systems. Discrete Appl. Math. 8(3), 313\u2013317 (1984)","journal-title":"Discrete Appl. Math."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-43681-4_11","volume-title":"Algorithms in Bioinformatics","author":"M El-Kebir","year":"2016","unstructured":"El-Kebir, M., et al.: Copy-number evolution problems: complexity and algorithms. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 137\u2013149. Springer, Cham (2016). \n                  https:\/\/doi.org\/10.1007\/978-3-319-43681-4_11"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M Fellows","year":"2009","unstructured":"Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). \n                  https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"6_CR23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W. H., New York (1979)"},{"key":"6_CR24","unstructured":"Gascuel, O., Hendy, M.D., Jean-Marie, A., McLachlan, R.: The combinatorics of tandem duplication trees. Syst. Biol. 52(1), 110\u2013118 (2003)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4), 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR27","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581\u2013592 (1995)"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1109\/TIT.2015.2505735","volume":"62","author":"F Hassanzadeh","year":"2016","unstructured":"Hassanzadeh, F., Schwartz, M., Bruck, J.: The capacity of string-duplication systems. IEEE Trans. Inf. Theory 62(2), 811\u2013824 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11779148_22","volume-title":"Developments in Language Theory","author":"M Ito","year":"2006","unstructured":"Ito, M., Leupold, P., Shikishima-Tsuji, K.: Closure of language classes under bounded duplication. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 238\u2013247. Springer, Heidelberg (2006). \n                  https:\/\/doi.org\/10.1007\/11779148_22"},{"issue":"10","key":"6_CR30","doi-asserted-by":"publisher","first-page":"6129","DOI":"10.1109\/TIT.2017.2728079","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain, S., Hassanzadeh, F., Bruck, J.: Capacity and expressiveness of genomic tandem duplication. IEEE Trans. Inf. Theory 63(10), 6129\u20136138 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR31","unstructured":"Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold filling under the breakpoint and related distances. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9(4), 1220\u20131229 (2012)"},{"issue":"1","key":"6_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G Landau","year":"2001","unstructured":"Landau, G., Schmidt, J., Sokol, D.: An algorithm for approximate tandem repeats. J. Comput. Biol. 8(1), 1\u201318 (2001)","journal-title":"J. Comput. Biol."},{"issue":"6822","key":"6_CR33","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"ES Lander","year":"2001","unstructured":"Lander, E.S., et al.: Initial sequencing and analysis of the human genome. Nature 409(6822), 860\u2013921 (2001)","journal-title":"Nature"},{"key":"6_CR34","unstructured":"Lafond, M., Zhu, B., Zou, P.: The tandem duplication distance is NP-hard. CoRR abs\/1906.05266, June 2019"},{"key":"6_CR35","unstructured":"Lafond, M., Zhu, B., Zou, P.: The tandem duplication distance is NP-hard. In: Proceedings of STACS 2020. LiPIcs, vol. 154, pp. 15:1\u201315:15 (2020)"},{"key":"6_CR36","unstructured":"Lafond, M., Zhu, B., Zou, P.: Genomic problems involving copy number profiles: complexity and algorithms. CoRR abs\/2002.04778, February 2020"},{"key":"6_CR37","unstructured":"Lafond, M., Zhu, B., Zou, P.: Genomic problems involving copy number profiles: complexity and algorithms. In: Proceedings of CPM 2020. LiPIcs, vol. 161, pp. 22:1\u201322:25 (2020)"},{"issue":"13","key":"6_CR38","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1093\/hmg\/11.13.1561","volume":"11","author":"I Letunic","year":"2002","unstructured":"Letunic, I., Copley, R., Bork, P.: Common exon duplication in animals and its role in alternative splicing. Hum. Mol. Genet. 11(13), 1561\u20131567 (2002)","journal-title":"Hum. Mol. Genet."},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-24635-0_22","volume-title":"Aspects of Molecular Computing","author":"P Leupold","year":"2003","unstructured":"Leupold, P., Mitrana, V., Sempere, J.M.: Formal languages arising from gene repeated duplication. In: Jonoska, N., Paun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 297\u2013308. Springer, Heidelberg (2003). \n                  https:\/\/doi.org\/10.1007\/978-3-540-24635-0_22"},{"issue":"3","key":"6_CR40","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.dam.2004.10.003","volume":"146","author":"P Leupold","year":"2005","unstructured":"Leupold, P., Carlos, M.V., Mitrana, V.: Uniformly bounded duplication languages. Discrete Appl. Math. 146(3), 301\u2013310 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"6_CR41","doi-asserted-by":"publisher","first-page":"e0196226","DOI":"10.1371\/journal.pone.0196226","volume":"13","author":"S Li","year":"2018","unstructured":"Li, S., Dou, X., Ge, R., Qian, M., Wan, L.: A remark on copy number variation detection. Plos One 13(4), e0196226 (2018)","journal-title":"Plos One"},{"issue":"1","key":"6_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1152\/physiolgenomics.00082.2012","volume":"45","author":"W Li","year":"2013","unstructured":"Li, W., Olivier, M.: Current analysis platforms and methods for detecting copy number variation. Physiol. Genomics 45(1), 1\u201316 (2013)","journal-title":"Physiol. Genomics"},{"issue":"6","key":"6_CR43","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/0092-8674(93)90585-E","volume":"72","author":"M Macdonald","year":"1993","unstructured":"Macdonald, M., et al.: A novel gene containing a trinucleotide repeat that is expanded and unstable on Huntington\u2019s disease. Cell 72(6), 971\u2013983 (1993)","journal-title":"Cell"},{"key":"6_CR44","unstructured":"Maley, C., et al.: Genetic clonal diversity predicts progression to esophageal adenocarcinoma. Nat. Genet. 38(4), 468\u2013473 (2006)"},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1038\/nrc3261","volume":"13","author":"A Marusyk","year":"2012","unstructured":"Marusyk, A., Almendro, V., Polyak, K.: Intra-tumour heterogeneity: a looking glass for cancer. Nat. Rev. 13, 323\u2013334 (2012)","journal-title":"Nat. Rev."},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1101\/gr.099622.109","volume":"20","author":"N Navin","year":"2010","unstructured":"Navin, N., et al.: Inferring tumor progression from genomic heterogeneity. Genome Res. 20, 68\u201380 (2010)","journal-title":"Genome Res."},{"issue":"Suppl 6","key":"6_CR47","doi-asserted-by":"publisher","first-page":"S10","DOI":"10.1186\/1471-2105-13-S6-S10","volume":"13","author":"L Oesper","year":"2012","unstructured":"Oesper, L., Ritz, A., Aerni, S., Drebin, R., Raphael, B.: Reconstructing cancer genomes from paired-end sequencing data. BMC Bioinform. 13(Suppl 6), S10 (2012)","journal-title":"BMC Bioinform."},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Qingge, L., He, X., Liu, Z., Zhu, B.: On the minimum copy number generation problem in cancer genomics. In: Proceedings of ACM BCB 2018, pp. 260\u2013269. ACM (2018)","DOI":"10.1145\/3233547.3233586"},{"issue":"4","key":"6_CR49","doi-asserted-by":"publisher","first-page":"e1003535","DOI":"10.1371\/journal.pcbi.1003535","volume":"10","author":"R Schwarz","year":"2014","unstructured":"Schwarz, R., Trinh, A., Sipos, B., Brenton, J., Goldman, N., Markowetz, F.: Phylogenetic quantification of intra-tumour heterogeneity. Plos Comput. Biol. 10(4), e1003535 (2014)","journal-title":"Plos Comput. Biol."},{"issue":"7265","key":"6_CR50","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1038\/nature08489","volume":"461","author":"S Shah","year":"2009","unstructured":"Shah, S., et al.: Mutational evolution in a lobular breast tumor profiled at single nucleotide resolution. Nature 461(7265), 809\u2013813 (2009)","journal-title":"Nature"},{"key":"6_CR51","unstructured":"Shamir, R., Zehavi, M., Zeira, R.: A linear-time algorithm for the copy number transformation problem. In: Proceedings of CPM 2016. LiPIcs, vol. 54, pp. 16:1\u201316:13 (2016)"},{"issue":"1","key":"6_CR52","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1086\/431652","volume":"77","author":"A Sharp","year":"2005","unstructured":"Sharp, A., et al.: Segmental duplications and copy-number variation in the human genome. Am. J. Hum. Genet. 77(1), 78\u201388 (2005)","journal-title":"Am. J. Hum. Genet."},{"issue":"5755","key":"6_CR53","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1038\/284426a0","volume":"284","author":"JW Szostak","year":"1980","unstructured":"Szostak, J.W., Wu, R.: Unequal crossing over in the ribosomal DNA of Saccharomyces cerevisiae. Nature 284(5755), 426\u2013430 (1980)","journal-title":"Nature"},{"key":"6_CR54","volume-title":"\u00dcber unendliche Zeichenreihen (Mathematisk-Naturvidenskabelig Klasse)","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen (Mathematisk-Naturvidenskabelig Klasse). Videnskabsselskabet, Freetown Christiania, Denmark (1906)"},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"Tremblay-Savard, O., Bertrand, D., El-Mabrouk, N.: Evolution of orthologous tandemly arrayed gene clusters. BMC Bioinform. 12(S-9), S2 (2011)","DOI":"10.1186\/1471-2105-12-S9-S2"},{"key":"6_CR56","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of 33rd ACM Symposium on Theory of Computing (STOC 2001), pp. 453\u2013461. ACM (2001)","DOI":"10.1145\/380752.380839"},{"key":"6_CR57","first-page":"162","volume":"70","author":"MW Wang","year":"2000","unstructured":"Wang, M.W.: On the irregularity of the duplication closure. Bull. EATCS 70, 162\u2013163 (2000)","journal-title":"Bull. EATCS"},{"issue":"1","key":"6_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"GA Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. J. Theoret. Biol. 99(1), 1\u20137 (1982)","journal-title":"J. Theoret. Biol."},{"key":"6_CR59","doi-asserted-by":"publisher","unstructured":"Zhu, B.: A retrospective on genomic preprocessing for comparative genomics. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Models and Algorithms for Genome Evolution, vol. 19, pp. 183\u2013206. Springer, Heidelberg (2013). \n                  https:\/\/doi.org\/10.1007\/978-1-4471-5298-9_9","DOI":"10.1007\/978-1-4471-5298-9_9"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T04:04:13Z","timestamp":1593230653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.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 (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":"49","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":"25","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":"51% - 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":"7","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 conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}