{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:18:36Z","timestamp":1771024716709,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319674278","type":"print"},{"value":"9783319674285","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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_23","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"271-277","source":"Crossref","is-referenced-by-count":4,"title":["Order Preserving Pattern Matching on Trees and DAGs"],"prefix":"10.1007","author":[{"given":"Temma","family":"Nakamura","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-63307-3_56","volume-title":"Algorithms and Data Structures","author":"A Amir","year":"1997","unstructured":"Amir, A., Lewenstein, M., Lewenstein, N.: Pattern matching in hypertext. In: Dehne, F., Rau-Chaplin, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 160\u2013173. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63307-3_56"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Lewenstein, M., Lewenstein, N.: Hypertext searching - a survey. In: Language, Culture, Computation. Computing - Theory and Technology - Essays Dedicated to Yaacov Choueka on the Occasion of his 75th Birthday, Part I, pp. 364\u2013381 (2014)","DOI":"10.1007\/978-3-642-45321-2_15"},{"issue":"15","key":"23_CR3","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/j.ipl.2009.04.012","volume":"109","author":"A Amir","year":"2009","unstructured":"Amir, A., Navarro, G.: Parameterized matching on non-linear structures. Inf. Process. Lett. 109(15), 864\u2013867 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"23_CR4","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"RA Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theor. Comput. Sci. 78(2), 363\u2013376 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-57155-8_248","volume-title":"Algorithms and Data Structures","author":"P Bose","year":"1993","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 200\u2013209. Springer, Heidelberg (1993). doi: 10.1007\/3-540-57155-8_248"},{"issue":"2","key":"23_CR6","doi-asserted-by":"crossref","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":"23_CR7","doi-asserted-by":"crossref","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":"2","key":"23_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/174652.174653","volume":"41","author":"M Dubiner","year":"1994","unstructured":"Dubiner, M., Galil, Z., Magen, E.: Faster tree pattern matching. J. ACM 41(2), 205\u2013213 (1994)","journal-title":"J. ACM"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-41168-2_16","volume-title":"Algorithmic Aspects in Information and Management","author":"S Faro","year":"2016","unstructured":"Faro, S., K\u00fclekci, M.O.: Efficient algorithms for the order preserving pattern matching problem. In: Dondi, R., Fertin, G., Mauri, G. (eds.) AAIM 2016. LNCS, vol. 9778, pp. 185\u2013196. Springer, Cham (2016). doi: 10.1007\/978-3-319-41168-2_16"},{"key":"23_CR10","doi-asserted-by":"crossref","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., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order-preserving matching. Theor. Comput. Sci. 525, 68\u201379 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"23_CR11","doi-asserted-by":"crossref","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":"23_CR12","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical report, 40, University of California, Berkeley (1970)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-60044-2_51","volume-title":"Combinatorial Pattern Matching","author":"K Park","year":"1995","unstructured":"Park, K., Kim, D.K.: String matching in hypertext. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 318\u2013329. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60044-2_51"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-58131-6_61","volume-title":"Results and Trends in Theoretical Computer Science","author":"I Simon","year":"1994","unstructured":"Simon, I.: String matching algorithms and automata. In: Karhum\u00e4ki, J., Maurer, H., Rozenberg, G. (eds.) Results and Trends in Theoretical Computer Science. LNCS, vol. 812, pp. 386\u2013395. Springer, Heidelberg (1994). doi: 10.1007\/3-540-58131-6_61"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:59:43Z","timestamp":1570060783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}