{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:03:46Z","timestamp":1725566626121},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265436"},{"type":"electronic","value":"9783540318941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11504245_8","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T18:40:01Z","timestamp":1285440001000},"page":"115-134","source":"Crossref","is-referenced-by-count":3,"title":["Boolean Property Encoding for Local Set Pattern Discovery: An Application to Gene Expression Data Analysis"],"prefix":"10.1007","author":[{"given":"Ruggero G.","family":"Pensa","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1126\/science.278.5338.680","volume":"278","author":"J. DeRisi","year":"1997","unstructured":"DeRisi, J., Iyer, V., Brown, P.: Exploring the metabolic and genetic control of gene expression on a genomic scale. Science\u00a0278, 680\u2013686 (1997)","journal-title":"Science"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1126\/science.270.5235.484","volume":"270","author":"V. Velculescu","year":"1995","unstructured":"Velculescu, V., Zhang, L., Vogelstein, B., Kinzler, K.: Serial analysis of gene expression. Science\u00a0270, 484\u2013487 (1995)","journal-title":"Science"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Piatetsky-Shapiro, G., Tamayo, P. (eds.): Special issue on microrray data mining. SIGKDD Explorations\u00a05(2) (2003)","DOI":"10.1145\/980972.980974"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"14863","DOI":"10.1073\/pnas.95.25.14863","volume":"95","author":"M. Eisen","year":"1998","unstructured":"Eisen, M., Spellman, P., Brown, P., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. Proc. Natl. Acad. Sci. USA\u00a095, 14863\u201314868 (1998)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1038\/990025","volume":"402","author":"C. Niehrs","year":"1999","unstructured":"Niehrs, C., Pollet, N.: Synexpression groups in eukaryotes. Nature\u00a0402, 483\u2013487 (1999)","journal-title":"Nature"},{"key":"8_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS (LNAI), vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"8_CR7","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET an efficient algorithm for mining frequent closed itemsets. In: Proceedings ACM SIGMOD Workshop DMKD 2000, Dallas, USA, pp. 21\u201330 (2000)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithm for closed itemset mining. In: Proccedings SIAM DM 2002, Arlington, USA (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Becquet, C., Blachon, S., Jeudy, B., Boulicaut, J.F., Gandrillon, O.: Strongassociation- rule mining for large-scale gene-expression data analysis: a case study on human sage data. Genome Biology\u00a012 (2002)","DOI":"10.1186\/gb-2002-3-12-research0067"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/bioinformatics\/19.1.79","volume":"19","author":"C. Creighton","year":"2003","unstructured":"Creighton, C., Hanash, S.: Mining gene expression databases for association rules. Bioinformatics\u00a019, 79\u201386 (2003)","journal-title":"Bioinformatics"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445\u2013470. Reidel (1982)","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Rioult, F., Boulicaut, J.F., Cr\u00e9milleux, B., Besson, J.: Using transposition for pattern discovery from microarray data. In: Proceedings ACM SIGMODWorkshop DMKD 2003, San Diego (USA), pp. 73\u201379 (2003)","DOI":"10.1145\/882082.882099"},{"key":"8_CR13","unstructured":"Rioult, F., Robardet, C., Blachon, S., Cr\u00e9milleux, B., Gandrillon, O., Boulicaut, J.F.: Mining concepts from large sage gene expression matrices. In: Proceedings KDID 2003 co-located with ECML-PKDD 2003, Catvat-Dubrovnik (Croatia), pp. 107\u2013118 (2003)"},{"key":"8_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-540-24775-3_73","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Besson","year":"2004","unstructured":"Besson, J., Robardet, C., Boulicaut, J.F.: Constraint-based mining of formal concepts in transactional data. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 615\u2013624. Springer, Heidelberg (2004)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Besson, J., Robardet, C., Boulicaut, J.F., Rome, S.: Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis Journal\u00a09 (2004) (to appear)","DOI":"10.3233\/IDA-2005-9105"},{"key":"8_CR16","unstructured":"Pensa, R.G., Leschi, C., Besson, J., Boulicaut, J.F.: Assessment of discretization techniques for relevant pattern discovery from gene expression data. In: Proceedings ACM BIOKDD 2004 co-located with SIGKDD 2004, Seattle, USA, pp. 24\u201330 (2004)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Parthasarathy, S.: Efficient progressive sampling for association rules. In: Proceedings IEEE ICDM 2002, Maebashi City, Japan, pp. 354\u2013361 (2002)","DOI":"10.1109\/ICDM.2002.1183923"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0022-5193(73)90251-8","volume":"38","author":"G.W. Moore","year":"1973","unstructured":"Moore, G.W., Goodman, M., Barnabas, J.: An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. Journal of Theoretical Biology\u00a038, 423\u2013457 (1973)","journal-title":"Journal of Theoretical Biology"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(71)90020-7","volume":"11","author":"D.F. Robinsons","year":"1971","unstructured":"Robinsons, D.F.: Comparison of labeled trees with valency three. Journal of Combinatorial Theory, Series B\u00a011, 105\u2013119 (1971)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"8_CR20","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proceedings ACM-SIAM SODA 1997, vol.\u00a055, pp. 427\u2013436 (1997)"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1090\/dimacs\/055\/09","volume-title":"Discrete mathematical problems with medical applications","author":"B. DasGupta","year":"2000","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On computing the nearest neighbor interchange distance. In: Discrete mathematical problems with medical applications, New Brunswick, NJ, 1999, pp. 125\u2013143. Amer. Math. Soc., Providence (2000)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C. Finden","year":"1985","unstructured":"Finden, C., Gordon, A.: Obtaining common pruned trees. Journal of Classification\u00a02, 255\u2013276 (1985)","journal-title":"Journal of Classification"},{"key":"8_CR23","unstructured":"Cole, R., Hariharan, R.: An o(n log n) algorithm for the maximum agreement subtree problem for binary trees. In: Proceedings of the 7th annual ACM-SIAM symposium on Discrete algorithms, Atlanta, Georgia, United States, pp. 323\u2013332 (1996)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pbio.0000005","volume":"1","author":"Z. Bozdech","year":"2003","unstructured":"Bozdech, Z., Llin\u00e1s, M., Pulliam, B.L., Wong, E., Zhu, J., DeRisi, J.: The transcriptome of the intraerythrocytic developmental cycle of plasmodium falciparum. PLoS Biology\u00a01, 1\u201316 (2003)","journal-title":"PLoS Biology"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1126\/science.1072152","volume":"297","author":"M. Arbeitman","year":"2002","unstructured":"Arbeitman, M., Furlong, E., Imam, F., Johnson, E., Null, B., Baker, B., Krasnow, M., Scott, M., Davis, R., White, K.: Gene expression during the life cycle of drosophila melanogaster. Science\u00a0297, 2270\u20132275 (2002)","journal-title":"Science"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1101\/gr.10.7.1051","volume":"10","author":"A. Lash","year":"2000","unstructured":"Lash, A., Tolstoshev, C., Wagner, L., Schuler, G., Strausberg, R., Riggins, G., Altschul, S.: SAGEmap: A public gene expression resource. Genome Research\u00a010, 1051\u20131060 (2000)","journal-title":"Genome Research"}],"container-title":["Lecture Notes in Computer Science","Local Pattern Detection"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11504245_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T19:38:12Z","timestamp":1711827492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11504245_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265436","9783540318941"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11504245_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}