{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T08:14:21Z","timestamp":1772525661276,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T00:00:00Z","timestamp":1220486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10489-008-0144-9","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T10:59:18Z","timestamp":1220439558000},"page":"267-278","source":"Crossref","is-referenced-by-count":24,"title":["STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases"],"prefix":"10.1007","volume":"32","author":[{"given":"Faraz","family":"Rasheed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reda","family":"Alhajj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,4]]},"reference":[{"key":"144_CR1","unstructured":"Indyk P, Koudas N, Muthukrishnan S (2000) Identifying representative trends in massive time series data sets using sketches. In: Proceedings of the international conference on very large data bases, Sept 2000"},{"issue":"7","key":"144_CR2","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TKDE.2005.114","volume":"17","author":"MG Elfeky","year":"2005","unstructured":"Elfeky MG, Aref WG, Elmagarmid AK (2005) Periodicity detection in time series databases. IEEE Trans Knowl Data Eng 17(7):875\u2013887","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"144_CR3","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 University Press, Cambridge"},{"key":"144_CR4","volume-title":"Time series prediction: forecasting the future and understanding the past","author":"A Weigend","year":"1994","unstructured":"Weigend A, Gershenfeld N (1994) Time series prediction: forecasting the future and understanding the past. Addison-Wesley, Reading"},{"issue":"3","key":"144_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E (1995) Online construction of suffix trees. Algorithmica 14(3):249\u2013260","journal-title":"Algorithmica"},{"key":"144_CR6","unstructured":"Ma S, Hellerstein J (2001) Mining partially periodic event patterns with unknown periods. In: Proceedings of IEEE international conference on data engineering, Apr 2001"},{"key":"144_CR7","doi-asserted-by":"crossref","unstructured":"Yang J, Wang W, Yu P (2002) InfoMiner+: Mining partial periodic patterns with gap penalties. In: Proceedings of IEEE international conference on data mining, Dec 2002","DOI":"10.1109\/ICDM.2002.1184039"},{"key":"144_CR8","unstructured":"Berberidis C, Aref W, Atallah M, Vlahavas I, Elmagarmid A (2002) Multiple and partial periodicity mining in time series databases. In: Proceedings of the European conf, artificial intelligence, Jul 2002"},{"key":"144_CR9","unstructured":"Grossi R, Italiano GF (1993) Suffix trees and their applications in string algorithms. In: Proceedings of South American workshop on string processing, Sep 1993, pp 57\u201376"},{"key":"144_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/174652.174653","volume":"14","author":"M Dubiner","year":"1994","unstructured":"Dubiner M et al. (1994) Faster tree pattern matching. J Assoc Comput Mach 14:205\u2013213","journal-title":"J Assoc Comput Mach"},{"key":"144_CR11","doi-asserted-by":"crossref","unstructured":"Kolpakov R, Kucherov G (1999) Finding maximal repetitions in a word in linear time. In: Proceedings of the annual symposium on foundations of computer science, pp 596\u2013604","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"144_CR12","doi-asserted-by":"crossref","unstructured":"Al-Rawi A, Lansari A, Bouslama F (2003) A new non-recursive algorithm for binary search tree traversal. In: Proceedings of IEEE international conference on electronics, circuits and systems, vol\u00a02, pp 770\u2013773, UAE, Dec 2003","DOI":"10.1109\/ICECS.2003.1301900"},{"key":"144_CR13","doi-asserted-by":"crossref","unstructured":"Elfeky MG, Aref WG, Elmagarmid AK (2005) WARP: time warping for periodicity detection. In: Proceedings of IEEE international conference on data mining, pp 138\u2013145","DOI":"10.1109\/ICDM.2005.152"},{"key":"144_CR14","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Brockwell A, Faloutsos C (2003) Adaptive, hands off-stream mining. In: Proceedings of the international conference on very large databases","DOI":"10.1016\/B978-012722442-8\/50056-2"},{"key":"144_CR15","series-title":"LNCS series","volume-title":"Proceedings of the international conference on intelligent data engineering and automated learning","author":"F Rasheed","year":"2007","unstructured":"Rasheed F, Alshalalfa M, Alhajj R (2007) Adapting machine learning technique for periodicity detection in nucleosomal locations in sequences. In: Proceedings of the international conference on intelligent data engineering and automated learning, IDEAL\u201907, Dec 2007, Birmingham, UK. LNCS series. Springer, Berlin"},{"key":"144_CR16","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhou L, Feng J, Wang J, Liu Z-Q (2006) Mining complex time-series data by learning Markovian models. In: Proceedings of IEEE international conference on data mining, pp 1136\u20131140","DOI":"10.1109\/ICDM.2006.105"},{"key":"144_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1186\/1471-2105-6-117","volume":"6","author":"M Ahdesm\u00e4ki","year":"2005","unstructured":"Ahdesm\u00e4ki M, L\u00e4hdesm\u00e4ki H, Pearson R, Huttunen H, Yli-Harja\u00a0O (2005) Robust detection of periodic time series measured from biological systems. BMC Bioinformatics 6:117","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"144_CR18","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1093\/bioinformatics\/bti789","volume":"22","author":"EF Glynn","year":"2006","unstructured":"Glynn EF, Chen J, Mushegian AR (2006) Detecting periodic patterns in unevenly spaced gene expression time series using Lomb\u2013Scargle periodograms. Bioinformatics 22(3):310\u2013316","journal-title":"Bioinformatics"},{"issue":"1","key":"144_CR19","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 JX, 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"},{"issue":"3","key":"144_CR20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00778-005-0154-8","volume":"14","author":"Y Tian","year":"2005","unstructured":"Tian Y, Tata S, Hankins RA, Patel JM (2005) Practical methods for constructing suffix trees. VLDB J 14(3):281\u2013299","journal-title":"VLDB J"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0144-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0144-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0144-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:42Z","timestamp":1559139942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0144-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,4]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["144"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0144-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,4]]}}}