{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T14:36:02Z","timestamp":1774190162795,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0306-4379(02)00102-3","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T15:38:35Z","timestamp":1046792315000},"page":"867-883","source":"Crossref","is-referenced-by-count":18,"title":["Similarity search of time-warped subsequences via a suffix tree"],"prefix":"10.1016","volume":"28","author":[{"given":"Sanghyun","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wesley W.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeehee","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jungim","family":"Won","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0306-4379(02)00102-3_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, in: Proceedings of International Conference on Foundations of Data Organization and Algorithms (FODO), Chicago, IL, 1993, pp. 69\u201384.","DOI":"10.1007\/3-540-57301-1_5"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB2","unstructured":"R. Agrawal, K. Lin, H.S. Sawhney, K. Shim, Fast similarity search in the presence of noise, scaling, and translation in time-series databases, in: Proceedings of the International Conference on Very Large Data Bases (VLDB), Zurich, 1995, pp. 490\u2013501."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB3","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN, 1994, pp. 419\u2013429.","DOI":"10.1145\/191839.191925"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB4","unstructured":"B.-K. Yi, H.V. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), Orlando, FL, 1998, pp. 201\u2013208."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB5","series-title":"Fundamentals of Speech Recognition","author":"Rabinar","year":"1993"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB6","unstructured":"D.J. Berndt, J. Clifford, Finding patterns in time series: a dynamic programming approach, in: U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds), Advances in Knowledge Discovery and Data Mining, AAAI\/MIT, 1996, Cambridge, MA, pp. 229\u2013248."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB7","doi-asserted-by":"crossref","unstructured":"D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Tucson, AZ, 1997, pp. 13\u201324.","DOI":"10.1145\/253260.253264"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB8","series-title":"String Searching Algorithms","author":"Stephen","year":"1994"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB9","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the ACM SIGMOD, Atlantic City, NJ, 1990, pp. 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB10","doi-asserted-by":"crossref","unstructured":"D.Q. Goldin, P.C. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, in: Proceedings of the Constraint Programming, Cassis, France, 1995, pp. 137\u2013153.","DOI":"10.1007\/3-540-60299-2_9"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB11","doi-asserted-by":"crossref","unstructured":"A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD, Boston, MA, 1984, pp. 47\u201357.","DOI":"10.1145\/602259.602266"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB12","doi-asserted-by":"crossref","unstructured":"T. Bozkaya, N. Yazdani, M. Ozsoyoglu, Matching and indexing sequences of different lengths, in: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), Las Vegas, NA, 1997, pp. 128\u2013135.","DOI":"10.1145\/266714.266880"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB13","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, K. Lin, Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), San Jose, CA, 1995, pp. 163\u2013174.","DOI":"10.1145\/223784.223812"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB14","doi-asserted-by":"crossref","unstructured":"E.J. Keogh, M.J. Pazzani, Scaling up dynamic time warping to massive datasets, in: Proceedings of the Principles and Practice of Knowledge Discovery in Databases (PKDD), Prague, 1999.","DOI":"10.1007\/978-3-540-48247-5_1"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB15","doi-asserted-by":"crossref","unstructured":"E.J. Keogh, M.J. Pazzani, Scaling up dynamic time warping for data mining applications, in: Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Boston, MA, 2000, pp. 285\u2013289.","DOI":"10.1145\/347090.347153"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB16","doi-asserted-by":"crossref","unstructured":"S. Park, D. Lee, W.W. Chu, Fast retrieval of similar subsequences in long sequence databases, in: Proceedings of the IEEE Knowledge and Data Engineering Exchange Workshop (KDEX), Chicago, IL, 1999, pp. 60\u201367.","DOI":"10.1109\/KDEX.1999.836610"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB17","unstructured":"R. Agrawal, G. Psaila, E.L. Wimmers, M. Zait, Querying shapes of histories, in: Proceedings of the International Conference on Very Large Data Bases (VLDB), Zurich, 1995, pp. 502\u2013514."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB18","doi-asserted-by":"crossref","unstructured":"H. Shatkay, S.B. Zdonik, Approximate queries and representations for large data sequences, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), Houston, TX, 1994, pp. 536\u2013545.","DOI":"10.1109\/ICDE.1996.492204"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB19","doi-asserted-by":"crossref","unstructured":"P. Bieganski, J. Riedl, J.V. Carlis, Generalized suffix trees for biological sequence data: applications and implementation, in: Proceedings of the Hawaii International Conference on System Sciences, Wailea, Hawaii, 1994.","DOI":"10.1109\/HICSS.1994.323593"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB20","doi-asserted-by":"crossref","unstructured":"J.T. Wang, G. Chirn, T.G. Marr, B. Shapiro, D. Shasha, K. Zhang, Combinatorial pattern discovery for scientific data: some preliminary results, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN, 1994, pp. 115\u2013125.","DOI":"10.1145\/191839.191863"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB21","doi-asserted-by":"crossref","unstructured":"S. Park, S.W. Kim, J.S. Cho, S. Padmanabhan, Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases, in: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), Atlanta, GA, 2001, pp. 255\u2013262.","DOI":"10.1145\/502585.502629"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB22","unstructured":"S. Park, W.W. Chu, J. Yoon, C. Hsu, A suffix tree for fast similarity searches of time-warped subsequences in sequence databases, Technical Report UCLA-CS-TR-990005, UCLA, 1999."},{"issue":"7","key":"10.1016\/S0306-4379(02)00102-3_BIB23","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithms for computing k-nearest neighbors","volume":"C-24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB24","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H.-P. Kriegel, R. Schneider, B. Seeger, Multi-step processing of spatial joins, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN, 1994, pp. 237\u2013246.","DOI":"10.1145\/191839.191880"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB25","unstructured":"W.W. Chu, K. Chiang, Abstraction of high level concepts from numerical values in databases, in: Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, Seattle, WA, 1994, pp. 133\u2013144."},{"key":"10.1016\/S0306-4379(02)00102-3_BIB26","series-title":"The Mathematical Theory of Communication","author":"Shannon","year":"1964"},{"key":"10.1016\/S0306-4379(02)00102-3_BIB27","doi-asserted-by":"crossref","unstructured":"J. Karkkainen, E. Ukkonen, Sparse suffix trees, in: Proceedings of Computing and Combinatorics (COCOON), Hong Kong, 1996, pp. 219\u2013230.","DOI":"10.1007\/3-540-61332-3_155"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437902001023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437902001023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:15:58Z","timestamp":1733940958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437902001023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0306437902001023"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4379(02)00102-3","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}