{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:56:37Z","timestamp":1756385797438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_32","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"446-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Longest Subsequence-Repeated Subsequence Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5305-7372","authenticated-orcid":false,"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenfeng","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adiesha","family":"Liyanage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3929-4128","authenticated-orcid":false,"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"32_CR1","unstructured":"Bannai, H., Tomohiro, I., K\u00f6ppl, D.: Longest (sub-)periodic subsequence. CoRR abs\/2202.07189 (2022)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October, 2015, pp. 79\u201397. IEEE Computer Society (2015)","DOI":"10.1109\/FOCS.2015.15"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-79987-8_13","volume-title":"Combinatorial Algorithms","author":"F Cicalese","year":"2021","unstructured":"Cicalese, F., Pilati, N.: The tandem duplication distance problem is hard over bounded alphabets. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 179\u2013193. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_13"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1038\/ng.2762","volume":"45","author":"G Ciriello","year":"2013","unstructured":"Ciriello, G., Miller, M.L., Aksoy, B.A., Senbabaoglu, Y., Schultz, N., Sander, C.: Emerging landscape of oncogenic signatures across human cancers. Nat. Genet. 45, 1127\u20131133 (2013)","journal-title":"Nat. Genet."},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-59212-7_11","volume-title":"String Processing and Information Retrieval","author":"T Inoue","year":"2020","unstructured":"Inoue, T., Inenaga, S., Bannai, H.: Longest square subsequence problem revisited. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 147\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_11"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-30213-1_13","volume-title":"String Processing and Information Retrieval","author":"A Kosowski","year":"2004","unstructured":"Kosowski, A.: An efficient algorithm for the longest tandem scattered subsequence problem. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol. 3246, pp. 93\u2013100. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30213-1_13"},{"key":"32_CR7","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)"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/20M1356257","volume":"36","author":"M Lafond","year":"2022","unstructured":"Lafond, M., Zhu, B., Zou, P.: Computing the tandem duplication distance is NP-hard. SIAM J. Discrete Math. 36(1), 64\u201391 (2022)","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR9","unstructured":"Lai, W., Liyanage, A., Zhu, B., Zou, P.: Beyond the longest letter-duplicated subsequence problem. In: Bannai, H., Holub, J. (eds.) 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, 27\u201329 June 2022, Prague, Czech Republic. LIPIcs, vol. 223, pp. 7:1\u20137:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"6822","key":"32_CR10","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"E Lander","year":"2001","unstructured":"Lander, E., et al.: International human genome sequencing consortium: initial sequencing and analysis of the human genome. Nature 409(6822), 860\u2013921 (2001)","journal-title":"Nature"},{"issue":"338","key":"32_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(338), 277\u2013278 (1957)","journal-title":"Math. Gaz."},{"key":"32_CR12","doi-asserted-by":"crossref","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)","DOI":"10.1016\/0092-8674(93)90585-E"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Cancer Genome Atlas Research Network: Integrated genomic analyses of ovarian carcinoma. Nature 474, 609\u2013615 (2011)","DOI":"10.1038\/nature10166"},{"issue":"Suppl 6","key":"32_CR14","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.M., Aerni, S.J., Drebin, R., Raphael, B.J.: Reconstructing cancer genomes from paired-end sequencing data. BMC Bioinform. 13(Suppl 6), S10 (2012)","journal-title":"BMC Bioinform."},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s13015-021-00191-8","volume":"16","author":"S Schrinner","year":"2021","unstructured":"Schrinner, S., Goel, M., Wulfert, M., Spohr, P., Schneeberger, K., Klau, G.W.: Using the longest run subsequence problem within homology-based scaffolding. Algorithms Mol. Biol. 16(1), 11 (2021)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1086\/431652","volume":"77","author":"AJ Sharp","year":"2005","unstructured":"Sharp, A.J., 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."},{"key":"32_CR17","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, 426\u2013430 (1980)","journal-title":"Nature"},{"key":"32_CR18","unstructured":"Tiskin, A.: Semi-local string comparison: algorithmic techniques and applications (2013). arXiv:0707.3619"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-031-43980-3_30","volume-title":"String Processing and Information Retrieval","author":"L Wang","year":"2023","unstructured":"Wang, L., Zhu, B.: Algorithms and hardness for the longest common subsequence of three strings and related problems. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) SPIRE 2023. LNCS, vol. 14240, pp. 367\u2013380. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43980-3_30"},{"issue":"03","key":"32_CR20","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0219720009004199","volume":"7","author":"C Zheng","year":"2009","unstructured":"Zheng, C., Kerr Wall, P., Leebens-Mack, J., de Pamphilis, C., Albert, V.A., Sankoff, D.: Gene loss under neighborhood selection following whole genome duplication and the reconstruction of the ancestral Populus genome. J. Bioinform. Comput. Biol. 7(03), 499\u2013520 (2009)","journal-title":"J. Bioinform. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:47Z","timestamp":1707556127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","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":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"6","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)"}}]}}