{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:40:10Z","timestamp":1742928010024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"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-39881-1_11","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"120-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Dictionary Matching Under Substring Consistent Equivalence Relations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8168-7312","authenticated-orcid":false,"given":"Diptarama","family":"Hendrian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"5","key":"11_CR2","first-page":"1007","volume":"35","author":"A Amir","year":"2006","unstructured":"Amir, A., Aumann, Y., Lewenstein, M., Porat, E.: Function matching. Soc. Ind. Appl. Math. 35(5), 1007\u20131022 (2006)","journal-title":"Soc. Ind. Appl. Math."},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inf. Process. Lett. 49(3), 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"key":"11_CR4","unstructured":"Amir, A., Kondratovsky, E.: Sufficient conditions for efficient indexing under different matchings. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), pp. 6:1\u20136:12 (2019)"},{"key":"11_CR5","unstructured":"Antoniou, P., Crochemore, M., Iliopoulos, C., Jayasekera, I., Landau, G.: Conservative string covering of indeterminate strings. In: Prague Stringology Conference, vol. 2008, pp. 108\u2013115 (2008)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"BS Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. 52(1), 28\u201342 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR7","volume-title":"Text Algorithm","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithm. Oxford University Press, Oxford (1994)"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Co. Pte. Ltd., Singapore (2002)"},{"key":"11_CR9","unstructured":"Diptarama, U.Y., Narisawa, K., Shinohara, A.: KMP based pattern matching algorithms for multi-track strings. In: Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016, pp. 100\u2013107 (2016)"},{"key":"11_CR10","unstructured":"Diptarama, Y.U., Yoshinaka, R., Shinohara, A.: Fast full permuted pattern matching algorithms on multi-track strings. In: Prague Stringology Conference (PSC) 2016, pp. 7\u201321 (2016)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"73:1","DOI":"10.3390\/a12040073","volume":"12","author":"D Hendrian","year":"2019","unstructured":"Hendrian, D., Ueki, Y., Narisawa, K., Yoshinaka, R., Shinohara, A.: Permuted pattern matching algorithms on multi-track strings. Algorithms 12(4), 73:1\u201373:20 (2019)","journal-title":"Algorithms"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)00270-3","volume":"154","author":"RM Idury","year":"1996","unstructured":"Idury, R.M., Sch\u00e4ffer, A.A.: Multiple matching of parameterized patterns. Theor. Comput. Sci. 154(2), 203\u2013224 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-35843-2_25","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"T Katsura","year":"2013","unstructured":"Katsura, T., Narisawa, K., Shinohara, A., Bannai, H., Inenaga, S.: Permuted pattern matching on multi-track strings. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 280\u2013291. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35843-2_25"},{"key":"11_CR14","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., et al.: Order-preserving matching. Theor. Comput. Sci. 525, 68\u201379 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"11_CR16","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., Kulczy\u0144ski, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12), 430\u2013433 (2013)","journal-title":"Inf. Process. Lett."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2016.02.017","volume":"656","author":"Y Matsuoka","year":"2016","unstructured":"Matsuoka, Y., Aoki, T., Inenaga, S., Bannai, H., Takeda, M.: Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656, 225\u2013233 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","unstructured":"Park, S.G., Amir, A., Landau, G.M., Park, K.: Cartesian tree matching and indexing. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), pp. 16:1\u201316:14 (2019)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:22Z","timestamp":1582139122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_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":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}