{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T15:43:36Z","timestamp":1759160616498},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T00:00:00Z","timestamp":1408752000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10489-014-0553-x","type":"journal-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T02:56:04Z","timestamp":1408676164000},"page":"941-955","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Analyzing very large time series using suffix arrays"],"prefix":"10.1007","volume":"41","author":[{"given":"Konstantinos F.","family":"Xylogiannopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Karampelas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reda","family":"Alhajj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,23]]},"reference":[{"key":"553_CR1","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2012) Periodicity data mining in time series using suffix arrays. In: Proceedings of the IEEE intelligent systems IS\u201912","DOI":"10.1109\/IS.2012.6335132"},{"key":"553_CR2","unstructured":"Gog S, Moffat A, Culpepper S, Turpin A, Wirth A, 2013 Large-scale pattern search using reduced-space on-disk suffix arrays. arXiv: 1303.6481v1"},{"key":"553_CR3","doi-asserted-by":"crossref","unstructured":"Phoophakdee B, Zaki M (2007) Genome-scale disk-based suffix tree indexing. In: Proceeding of the international conference on management of data SIGMOD \u201907, pp 833\u2013844","DOI":"10.1145\/1247480.1247572"},{"key":"553_CR4","volume-title":"TRELLIS: genome-scale disk-based suffix tree indexing algorithm, PhD Thesis, Department of Computer Science","author":"B Phoophakdee","year":"2007","unstructured":"Phoophakdee B (2007) TRELLIS: genome-scale disk-based suffix tree indexing algorithm, PhD Thesis, Department of Computer Science. Rensselaer Polytechnic Institute, Troy"},{"key":"553_CR5","doi-asserted-by":"crossref","unstructured":"Sinha R, Moffat A, Puglisi S, Turpin A (2008) Improving suffix array locality for fast pattern matching on disk. In: Proceedings of the international conference on management of data SIGMOD \u201908, pp 661\u2013672","DOI":"10.1145\/1376616.1376683"},{"issue":"3","key":"553_CR6","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.is.2010.11.001","volume":"36","author":"M Barsky","year":"2011","unstructured":"Barsky M, Stege U, Thomo A (2011) Suffix trees for inputs larger than main memory. Inform Syst 36(3):644\u2013654","journal-title":"Inform Syst"},{"key":"553_CR7","doi-asserted-by":"crossref","unstructured":"Wu Y, Wang L, Ren J, Ding W, Wu X (2014) Mining sequential patterns with periodic wildcard gaps. Applied intelligence","DOI":"10.1007\/s10489-013-0499-4"},{"key":"553_CR8","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2012), Exhaustive patterns detection in time series using suffix arrays. Manuscript in submission","DOI":"10.1109\/IS.2012.6335132"},{"key":"553_CR9","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2012) Minimization of suffix array\u2019s storage capacity for periodicity detection in time series. In: Proceedings of the IEEE international conference in tools with artificial intelligence","DOI":"10.1109\/ICTAI.2012.49"},{"key":"553_CR10","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2013) Probabilistic existence and estimation of longest expected repeated pattern in sequences. Submitted for publication"},{"key":"553_CR11","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2014) Experimental analysis on the normality of pi, e, phi and square root of 2 using advanced data mining techniques. Experimental mathematics, in press"},{"issue":"20","key":"553_CR12","first-page":"1","volume":"22","author":"F Rasheed","year":"2010","unstructured":"Rasheed F, Alshalfa M, Alhajj R (2010) Efficient periodicity mining in time series databases using suffix trees. IEEE Trans Knowl Data Eng 22(20):1\u201316","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"553_CR13","unstructured":"Sch\u00fcrmann K-B, Stoye J (2005) An incomplex algorithm for fast suffix array construction. In: Proceedings of the 7th workshop on algorithm engineering and experiments and the 2nd workshop on analytic algorithmics and combinatorics (ALENEX\/ANALCO 2005), pp 77\u201385"},{"issue":"1","key":"553_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-001-0051-5","volume":"32","author":"A Crauser","year":"2002","unstructured":"Crauser A, Ferragina P (2002) A theoritical and experimental study on the construction of suffix arrays in external memory. Algorithmica 32(1):1\u201335","journal-title":"Algorithmica"},{"issue":"2\u20134","key":"553_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P Ko","year":"2005","unstructured":"Ko P, Aluru S (2005) Space efficient linear time construction of suffix arrays. J Discrete Algorithm 3 (2\u20134):143\u2013156","journal-title":"J Discrete Algorithm"},{"key":"553_CR16","unstructured":"Manber U, Myers G (1990) Suffix arrays: a new method for on-line string searches. In: Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pp 319\u2013327"},{"key":"553_CR17","doi-asserted-by":"crossref","unstructured":"Weiner P (1973) Linear pattern matching algorithms. In: Proceedings of the 14th annual symposium on switching and automata theory, pp 1\u201311","DOI":"10.1109\/SWAT.1973.13"},{"key":"553_CR18","doi-asserted-by":"crossref","unstructured":"Chen Y-S, Cheng C-H, Tsai W-L (2014) Modeling fitting-function-based fuzzy time series patterns for evolving stock index forecasting. Applied intelligence","DOI":"10.1007\/s10489-014-0520-6"},{"issue":"1","key":"553_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-007-0063-1","volume":"29","author":"D Bao","year":"2008","unstructured":"Bao D (2008) A generalized model for financial time series representation and prediction. Appl Intell 29(1):1\u201311","journal-title":"Appl Intell"},{"issue":"7","key":"553_CR20","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TKDE.2005.114","volume":"17","author":"MG Elfeky","year":"2005","unstructured":"Elfeky M G, Aref W G, Elmagarmid A K (2005) Periodicity detection in time series databases. IEEE Trans Knowl Data Eng 17(7):875\u2013887","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"553_CR21","doi-asserted-by":"crossref","unstructured":"Rasheed F, Alhajj R (2008) Using suffix trees for periodicity detection in time series databases. In: Proceedings of the IEEE international conference on intelligent systems","DOI":"10.1109\/IS.2008.4670501"},{"issue":"3","key":"553_CR22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10489-008-0144-9","volume":"32","author":"F Rasheed","year":"2010","unstructured":"Rasheed F, Alhajj R (2010) STNR: a suffix tree based noise resilient algorithm for periodicity detection in time series databases. Appl Intell 32(3):267\u2013278","journal-title":"Appl Intell"},{"issue":"1","key":"553_CR23","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TKDE.2005.3","volume":"17","author":"C-F Cheung","year":"2005","unstructured":"Cheung C-F, Yu J X, Lu H (2005) Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Trans Knowl Data Eng 17(1):90\u2013105","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"553_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on strings, trees, and sequences. Cambridge Univesity Press, Cambridge"},{"issue":"2","key":"553_CR25","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EMM Creight","year":"1976","unstructured":"Creight EMM (1976) A space-economical suffix tree construction algorithm. J ACM 23(2):262\u2013272","journal-title":"J ACM"},{"key":"553_CR26","doi-asserted-by":"crossref","unstructured":"Ukkonen E (1995) Online construction of suffix trees. Algorithmica 14(3):249\u2013260","DOI":"10.1007\/BF01206331"},{"issue":"3.4","key":"553_CR27","first-page":"24","volume":"12","author":"R Dementiev","year":"2008","unstructured":"Orlandi A, Venturini R (2011) Space-efficient substring occurrence estimation. In: Proceedings of the 30th principles of database systems PODS, pp 95\u2013106","journal-title":"J Exp Algorithmics"},{"key":"553_CR28","doi-asserted-by":"crossref","unstructured":"Dementiev R, Karkkainen J, Mehnert J, Sanders P (2008) Better external memory suffix array construction. J Exp Algorithmics 12(3.4):24","DOI":"10.1145\/1227161.1402296"},{"key":"553_CR29","doi-asserted-by":"crossref","unstructured":"Kim DK, Sim JS, Park H, Park K (2003) Linear-time construction of suffix arrays (Extended Abstract). In: Baeza-Yates R, Ch\u00e1vez E, Crochemore M (eds) Combinatorial pattern matching, pp 186\u2013199","DOI":"10.1007\/3-540-44888-8_14"},{"key":"553_CR30","doi-asserted-by":"crossref","unstructured":"Wong SS, Sung WK, Wong L (2007) CPS-tree: a compact partitioned suffix tree for disk-based indexing on large genome sequences. In: Proceedings of the IEEE 2007 international conference on data engineering, pp 1350\u20131354","DOI":"10.1109\/ICDE.2007.369009"},{"key":"553_CR31","unstructured":"Han J, Yin Y, Dong G (1999) Efficient mining of partial periodic patterns in time series database. In: Proceedings of the 15th IEEE international conference on data engineering: 106"},{"key":"553_CR32","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2012) Pattern detection and analysis in financial time series using suffix arrays. In: Doumpos M, Zopounidis C, Pardalos P M (eds) Financial decision making using computational intelligence. Springer, pp 123\u2013152","DOI":"10.1007\/978-1-4614-3773-4_5"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0553-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0553-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0553-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T01:46:13Z","timestamp":1565747173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0553-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,23]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0553-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,23]]}}}