{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:20:23Z","timestamp":1771024823724,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:00:00Z","timestamp":1485820800000},"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":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-016-0282-0","type":"journal-article","created":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T12:55:43Z","timestamp":1485867343000},"page":"127-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On Representations of Ternary Order Relations in Numeric Strings"],"prefix":"10.1007","volume":"11","author":[{"given":"Jinil","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amihood","family":"Amir","sequence":"additional","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","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"issue":"6","key":"282_CR1","doi-asserted-by":"crossref","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":"4","key":"282_CR2","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s003550050123","volume":"15","author":"RW Bailey","year":"1998","unstructured":"Bailey, R.W.: The number of weak orderings of a finite set. Soc. Choice Welf. 15(4), 559\u2013562 (1998)","journal-title":"Soc. Choice Welf."},{"key":"282_CR3","doi-asserted-by":"crossref","unstructured":"Chhabra, T., Tarhio, J.: Order-preserving matching with filtration. In: SEA, pp. 307\u2013314 (2014)","DOI":"10.1007\/978-3-319-07959-2_26"},{"key":"282_CR4","doi-asserted-by":"crossref","unstructured":"Cho, S., Na, J.C., Park, K., Sim, J.S.: Fast order-preserving pattern matching. In: COCOA (2013)","DOI":"10.1007\/978-3-319-03780-6_26"},{"key":"282_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, Rl, Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"282_CR6","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Walen, T.: Order-preserving incomplete suffix trees and order-preserving indexes. In: SPIRE, pp. 84\u201395, (2013)","DOI":"10.1007\/978-3-319-02432-5_13"},{"key":"282_CR7","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Uznanski, P.: Order-preserving pattern matching with $$k$$ k mismatches. In: CPM, pp. 130\u2013139 (2014)","DOI":"10.1007\/978-3-319-07566-2_14"},{"key":"282_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/00150517.1975.12430678","volume":"13","author":"IJ Good","year":"1975","unstructured":"Good, I.J.: The number of orderings of $$n$$ n candidates when ties are permitted. Fibonacci Q. 13, 11\u201318 (1975)","journal-title":"Fibonacci Q."},{"key":"282_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.2307\/2312725","volume":"69","author":"OA Gross","year":"1962","unstructured":"Gross, O.A.: Preferential arrangements. Am. Math. Mon. 69, 4\u20138 (1962)","journal-title":"Am. Math. Mon."},{"key":"282_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.-H., 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."},{"key":"282_CR11","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1142\/S1793042105000315","volume":"1","author":"A Knopfmacher","year":"2005","unstructured":"Knopfmacher, A., Mays, M.E.: A survey of factorization counting functions. Int. J. Number Theory 1, 563\u2013581 (2005)","journal-title":"Int. J. Number Theory"},{"issue":"2","key":"282_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., M Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"282_CR13","volume-title":"Advanced Engineering Mathematics","author":"E Kreyszig","year":"2010","unstructured":"Kreyszig, E.: Advanced Engineering Mathematics. John Wiley & Sons, New York (2010)"},{"issue":"12","key":"282_CR14","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."},{"issue":"2","key":"282_CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"issue":"3","key":"282_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0282-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0282-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0282-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T22:04:12Z","timestamp":1749938652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0282-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,31]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["282"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0282-0","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,31]]}}}