{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:30:59Z","timestamp":1794342659013,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540453741","type":"print"},{"value":"9783540460480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11871637_17","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T07:09:53Z","timestamp":1158649793000},"page":"139-150","source":"Crossref","is-referenced-by-count":28,"title":["Optimal String Mining Under Frequency Constraints"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volker","family":"Heun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Birzele, F., Kramer, S.: A new representation for protein secondary structure prediction based on frequent patterns. Bioinformatics (submitted)","DOI":"10.1093\/bioinformatics\/btl453"},{"key":"17_CR2","first-page":"609","volume-title":"Proc. ICDM","author":"J. Fischer","year":"2005","unstructured":"Fischer, J., Kramer, S., Heun, V.: Fast frequent string mining using suffix arrays. In: Proc. ICDM, pp. 609\u2013612. IEEE Computer Society, Los Alamitos (2005)"},{"key":"17_CR3","first-page":"66","volume-title":"Information Retrieval: Data Structures and Algorithms","author":"G.H. Gonnet","year":"1992","unstructured":"Gonnet, G.H., Baeza-Yates, R.A., Snider, T.: New indices for text: PAT trees and PAT arrays. In: Frakes, W.B., Baeza-Yates, R.A. (eds.) Information Retrieval: Data Structures and Algorithms, pp. 66\u201382. Prentice-Hall, Englewood Cliffs (1992)"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O. Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput.\u00a022(2), 221\u2013242 (1993)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11780441_5","volume-title":"Combinatorial Pattern Matching","author":"J. Fischer","year":"2006","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"key":"17_CR8","first-page":"126","volume-title":"Proc. COMPSAC - Workshops and Fast Abstracts","author":"L. Wang","year":"2004","unstructured":"Wang, L., Zhao, H., Dong, G., Li, J.: On the complexity of finding emerging patterns. In: Proc. COMPSAC - Workshops and Fast Abstracts, pp. 126\u2013129. IEEE Press, Los Alamitos (2004)"},{"key":"17_CR9","first-page":"119","volume-title":"Proc. DASFAA","author":"S. Chan","year":"2003","unstructured":"Chan, S., Kao, B., Yip, C.L., Tang, M.: Mining emerging substrings. In: Proc. DASFAA, pp. 119\u2013126. IEEE Computer Society, Los Alamitos (2003)"},{"key":"17_CR10","first-page":"123","volume-title":"Proc. ICDM","author":"L. Raedt De","year":"2002","unstructured":"De Raedt, L., J\u00e4ger, M., Lee, S.D., Mannila, H.: A theory of inductive query answering. In: Proc. ICDM, pp. 123\u2013130. IEEE Computer Society, Los Alamitos (2002)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-31841-5_7","volume-title":"Knowledge Discovery in Inductive Databases","author":"S.D. Lee","year":"2005","unstructured":"Lee, S.D., De Raedt, L.: An efficient algorithm for mining string databases under constraints. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 108\u2013129. Springer, Heidelberg (2005)"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"Proc. KDD","author":"G. Dong","year":"1999","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: Proc. KDD, pp. 43\u201352. ACM Press, New York (1999)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"17_CR14","first-page":"77","volume-title":"Proceedings of ALENEX\/ANALCO","author":"K.B. Sch\u00fcrmann","year":"2005","unstructured":"Sch\u00fcrmann, K.B., Stoye, J.: An incomplex algorithm for fast suffix array construction. In: Proceedings of ALENEX\/ANALCO, pp. 77\u201385. SIAM Press, Philadelphia (2005)"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica\u00a040(1), 33\u201350 (2004)","journal-title":"Algorithmica"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Algorithm Theory - SWAT 2004","author":"G. Manzini","year":"2004","unstructured":"Manzini, G.: Two space saving tricks for linear time lcp array computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 372\u2013383. Springer, Heidelberg (2004)"},{"key":"17_CR17","first-page":"487","volume":"194","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph, Dokl. Acad. Nauk. SSSR\u00a0194, 487\u2013488 (1970) (in Russian); English translation in Soviet Math. Dokl. 11, 1209\u20131210 (1975)","journal-title":"Dokl. Acad. Nauk. SSSR"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","first-page":"230","volume-title":"Combinatorial Pattern Matching","author":"L.C.K. Hui","year":"1992","unstructured":"Hui, L.C.K.: Color set size problem with application to string matching. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 230\u2013243. Springer, Heidelberg (1992)"},{"key":"17_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"13","key":"17_CR21","doi-asserted-by":"publisher","first-page":"3822","DOI":"10.1093\/nar\/gkg516","volume":"31","author":"I.Q.H. Phan","year":"2003","unstructured":"Phan, I.Q.H., Pilbout, S.F., Fleischmann, W., Bairoch, A.: NEWT, a new taxonomy portal. Nucleic Acids Res.\u00a031(13), 3822\u20133823 (2003)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11871637_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:47Z","timestamp":1619493827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11871637_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540453741","9783540460480"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11871637_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11871637","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}