{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:35Z","timestamp":1742914055241,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290374"},{"type":"electronic","value":"9783642290381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_34","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"470-481","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithm for Mining Correlated Protein-DNA Binding Cores"],"prefix":"10.1007","author":[{"given":"Po-Yuen","family":"Wong","sequence":"first","affiliation":[]},{"given":"Tak-Ming","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Man-Hon","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Kwong-Sak","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proc. 1995 Int. Conf. Very Large Data Bases, pp. 432\u2013443 (1995)","key":"34_CR1"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R.C. Agarwal","year":"2001","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A Tree Projection Algorithm for Generation of Frequent Item Sets. Journal of Parallel and Distributed Computing\u00a061(3), 350\u2013371 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Record\u00a022, 207\u2013216 (1993)","journal-title":"ACM SIGMOD Record"},{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, vol.\u00a01215, pp. 487\u2013499. Citeseer (1994)","key":"34_CR4"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, pp. 3\u201314. IEEE (1995)","key":"34_CR5","DOI":"10.1109\/ICDE.1995.380415"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/775047.775109","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Ayres","year":"2002","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 429\u2013435. ACM, New York (2002)"},{"unstructured":"Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pp. 28\u201336 (1994)","key":"34_CR7"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253262.253325","volume":"26","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. SIGMOD Rec.\u00a026, 255\u2013264 (1997)","journal-title":"SIGMOD Rec."},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1093\/bioinformatics\/btq682","volume":"27","author":"T.M. Chan","year":"2011","unstructured":"Chan, T.M., Wong, K.C., Lee, K.H., Wong, M.H., Lau, C.K., Tsui, S.K., Leung, K.S.: Discovering approximate associated sequence patterns for protein DNA interactions. Bioinformatics\u00a027(4), 471\u2013478 (2011)","journal-title":"Bioinformatics"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1145\/502585.502665","volume-title":"Proceedings of the Tenth International Conference on Information and Knowledge Management, CIKM 2001","author":"A. Das","year":"2001","unstructured":"Das, A., Ng, W.K., Woon, Y.K.: Rapid association rule mining. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, CIKM 2001, pp. 474\u2013481. ACM, New York (2001)"},{"issue":"9","key":"34_CR11","doi-asserted-by":"publisher","first-page":"3157","DOI":"10.1093\/nar\/5.9.3157","volume":"5","author":"D.J. Galas","year":"1978","unstructured":"Galas, D.J., Schmitz, A.: Dnaase footprinting a simple method for the detection of protein-dna binding specificity. Nucleic Acids Research\u00a05(9), 3157\u20133170 (1978)","journal-title":"Nucleic Acids Research"},{"issue":"13","key":"34_CR12","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1093\/nar\/9.13.3047","volume":"9","author":"M.M. Garner","year":"1981","unstructured":"Garner, M.M., Revzin, A.: A gel electrophoresis method for quantifying the binding of proteins to specific dna regions: application to components of the escherichia coli lactose operon regulatory system. Nucleic Acids Research\u00a09(13), 3047\u20133060 (1981)","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Record\u00a029(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Record"},{"issue":"5","key":"34_CR14","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1006\/jmbi.1999.2659","volume":"287","author":"S. Jones","year":"1999","unstructured":"Jones, S., van Heyningen, P., Berman, H.M., Thornton, J.M.: Protein-DNA interactions: a structural analysis. Journal of Molecular Biology\u00a0287(5), 877\u2013896 (1999)","journal-title":"Journal of Molecular Biology"},{"issue":"19","key":"34_CR15","doi-asserted-by":"publisher","first-page":"6324","DOI":"10.1093\/nar\/gkq500","volume":"38","author":"K.S. Leung","year":"2010","unstructured":"Leung, K.S., Wong, K.C., Chan, T.M., Wong, M.H., Lee, K.H., Lau, C.K., Tsui, S.K.W.: Discovering protein-DNA binding sequence patterns using association rule mining. Nucleic Acids Research\u00a038(19), 6324\u20136337 (2010)","journal-title":"Nucleic Acids Research"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. Journal of Computer and System Sciences\u00a065, 73\u201396 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"34_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1371\/journal.pcbi.0020036","volume":"2","author":"K.D. MacIsaac","year":"2006","unstructured":"MacIsaac, K.D., Fraenkel, E.: Practical strategies for discovering regulatory DNA sequence motifs. PLoS Comput. Biol.\u00a02(4), e36 (2006)","journal-title":"PLoS Comput Biol"},{"doi-asserted-by":"crossref","unstructured":"MacIsaac, K.D., Fraenkel, E.: Practical strategies for discovering regulatory dna sequence motifs (2006)","key":"34_CR18","DOI":"10.1371\/journal.pcbi.0020036"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1093\/nar\/gkj143","volume":"34","author":"V. Matys","year":"2006","unstructured":"Matys, V., Kel-Margoulis, O.V., Fricke, E., Liebich, I., Land, S., Barre-Dirrie, A., Reuter, I., Chekmenev, D., Krull, M., Hornischer, K., Voss, N., Stegmaier, P., Lewicki-Potapov, B., Saxel, H., Kel, A.E., Wingender, E.: Transfac and its module transcompel: transcriptional gene regulation in eukaryotes. Nucleic Acids Research\u00a034, 108\u2013110 (2006)","journal-title":"Nucleic Acids Research"},{"unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: 3rd Intl. Conf. on Knowledge Discovery and Data Mining, vol.\u00a020, pp. 283\u2013286 (1997)","key":"34_CR20"},{"issue":"2","key":"34_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"J. Park","year":"1995","unstructured":"Park, J., Chen, M., Yu, P.: An effective hash-based algorithm for mining association rules. ACM SIGMOD Record\u00a024(2), 175\u2013186 (1995)","journal-title":"ACM SIGMOD Record"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207","volume":"17","author":"G. Pavesi","year":"2001","unstructured":"Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics\u00a017, S207\u2013S214 (2001)","journal-title":"Bioinformatics"},{"unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: ICCCN, p. 215. IEEE Computer Society (2001)","key":"34_CR23"},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M.-F. Sagot","year":"1998","unstructured":"Sagot, M.-F.: Spelling Approximate Repeated or Common Motifs using a Suffix Tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 374\u2013390. Springer, Heidelberg (1998)"},{"issue":"suppl.1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1093\/bioinformatics\/bti1043","volume":"21","author":"A.D. Smith","year":"2005","unstructured":"Smith, A.D., Sumazin, P., Das, D., Zhang, M.Q.: Mining chip-chip data for transcription factor and cofactor binding sites. Bioinformatics\u00a021(suppl.1), i403\u2013i412 (2005)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Advances in Database Technology XEDBT 1996, pp. 1\u201317 (1996)","key":"34_CR26","DOI":"10.1007\/BFb0014140"},{"key":"34_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-47887-6_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K. Wang","year":"2002","unstructured":"Wang, K., Tang, L., Han, J., Liu, J.: Top Down FP-Growth for Association Rule Mining. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 334\u2013340. Springer, Heidelberg (2002)"},{"key":"34_CR28","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1145\/1031171.1031209","volume-title":"Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management","author":"K. Wang","year":"2004","unstructured":"Wang, K., Xu, Y., Yu, J.: Scalable sequential pattern mining for biological sequences. In: Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management, pp. 178\u2013187. ACM, New York (2004)"},{"issue":"3","key":"34_CR29","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M. Zaki","year":"2000","unstructured":"Zaki, M.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"unstructured":"Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. In: Machine Learning, pp. 375\u2013386 (2001)","key":"34_CR30"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:06Z","timestamp":1742911746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}