{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T04:55:57Z","timestamp":1764046557698},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,5]],"date-time":"2016-04-05T00:00:00Z","timestamp":1459814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10489-016-0766-2","type":"journal-article","created":{"date-parts":[[2016,4,5]],"date-time":"2016-04-05T04:10:25Z","timestamp":1459829425000},"page":"567-597","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Repeated patterns detection in big data using classification and parallelism on LERP Reduced Suffix Arrays"],"prefix":"10.1007","volume":"45","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":[[2016,4,5]]},"reference":[{"key":"766_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A Apostolico","year":"1983","unstructured":"Apostolico A, Preparata FP (1983) Optimal off-line detection of repetitions in a string. Theor Comput Sci 22:297\u2013315","journal-title":"Theor Comput Sci"},{"issue":"3","key":"766_CR2","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/0196-6774(92)90049-I","volume":"13","author":"A Apostolico","year":"1992","unstructured":"Apostolico A, Szpankowski W (1992) Self-alignment in words and their applications. J Algorithms 13 (3):446\u2013467","journal-title":"J Algorithms"},{"key":"766_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF03019651","volume":"27","author":"E Borel","year":"1909","unstructured":"Borel E (1909) Les probabilit\u00e9s d\u00e9nombrables et leurs applications arithm\u00e9tiques. Rend Circ Mat Palermo 27:247\u2013271","journal-title":"Rend Circ Mat Palermo"},{"issue":"2","key":"766_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10586458.2001.10504441","volume":"10","author":"DH Bailey","year":"2001","unstructured":"Bailey DH, Crandall RE (2001) On the random character of fundamental constant expansions. Exp Math 10(2):175\u2013190","journal-title":"Exp Math"},{"issue":"4","key":"766_CR5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1080\/10586458.2002.10504704","volume":"11","author":"DH Bailey","year":"2002","unstructured":"Bailey DH, Crandall RE (2002) Random generators and normal numbers. Exp Math 11(4):527\u2013546","journal-title":"Exp Math"},{"issue":"4","key":"766_CR6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1080\/10586458.2012.665333","volume":"21","author":"DH Bailey","year":"2012","unstructured":"Bailey DH, Borwein JM, Calude CS, Dinneen MJ, Dumitrescu M, Yee A (2012) An empirical approach to the NorMality of \u03c0. Exp Math 21(4):375\u2013384","journal-title":"Exp Math"},{"key":"766_CR7","doi-asserted-by":"crossref","unstructured":"Becher V (2012) Turing\u2019s normal numbers: towards randomness. In: Cooper BS, Dawar A, L\u00f6we B (eds) How the world computes: lecture notes in computer science, vol 7318. Springer, pp 35\u201345","DOI":"10.1007\/978-3-642-30870-3_5"},{"key":"766_CR8","unstructured":"Calude C (1994) Borel normality and algorithmic randomness. In: Rozenberg G, Salomaa A (eds) Development in language theory. World Scientif, Singapore, pp 113\u2013129"},{"issue":"1","key":"766_CR9","first-page":"48","volume":"1","author":"C Calude","year":"1995","unstructured":"Calude C (1995) What is a random string? J Univ Sci 1(1):48\u201366","journal-title":"J Univ Sci"},{"issue":"1","key":"766_CR10","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1038\/scientificamerican0788-80","volume":"259","author":"GJ Chaitin","year":"1988","unstructured":"Chaitin GJ (1988) Randomness in arithmetic. Sci Am 259 (1):80\u201385","journal-title":"Sci Am"},{"key":"766_CR11","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1112\/jlms\/s1-8.4.254","volume":"8","author":"D Champernowne","year":"1933","unstructured":"Champernowne D (1933) The construction of decimals normal in the scale of ten. J London Math Soc 8:254\u2013260","journal-title":"J London Math Soc"},{"issue":"2","key":"766_CR12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","volume":"46","author":"A Church","year":"1940","unstructured":"Church A (1940) On the concept of a random sequence. Bull Amer Math Soc 46(2):130\u2013135","journal-title":"Bull Amer Math Soc"},{"key":"766_CR13","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1090\/S0002-9904-1946-08657-7","volume":"52","author":"AH Copeland","year":"1946","unstructured":"Copeland AH, Erdos P (1946) Note on normal numbers. Bull Amer Math Soc 52:857\u2013860","journal-title":"Bull Amer Math Soc"},{"key":"766_CR14","doi-asserted-by":"crossref","unstructured":"Dasgupta A (2011) Mathematical foundations of randomness. In: Gabbay DM, Thagard P, Woods J (eds) Philosophy of statistics. North Holland, Saint Louis, pp 641\u2013710","DOI":"10.1016\/B978-0-444-51862-0.50021-6"},{"key":"766_CR15","doi-asserted-by":"crossref","first-page":"58","DOI":"10.4153\/CJM-1952-005-3","volume":"4","author":"H Davenport","year":"1952","unstructured":"Davenport H, Erdos P (1952) Note on normal decimals. Canad J Math 4:58\u201363","journal-title":"Canad J Math"},{"issue":"1","key":"766_CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L Devroye","year":"1992","unstructured":"Devroye L, Szpankowski W, Rais B (1992) A note on the height of suffix trees. SIAM J Comput 21 (1):48\u201353","journal-title":"SIAM J Comput"},{"issue":"4","key":"766_CR17","first-page":"579","volume":"8","author":"F Franek","year":"2003","unstructured":"Franek F, Smyth WF, Tang Y (2003) Computing all repeats using suffix arrays. J Autom Lang Comb 8(4):579\u2013591","journal-title":"J Autom Lang Comb"},{"key":"766_CR18","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":"766_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10489-012-0394-4","volume":"39","author":"D Guo","year":"2013","unstructured":"Guo D, Hu X, Xie F, Wu X (2013) Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl Intell 39:57\u201374","journal-title":"Appl Intell"},{"key":"766_CR20","unstructured":"Hardy GH, Wright EM (1960) An introduction to the theory of numbers, 4th edn. Oxford University Press"},{"issue":"6","key":"766_CR21","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J Karkkainen","year":"2006","unstructured":"Karkkainen J, Sanders P, Burkhardt S (2006) Linear work suffix array construction. J ACM (JACM) 53(6):918\u2013936","journal-title":"J ACM (JACM)"},{"key":"766_CR22","doi-asserted-by":"crossref","first-page":"5660","DOI":"10.1073\/pnas.80.18.5660","volume":"80","author":"S Karlin","year":"1983","unstructured":"Karlin S, Ghandour G, Ost F, Tavere S, Korn L (1983) New approaches for computer analysis of nucleic acid sequences. Proc Natl Acad Sci USA 80:5660\u20135664","journal-title":"Proc Natl Acad Sci USA"},{"issue":"2006","key":"766_CR23","first-page":"27","volume":"15","author":"D Khoshnevisan","year":"2006","unstructured":"Khoshnevisan D (2006) Normal numbers are normal. Clay Mathematics Institute Annual Report 15(2006):27\u201331","journal-title":"Clay Mathematics Institute Annual Report"},{"key":"766_CR24","doi-asserted-by":"crossref","unstructured":"Ko P, Aluru S (2003) Space efficient linear time construction of suffix arrays. In: Proceedings of the 14th annual conference on Combinatorial pattern matching, pp 200\u2013210","DOI":"10.1007\/3-540-44888-8_15"},{"issue":"2","key":"766_CR25","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.2140\/pjm.1957.7.1163","volume":"7","author":"CT Long","year":"1957","unstructured":"Long CT (1957) Note on normal numbers. Pac J Math 7(2):1163\u20131165","journal-title":"Pac J Math"},{"key":"766_CR26","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"},{"issue":"1","key":"766_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2140\/pjm.1951.1.103","volume":"1","author":"I Niven","year":"1951","unstructured":"Niven I, Zuckerman H (1951) On the definition of normal numbers. Pac J Math 1(1):103\u2013109","journal-title":"Pac J Math"},{"key":"766_CR28","doi-asserted-by":"crossref","unstructured":"Orlandi A, Venturini R (2011) Space-efficient substring occurrence estimation. In: Proceedings of the 30th principles of database systems PODS, pp 95\u2013106","DOI":"10.1145\/1989284.1989300"},{"key":"766_CR29","doi-asserted-by":"crossref","unstructured":"Phoophakdee B, Zaki M (2007) Genome-scale disk-based suffix tree indexing. In: Proceedings of international conference on management of data SIGMOD \u201907, pp 833\u2013844","DOI":"10.1145\/1247480.1247572"},{"key":"766_CR30","unstructured":"Puglishi SJ, Smyth WF, Yusufu M (2008) Fast optimal algorithms for computing all the repeats in a string. In: Proceedings of PSC, pp 161\u2013169"},{"key":"766_CR31","unstructured":"Sch\u00fcrmann KB, 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"},{"key":"766_CR32","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 international conference on management of data SIGMOD \u201908, pp 661\u2013672","DOI":"10.1145\/1376616.1376683"},{"issue":"3","key":"766_CR33","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF03025811","volume":"7","author":"S Wagon","year":"1985","unstructured":"Wagon S (1985) Is Pi normal?. Math Intell 7(3):65\u201367","journal-title":"Math Intell"},{"key":"766_CR34","doi-asserted-by":"crossref","unstructured":"Weiner P Linear pattern matching algorithms. In: SWAT \u201973 proceedings of the 14th annual symposium on switching and automata theory (swat 1973), pp 1\u201311","DOI":"10.1109\/SWAT.1973.13"},{"key":"766_CR35","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10489-013-0499-4","volume":"41","author":"Y Wu","year":"2014","unstructured":"Wu Y, Wang L, Ren J, Ding W, Wu X (2014) Mining sequential patterns with periodic wildcards. Appl Intell 41:99\u2013116","journal-title":"Appl Intell"},{"key":"766_CR36","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2012) Periodicity data mining in time series using suffix arrays. In: Proceedings of IEEE intelligent systems IS\u201912, pp 172\u2013181","DOI":"10.1109\/IS.2012.6335132"},{"key":"766_CR37","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 IEEE international conference in tools with artificial intelligence","DOI":"10.1109\/ICTAI.2012.49"},{"key":"766_CR38","doi-asserted-by":"crossref","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2014) Early DDoS detection based on data mining techniques. In: Proceedings of 8th workshop in information security theory and practice (WISTP), pp 190\u2013199","DOI":"10.1007\/978-3-662-43826-8_15"},{"issue":"3","key":"766_CR39","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s10489-014-0553-x","volume":"41","author":"K Xylogiannopoulos","year":"2014","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2014) Analyzing very large time series using ssuffix arrays. Appl Intell 41(3):941\u2013955","journal-title":"Appl Intell"},{"issue":"2","key":"766_CR40","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/10586458.2013.878674","volume":"23","author":"K Xylogiannopoulos","year":"2014","unstructured":"Xylogiannopoulos K, Karampelas P, Alhajj R (2014) Experimental analysis on the NorMality of \u03c0, e, \u03c6, sqrt(2) using advanced data-mining techniques. Exp Math 23(2):105\u2013128","journal-title":"Exp Math"},{"key":"766_CR41","unstructured":"Yee A (2013) Y-cruncher \u2013 a multi-threaded Pi-program [Online]. Available: http:\/\/www.numberworld.org\/y-cruncher\/"},{"key":"766_CR42","unstructured":"UCLA, (2006, Feb 26). http:\/\/www.lasr.cs.ucla.edu\/ddos\/traces\/public\/attacktrace2\/udp\/"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-016-0766-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0766-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0766-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0766-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:58Z","timestamp":1559139958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-016-0766-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,5]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s10489-016-0766-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,5]]}}}