{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:18:34Z","timestamp":1771024714431,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030326852","type":"print"},{"value":"9783030326869","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_9","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T18:02:27Z","timestamp":1570212147000},"page":"124-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Cartesian Tree Matching"],"prefix":"10.1007","author":[{"given":"Siwoo","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheol","family":"Ryu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Faro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jagm.2000.1120","volume":"37","author":"A Amir","year":"2000","unstructured":"Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247\u2013266 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A Amir","year":"2003","unstructured":"Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput. 181(1), 57\u201374 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"9_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."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(01)00302-7","volume":"83","author":"A Amir","year":"2002","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Inf. Process. Lett. 83(1), 33\u201339 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, pp. 71\u201380. ACM (1993)","DOI":"10.1145\/167088.167115"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054112400175","volume":"23","author":"P Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Liptak, Z.: Algorithms for jumbled pattern matching in strings. Int. J. Found. Comput. Sci. 23(2), 357\u2013374 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cantone, D., Faro, S., Kulekci, M.O.: The order-preserving pattern matching problem in practice. Discrete Applied Mathematics (2018, in press)","DOI":"10.1016\/j.dam.2018.10.023"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Charras, C., Lecroq, T., Pehoushek, J.D.: A very fast string matching algorithm for small alphabets and long patterns. In: Combinatorial Pattern Matching, pp. 55\u201364 (1998)","DOI":"10.1007\/BFb0030780"},{"key":"9_CR9","unstructured":"Chhabra, T., Kulekci, M.O., Tarhio, J.: Alternative algorithms for order-preserving matching. In: Proceedings of the Prague Stringology Conference 2015, pp. 36\u201346 (2015)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2015.10.005","volume":"116","author":"T Chhabra","year":"2016","unstructured":"Chhabra, T., Tarhio, J.: A filtration method for order-preserving matching. Inf. Process. Lett. 116(2), 71\u201374 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR11","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":"9_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2009.11.010","volume":"110","author":"B Durian","year":"2010","unstructured":"Durian, B., Holub, J., Peltola, H., Tarhio, J.: Improving practical exact string matching. Inf. Process. Lett. 110(4), 148\u2013152 (2010)","journal-title":"Inf. Process. Lett."},{"key":"9_CR13","unstructured":"Faro, S., Lecroq, T., Borzi, S., Mauro, S.D., Maggio, A.: The string matching algorithms research tool. In: Proceedings of the Prague Stringology Conference 2016, pp. 99\u2013113 (2016)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Grabowski, S.: Practical and optimal string matching. In: String Processing and Information Retrieval, pp. 376\u2013387 (2005)","DOI":"10.1007\/11575832_42"},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"RN Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Experience 10(6), 501\u2013506 (1980)","journal-title":"Softw. Pract. Experience"},{"key":"9_CR16","unstructured":"Intel: Intel (R) 64 and IA-32 Architectures Optimization Reference Manual (2019)"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s11786-016-0282-0","volume":"11","author":"J Kim","year":"2017","unstructured":"Kim, J., Amir, A., Na, J.C., Park, K., Sim, J.S.: On representations of ternary order relations in numeric strings. Math. Comput. Sci. 11(2), 127\u2013136 (2017)","journal-title":"Math. Comput. Sci."},{"key":"9_CR18","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. Theoret. Comput. Sci. 525, 68\u201379 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR19","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":"9_CR20","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":"9_CR21","unstructured":"Park, S.G., Amir, A., Landau, G.M., Park, K.: Cartesian tree matching and indexing. In: Combinatorial Pattern Matching, pp. 16:1\u201316:14 (2019). \n                      https:\/\/arxiv.org\/abs\/1905.08974"},{"issue":"7","key":"9_CR22","first-page":"851","volume":"27","author":"J Tarhio","year":"1997","unstructured":"Tarhio, J., Peltola, H.: String matching in the DNA alphabet. Software: Pract. Experience 27(7), 851\u2013861 (1997)","journal-title":"Software: Pract. Experience"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32686-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:06:24Z","timestamp":1570223184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","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":"59","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":"28","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":"8","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":"47% - 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":"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)"}}]}}