{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:17:56Z","timestamp":1771024676975,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319519623","type":"print"},{"value":"9783319519630","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_28","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"363-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings"],"prefix":"10.1007","author":[{"given":"Yohei","family":"Ueki","sequence":"first","affiliation":[]},{"family":"Diptarama","sequence":"additional","affiliation":[]},{"given":"Masatoshi","family":"Kurihara","sequence":"additional","affiliation":[]},{"given":"Yoshiaki","family":"Matsuoka","sequence":"additional","affiliation":[]},{"given":"Kazuyuki","family":"Narisawa","sequence":"additional","affiliation":[]},{"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). doi:\n                      10.1007\/10719839_9"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2015.11.026","volume":"638","author":"G Benson","year":"2016","unstructured":"Benson, G., Levy, A., Maimoni, S., Noifeld, D., Shalom, B.: LCSk: a refined similarity measure. Theor. Comput. Sci. 638, 11\u201326 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-73437-6_32","volume-title":"Combinatorial Pattern Matching","author":"M Bouvel","year":"2007","unstructured":"Bouvel, M., Rossin, D., Vialette, S.: Longest common separable pattern among permutations. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 316\u2013327. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-73437-6_32"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ipl.2014.10.018","volume":"115","author":"S Cho","year":"2015","unstructured":"Cho, S., Na, J.C., Park, K., Sim, J.S.: A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2), 397\u2013402 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894\u2013923 (2005)","journal-title":"SIAM J. Comput."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2015.06.050","volume":"638","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Order-preserving indexing. Theor. Comput. Sci. 638, 122\u2013135 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"28_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ipl.2014.05.009","volume":"114","author":"S Deorowicz","year":"2014","unstructured":"Deorowicz, S., Grabowski, S.: Efficient algorithms for the longest common subsequence in \n                      \n                        \n                      \n                      $$k$$\n                    -length substrings. Inf. Process. Lett. 114(11), 634\u2013638 (2014)","journal-title":"Inf. Process. Lett."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the LCP-array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374\u2013385. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-22300-6_32"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"28_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.patrec.2014.11.013","volume":"55","author":"MM Hasan","year":"2015","unstructured":"Hasan, M.M., Islam, A., Rahman, M.S., Rahman, M.: Order preserving pattern matching revisited. Pattern Recogn. Lett. 55, 15\u201321 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"28_CR12","first-page":"1192","volume":"24","author":"R Khan","year":"2013","unstructured":"Khan, R., Ahmad, M., Zakarya, M.: Longest common subsequence based algorithm for measuring similarity between time series: a new approach. World Appl. Sci. J. 24(9), 1192\u20131198 (2013)","journal-title":"World Appl. Sci. J."},{"issue":"13","key":"28_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2013.10.006","volume":"525","author":"J Kim","year":"2014","unstructured":"Kim, J., Eades, P., Fleischer, R., Hong, S.H., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order-preserving matching. Theor. Comput. Sci. 525(13), 68\u201379 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"28_CR14","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.ipl.2013.03.015","volume":"113","author":"M Kubica","year":"2013","unstructured":"Kubica, M., Kulczynski, T., Radoszewski, J., Rytter, W., Walen, T.: A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12), 430\u2013433 (2013)","journal-title":"Inf. Process. Lett."},{"key":"28_CR15","unstructured":"Paveti\u0107, F., \u017du\u017ei\u0107, G., \u0160iki\u0107, M.: \n                      \n                        \n                      \n                      $$LCSk$$\n                    ++: practical similarity metric for long strings (2014). CoRR \n                      1407.2407"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Sovi\u0107, I., \u0160iki\u0107, M., Wilm, A., Fenlon, S.N., Chen, S., Nagarajan, N.: Fast and sensitive mapping of nanopore sequencing reads with GraphMap. Nat. Commun. 7, Article No. 11307 (2016). doi:\n                      10.1038\/ncomms11307","DOI":"10.1038\/ncomms11307"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:02:56Z","timestamp":1558317776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 January 2017","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":"Limerick","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}