{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:09:41Z","timestamp":1774620581225,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T00:00:00Z","timestamp":1412208000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00778-014-0370-1","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T18:35:11Z","timestamp":1412188511000},"page":"871-893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["ACME: A scalable parallel system for extracting frequent patterns from a very long sequence"],"prefix":"10.1007","volume":"23","author":[{"given":"Majed","family":"Sahli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Essam","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,2]]},"reference":[{"issue":"4","key":"370_CR1","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/TCBB.2008.123","volume":"7","author":"A Apostolico","year":"2010","unstructured":"Apostolico, A., Comin, M., Parida, L.: VARUN: discovering extensible motifs under saturation constraints. IEEE\/ACM Trans. Comput. Biol. Bioinform. 7(4), 752\u2013762 (2010)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"14","key":"370_CR2","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/btp321","volume":"25","author":"V Becher","year":"2009","unstructured":"Becher, V., Deymonnaz, A., Heiber, P.: Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinformatics 25(14), 1746\u201353 (2009)","journal-title":"Bioinformatics"},{"key":"370_CR3","doi-asserted-by":"crossref","unstructured":"Carvalho, A.M., Oliveira, A.L., Freitas, A.T., Sagot, M.F.: A parallel algorithm for the extraction of structured motifs. In: Proceedings of the ACM Symposium on Applied Computing (SAC), pp. 147\u2013153 (2004)","DOI":"10.1145\/967900.967932"},{"key":"370_CR4","doi-asserted-by":"crossref","unstructured":"Challa, S., Thulasiraman, P.: Protein sequence motif discovery on distributed supercomputer. In: Proceedings of the International Conference on Advances in Grid and Pervasive Computing (GPC), pp. 232\u2013243 (2008)","DOI":"10.1007\/978-3-540-68083-3_24"},{"key":"370_CR5","doi-asserted-by":"crossref","unstructured":"Das, M.K., Dai, H.K.: A survey of DNA motif finding algorithms. BMC Bioinform. 8(S-7), S21 (2007)","DOI":"10.1186\/1471-2105-8-S7-S21"},{"key":"370_CR6","doi-asserted-by":"crossref","unstructured":"Dasari, N.S., Desh, R., Zubair, M.: An efficient multicore implementation of planted motif problem. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS), pp. 9\u201315 (2010)","DOI":"10.1109\/HPCS.2010.5547161"},{"key":"370_CR7","doi-asserted-by":"crossref","unstructured":"Dasari, N.S., Ranjan, D., Zubair, M.: High performance implementation of planted motif problem using suffix trees. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS), pp. 200\u2013206 (2011)","DOI":"10.1109\/HPCSim.2011.5999825"},{"issue":"43","key":"370_CR8","doi-asserted-by":"crossref","first-page":"4391","DOI":"10.1016\/j.tcs.2009.07.020","volume":"410","author":"M Federico","year":"2009","unstructured":"Federico, M., Pisanti, N.: Suffix tree characterization of maximal motifs in biological sequences. Theor. Comput. Sci. 410(43), 4391\u20134401 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"370_CR9","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TKDE.2011.69","volume":"23","author":"A Floratou","year":"2011","unstructured":"Floratou, A., Tata, S., Patel, J.M.: Efficient and accurate discovery of patterns in sequence data sets. IEEE Trans. Knowl. Data Eng. 23(8), 1154\u20131168 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"370_CR10","doi-asserted-by":"crossref","unstructured":"Grossi, R., Pietracaprina, A., Pisanti, N., Pucci, G., Upfal, E., Vandin, F., Salzberg, S., Warnow, T.: MADMX: a novel strategy for maximal dense motif extraction. In: Proceedings of Workshop on Algorithms in Bioinformatics, pp. 362\u2013374 (2009)","DOI":"10.1007\/978-3-642-04241-6_30"},{"key":"370_CR11","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"370_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"370_CR13","unstructured":"Huang, E., Yang, L., Chowdhary, R., Kassim, A., Bajic, V.B.: An algorithm for ab initio dna motif detection. Inf. Process. Living Syst. 2, 611\u2013614 (2005)"},{"issue":"4","key":"370_CR14","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/TCBB.2010.92","volume":"8","author":"CW Huang","year":"2011","unstructured":"Huang, C.W., Lee, W.S., Hsieh, S.Y.: An improved heuristic algorithm for finding motif signals in DNA sequences. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(4), 959\u2013975 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"370_CR15","volume-title":"Queueing Systems, vol. I: Theory","author":"L Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems, vol. I: Theory. Wiley, New York (1975)"},{"key":"370_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Y., Schmidt, B., Maskell, D.L.: An ultrafast scalable many-core motif discovery algorithm for multiple gpus. In: Proceedings of the International Symposium on Parallel and Distributed Processing, pp. 428\u2013434 (2011)","DOI":"10.1109\/IPDPS.2011.183"},{"issue":"1","key":"370_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Comput. Surv. 43(1), 1\u201341 (2010)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"370_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.14778\/2047485.2047490","volume":"5","author":"E Mansour","year":"2011","unstructured":"Mansour, E., Allam, A., Skiadopoulos, S., Kalnis, P.: Era: efficient serial and parallel suffix tree construction for very long strings. Proc. VLDB Endow. 5(1), 49\u201360 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"370_CR19","doi-asserted-by":"crossref","unstructured":"Marchand, B., Bajic, V.B., Kaushik, D.K.: Highly scalable ab initio genomic motif identification. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp. 56:1\u201356:10 (2011)","DOI":"10.1145\/2063384.2063459"},{"issue":"3\u20134","key":"370_CR20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol. 7(3\u20134), 345\u2013362 (2000)","journal-title":"J. Comput. Biol."},{"key":"370_CR21","unstructured":"Meisner, D., Wenisch, T.F.: Stochastic queuing simulation for data center workloads. In: Exascale Evaluation and Research Techniques Workshop (2010)"},{"key":"370_CR22","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E.: Online discovery and maintenance of time series motifs. In: Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 1089\u20131098 (2010)","DOI":"10.1145\/1835804.1835941"},{"key":"370_CR23","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A Papoulis","year":"2002","unstructured":"Papoulis, A., Pillai, S.U.: Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York (2002)"},{"key":"370_CR24","doi-asserted-by":"crossref","unstructured":"Sagot, M.F.: Spelling approximate repeated or common motifs using a suffix tree. In: Proceedings of 3rd Latin American Symposium on Theoretical Informatics, pp. 374\u2013390 (1998)","DOI":"10.1007\/BFb0054337"},{"key":"370_CR25","doi-asserted-by":"crossref","unstructured":"Sahli, M., Mansour, E., Kalnis, P.: Parallel motif extraction from very long sequences. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM) (2013)","DOI":"10.1145\/2505515.2505575"},{"issue":"1(3)","key":"370_CR26","first-page":"29","volume":"7","author":"K Saxena","year":"2010","unstructured":"Saxena, K., Shukla, R.: Significant interval and frequent pattern discovery in web log data. Int. J. Comput. Sci. Issues 7(1(3)), 29\u201336 (2010)","journal-title":"Int. J. Comput. Sci. Issues"},{"issue":"1\u20132","key":"370_CR27","doi-asserted-by":"crossref","first-page":"460","DOI":"10.14778\/1920841.1920902","volume":"3","author":"J Schad","year":"2010","unstructured":"Schad, J., Dittrich, J., Quian\u00e9-Ruiz, J.A.: Runtime measurements in the cloud: observing, analyzing, and reducing variance. Proc. VLDB Endow. 3(1\u20132), 460\u2013471 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"370_CR28","doi-asserted-by":"crossref","unstructured":"Tsirogiannis, D., Koudas, N.: Suffix tree construction algorithms on modern hardware. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 263\u2013274 (2010)","DOI":"10.1145\/1739041.1739075"},{"issue":"3","key":"370_CR29","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"},{"issue":"17","key":"370_CR30","doi-asserted-by":"crossref","first-page":"7145","DOI":"10.1073\/pnas.0701811104","volume":"104","author":"X Xie","year":"2007","unstructured":"Xie, X., Mikkelsen, T.S., Gnirke, A., Lindblad-Toh, K., Kellis, M., Lander, E.S.: Systematic discovery of regulatory motifs in conserved regions of the human genome, including thousands of ctcf insulator sites. Proc. Natl. Acad. Sci. 104(17), 7145\u20137150 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"370_CR31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.knosys.2010.07.007","volume":"24","author":"U Yun","year":"2011","unstructured":"Yun, U., Ryu, K.H.: Approximate weighted frequent pattern mining with\/without noisy environments. Knowl. Based Syst. 24(1), 73\u201382 (2011)","journal-title":"Knowl. Based Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-014-0370-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0370-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T16:47:13Z","timestamp":1650300433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-014-0370-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,2]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s00778-014-0370-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,2]]}}}