{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T01:13:37Z","timestamp":1750122817237},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389185"},{"type":"electronic","value":"9783030389192"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38919-2_11","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T12:03:18Z","timestamp":1579176198000},"page":"125-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster STR-EC-LCS Computation"],"prefix":"10.1007","author":[{"given":"Kohei","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"11_CR1","first-page":"59","volume":"2015","author":"A Abboud","year":"2015","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. FOCS 2015, 59\u201378 (2015)","journal-title":"FOCS"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ahsan, S.B., Aziz, S.P., Rahman, M.S.: Longest common subsequence problem for run-length-encoded strings. In: 2012 15th International Conference on Computer and Information Technology (ICCIT), pp. 36\u201341, December 2012","DOI":"10.1109\/ICCITechn.2012.6509736"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(95)00005-W","volume":"54","author":"H Bunke","year":"1995","unstructured":"Bunke, H., Csirik, J.: An improved algorithm for computing the edit distance of run-length coded strings. Inf. Process. Lett. 54(2), 93\u201396 (1995). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909500005W","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-009-9262-5","volume":"21","author":"YC Chen","year":"2011","unstructured":"Chen, Y.C., Chao, K.M.: On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3), 383\u2013392 (2011). \nhttps:\/\/doi.org\/10.1007\/s10878-009-9262-5","journal-title":"J. Comb. Optim."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.02.008","volume":"90","author":"FY Chin","year":"2004","unstructured":"Chin, F.Y., Santis, A.D., Ferrara, A.L., Ho, N., Kim, S.: A simple algorithm for the constrained sequence problems. Inf. Process. Lett. 90(4), 175\u2013179 (2004). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019004000614","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"11_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ipl.2012.02.007","volume":"112","author":"S Deorowicz","year":"2012","unstructured":"Deorowicz, S.: Quadratic-time algorithm for a string constrained lcs problem. Inf. Process. Lett. 112(11), 423\u2013426 (2012). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019012000567","journal-title":"Inf. Process. Lett."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2017.08.006","volume":"129","author":"S Inenaga","year":"2018","unstructured":"Inenaga, S., Hyyr\u00f6, H.: A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129, 11\u201315 (2018)","journal-title":"Inf. Process. Lett."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Kuboi, K., Fujishige, Y., Inenaga, S., Bannai, H., Takeda, M.: Faster STR-IC-LCS computation via RLE. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, 4\u20136 July 2017, Warsaw, Poland. LIPIcs, vol. 78, pp. 20:1\u201320:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.20","DOI":"10.4230\/LIPIcs.CPM.2017.20"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1093\/comjnl\/bxu012","volume":"58","author":"JJ Liu","year":"2014","unstructured":"Liu, J.J., Wang, Y.L., Chiu, Y.S.: Constrained longest common subsequences with run-length-encoded strings. Comput. J. 58(5), 1074\u20131084 (2014). \nhttps:\/\/doi.org\/10.1093\/comjnl\/bxu012","journal-title":"Comput. J."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N Nakatsu","year":"1982","unstructured":"Nakatsu, N., Kambayashi, Y., Yajima, S.: A longest common subsequence algorithm suitable for similar text strings. Acta Inf. 18, 171\u2013179 (1982). \nhttps:\/\/doi.org\/10.1007\/BF00264437","journal-title":"Acta Inf."},{"issue":"15","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1016\/j.patrec.2013.02.007","volume":"34","author":"H Stern","year":"2013","unstructured":"Stern, H., Shmueli, M., Berman, S.: Most discriminating segment - longest common subsequence (MDSLCS) algorithm for dynamic hand gesture classification. Pattern Recogn. Lett. 34(15), 1980\u20131989 (2013). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167865513000512\n\n, smart Approaches for Human Action Recognition","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"YT Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Inf. Process. Lett. 88(4), 173\u2013176 (2003). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S002001900300406X","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974). \nhttps:\/\/doi.org\/10.1145\/321796.321811","journal-title":"J. ACM"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"e45","DOI":"10.1093\/nar\/gkr009","volume":"39","author":"C Wang","year":"2011","unstructured":"Wang, C., Zhang, D.: A novel compression tool for efficient storage of genome resequencing data. Nucleic Acids Res. 39(7), e45 (2011). \nhttps:\/\/doi.org\/10.1093\/nar\/gkr009","journal-title":"Nucleic Acids Res."},{"issue":"19\u201321","key":"11_CR15","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ipl.2013.07.005","volume":"113","author":"L Wang","year":"2013","unstructured":"Wang, L., Wang, X., Wu, Y., Zhu, D.: A dynamic programming solution to a generalized LCS problem. Inf. Process. Lett. 113(19\u201321), 723\u2013728 (2013). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2013.07.005","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T12:12:35Z","timestamp":1579176755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_11","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":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","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":"125","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":"40","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":"17","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":"32% - 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":"2.9","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":"3.8","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)"}}]}}