{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:22Z","timestamp":1759638142565},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_26","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T06:13:18Z","timestamp":1385014398000},"page":"295-305","source":"Crossref","is-referenced-by-count":5,"title":["Fast Order-Preserving Pattern Matching"],"prefix":"10.1007","author":[{"given":"Sukhyeun","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joong Chae","family":"Na","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeong Seop","family":"Sim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order preserving matching. CoRR, abs\/1302.4064 (2013); Submitted to Theor. Comput. Sci."},{"issue":"12","key":"26_CR2","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. Information Processing Letters\u00a0113(12), 430\u2013433 (2013)","journal-title":"Information Processing Letters"},{"key":"26_CR3","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Walen, T.: Order-preserving suffx trees and their algorithmic applications. CoRR, abs\/1303.6872 (2013)"},{"key":"26_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"issue":"10","key":"26_CR5","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"issue":"3","key":"26_CR6","first-page":"257","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R.: Improved string searching. Software: Practice and Experience\u00a019(3), 257\u2013271 (1989)","journal-title":"Software: Practice and Experience"},{"issue":"7","key":"26_CR7","first-page":"851","volume":"27","author":"J. Tarhio","year":"1997","unstructured":"Tarhio, J., Peltola, H.: String matching in the DNA alphabet. Software: Practice and Experience\u00a027(7), 851\u2013861 (1997)","journal-title":"Software: Practice and Experience"},{"issue":"6","key":"26_CR8","first-page":"501","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software: Practice and Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software: Practice and Experience"},{"key":"26_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley (1997)"},{"issue":"6","key":"26_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"W. Myrvold","year":"2001","unstructured":"Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters\u00a079(6), 281\u2013284 (2001)","journal-title":"Information Processing Letters"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Mares, M., Straka, M.: Linear-time ranking of permutations. Algorithms-ESA, 187\u2013193 (2007)","DOI":"10.1007\/978-3-540-75520-3_18"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T12:55:10Z","timestamp":1558702510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}