{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:49:24Z","timestamp":1756385364595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_13","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1652-0599","authenticated-orcid":false,"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[]},{"given":"Nicol\u00f2","family":"Pilati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"12","key":"13_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., Farnoud Hassanzadeh, 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":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(92)90050-6","volume":"44","author":"DP Bovet","year":"1992","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)","journal-title":"Inf. Process. Lett."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Chrisnata, J., Kiah, H.M., Nguyen, T.T.: Deciding the confusability of words under tandem repeats in linear time. ACM Trans. Algorithms 15(3) (2019)","DOI":"10.1145\/3338514"},{"issue":"3","key":"13_CR4","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. Discret. Appl. Math. 8(3), 313\u2013317 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1109\/TIT.2015.2505735","volume":"62","author":"F Farnoud","year":"2016","unstructured":"Farnoud, 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":"13_CR6","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":"Masami Ito","year":"2006","unstructured":"Ito, Masami, Leupold, Peter, Shikishima-Tsuji, Kayoko: Closure of language classes under bounded duplication. In: Ibarra, Oscar H.., Dang, Zhe (eds.) DLT 2006. LNCS, vol. 4036, pp. 238\u2013247. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779148_22"},{"issue":"10","key":"13_CR7","doi-asserted-by":"publisher","first-page":"6129","DOI":"10.1109\/TIT.2017.2728079","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain, S., Farnoud 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"},{"issue":"8","key":"13_CR8","doi-asserted-by":"publisher","first-page":"4996","DOI":"10.1109\/TIT.2017.2688361","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain, S., Farnoud Hassanzadeh, F., Schwartz, M., Bruck, J.: Duplication-correcting codes for data storage in the DNA of living organisms. IEEE Trans. Inf. Theory 63(8), 4996\u20135010 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR9","unstructured":"Lafond, M., Zhu, B., Zou, P.: The tandem duplication distance is np-hard. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, 10\u201313 March 2020, Montpellier, France. LIPIcs, vol. 154, pp. 15:1\u201315:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Lander, E., et al.: Initial sequencing and analysis of the human genome. Nature 409 (2001)","DOI":"10.1038\/35057062"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.2307\/3610126","volume":"41","author":"J Leech","year":"1957","unstructured":"Leech, J.: A problem on strings of beads. Math. Gaz. 41, 277\u2013278 (1957)","journal-title":"Math. Gaz."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-73208-2_28","volume-title":"Developments in Language Theory","author":"Peter Leupold","year":"2007","unstructured":"Leupold, Peter: Duplication roots. In: Harju, Tero, Karhum\u00e4ki, Juhani, Lepist\u00f6, Arto (eds.) DLT 2007. LNCS, vol. 4588, pp. 290\u2013299. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_28"},{"issue":"1\u20133","key":"13_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.tcs.2006.10.021","volume":"370","author":"P Leupold","year":"2007","unstructured":"Leupold, P.: Languages generated by iterated idempotency. Theor. Comput. Sci. 370(1\u20133), 170\u2013185 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"13_CR14","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., Mart\u00edn-Vide, C., Mitrana, V.: Uniformly bounded duplication languages. Discret. Appl. Math. 146(3), 301\u2013310 (2005)","journal-title":"Discret. Appl. Math."},{"key":"13_CR15","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":"Peter Leupold","year":"2003","unstructured":"Leupold, Peter, Mitrana, Victor, Sempere, Jos\u00e9 M..: Formal languages arising from gene repeated duplication. In: Jonoska, Nata\u0161a, P\u0103un, Gheorghe, Rozenberg, Grzegorz (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 297\u2013308. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24635-0_22"},{"issue":"9","key":"13_CR16","doi-asserted-by":"publisher","first-page":"3636","DOI":"10.1073\/pnas.92.9.3636","volume":"92","author":"GR Sutherland","year":"1995","unstructured":"Sutherland, G.R., Richards, R.I.: Simple tandem DNA repeats and human genetic disease. Proc. Natl. Acad. Sci. 92(9), 3636\u20133641 (1995)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1101\/gr.070409.107","volume":"18","author":"K Usdin","year":"2008","unstructured":"Usdin, K.: The biological effects of simple tandem repeats: Lessons from the repeat expansion diseases. Genome Res. 18, 1011\u20131019 (2008)","journal-title":"Genome Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:11:18Z","timestamp":1625008278000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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 workshop was held virtually.","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)"}}]}}