A. Hasan, V. Chaoji, S. Salem, N. Parimi, and M. J. Zaki, Dmtl: A generic data mining template library, Library-Centric Software Design (LCSD), p.53, 2005.

A. [. Ayouni, S. B. Laurent, P. Yahia, and . Poncelet, Mining Closed Gradual Patterns, International Conference on Artificial Intelligence and Soft Computing (ICAISC), pp.267-274, 2010.
DOI : 10.1007/978-3-642-13208-7_34
URL : https://hal.archives-ouvertes.fr/lirmm-00504029

R. [. Agrawal and . Srikant, Fast algorithms for mining association rules, Very Large Data Base (VLDB), pp.487-499, 1994.

J. [. Agrawal and . Shafer, Parallel mining of association rules, IEEE Transactions on Knowledge and Data Engineering, vol.8, issue.6, pp.962-969, 1996.
DOI : 10.1109/69.553164

T. [. Arimura and . Uno, Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems, SIAM Internal Conference on Data Mining (SDM), pp.1087-1098, 2009.
DOI : 10.1137/1.9781611972795.93

H. [. Boley and . Grosskreutz, A Randomized Approach for Approximating the Number of Frequent Sets, 2008 Eighth IEEE International Conference on Data Mining, 2008.
DOI : 10.1109/ICDM.2008.85

M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Efficient closed pattern mining in strongly accessible set systems, Mining and Learning with Graphs (MLG), 2007.

M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Listing closed sets of strongly accessible set systems with applications to data mining, Theoretical Computer Science, vol.411, issue.3, pp.691-700, 2010.
DOI : 10.1016/j.tcs.2009.10.024

C. [. Blumofe and . Leiserson, Scheduling multithreaded computations by work stealing, 1994.

C. [. Bonchi and . Lucchese, On Closed Constrained Frequent Pattern Mining, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.35-42, 2004.
DOI : 10.1109/ICDM.2004.10093

C. [. Bonchi and . Lucchese, Extending the state-of-the-art of constraint-based pattern discovery, Data & Knowledge Engineering, vol.60, issue.2, pp.377-399, 2007.
DOI : 10.1016/j.datak.2006.02.006

S. [. Buehrer, Y. Parthasarathy, and . Chen, Adaptive Parallel Graph Mining for CMP Architectures, Sixth International Conference on Data Mining (ICDM'06), pp.97-106, 2006.
DOI : 10.1109/ICDM.2006.15

A. [. Di-jorio, M. Laurent, and . Teisseire, Mining frequent gradual itemsets from large databases Advances in Intelligent Data Analysis VIII, pp.297-308, 2009.

A. [. Do, A. Laurent, and . Termier, Pglcm: Efficient parallel mining of closed frequent gradual itemsets, International Conference on Data Mining (ICDM), pp.138-147, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-01381085

S. Emteu and M. Tchuente, Jean-François Méhaut, and Alexandre Termier . Vers un partage de travail adapté a la hierachie de cache, 2010.

F. [. Flouvat, J. Marchi, and . Petit, The iZi Project: Easy Prototyping of Interesting Pattern Mining Algorithms, Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp.1-15, 2009.
DOI : 10.1007/978-3-642-14640-4_1
URL : https://hal.archives-ouvertes.fr/hal-01381435

]. A. Gbp-+-05, G. Ghoting, S. Buehrer, D. Parthasarathy, A. Kim et al., Cache-conscious frequent pattern mining on a modern processor, Very Large Data Bases (VLDB), pp.577-588, 2005.

]. D. Gel85 and . Gelernter, Generative communication in linda, Transactions on Programming Languages and Systems (TOPLAS), vol.7, issue.1, pp.80-112, 1985.

S. [. Guns, L. Nijssen, and . De-raedt, Itemset mining: A constraint programming perspective, Goe03] Bart Goethals. Fimi repository website, pp.12-131951, 2003.
DOI : 10.1016/j.artint.2011.05.002

]. R. Gra66 and . Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.

. R. Hmj-+-00-]-t, M. J. Hughes, A. R. Marton, C. J. Jones, R. Roberts et al., Functional discovery via a compendium of expression profiles, Cell, vol.102, issue.1, pp.109-126, 2000.

J. [. Han, Y. Pei, and . Yin, Mining frequent patterns without candidate generation, Special Interest Group on Managment of Data (SIGMOD), vol.29, issue.2, pp.1-12, 2000.

T. [. Imoto, S. Goto, and . Miyano, ESTIMATION OF GENETIC NETWORKS AND FUNCTIONAL STRUCTURES BETWEEN GENES BY USING BAYESIAN NETWORKS AND NONPARAMETRIC REGRESSION, Biocomputing 2002, p.175, 2001.
DOI : 10.1142/9789812799623_0017

T. [. Inokuchi, H. Washio, and . Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Principles of Data Mining and Knowledge Discovery (PKDD), pp.13-23, 2000.
DOI : 10.1007/3-540-45372-5_2

L. [. Kramer, C. De-raedt, and . Helma, Molecular feature mining in HIV data, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.136-143, 2001.
DOI : 10.1145/502512.502533

C. [. Kang, C. Tsourakakis, and . Faloutsos, PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations, 2009 Ninth IEEE International Conference on Data Mining, pp.229-238, 2009.
DOI : 10.1109/ICDM.2009.14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.764

B. [. Laurent, N. Negrevergne, A. Sicard, and . Termier, PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns, International Conference on Database Systems for Advanced Applications (DAS- FAA), pp.78-84, 2010.
DOI : 10.1007/978-3-642-12026-8_8
URL : https://hal.archives-ouvertes.fr/hal-00788890

S. [. Lucchese, R. Orlando, and . Perego, Dci closed: A fast and memory efficient algorithm to mine frequent closed itemsets, International Conference on Data Mining (ICDM). Citeseer, 2004.

S. [. Lucchese, R. Orlando, and . Perego, Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures, Seventh IEEE International Conference on Data Mining (ICDM 2007), pp.242-251, 2007.
DOI : 10.1109/ICDM.2007.13

C. [. Macskassy and . Nanjo, Graph mining using graph pattern profiles Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery, International Conference on Artificial Intelligence (ICAI). Citeseer, pp.241-258, 1997.

R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang, Exploratory mining and pruning optimizations of constrained association rules, International Conference on Managment of Data (SIGMOD), pp.13-24, 1998.

A. [. Negrevergne, J. Termier, and . Méhaut, Algorithmesparalì eles pour la fouille de donnée structurées, 2008.

A. [. Negrevergne, J. Termier, T. Mehaut, and . Uno, Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses, 2010 International Conference on High Performance Computing & Simulation, pp.521-528, 2010.
DOI : 10.1109/HPCS.2010.5547082
URL : https://hal.archives-ouvertes.fr/hal-00788879

Y. [. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Discovering Frequent Closed Itemsets for Association Rules, International Conference on Database Theory (ICDT), pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

[. Pei and J. Han, Can we push more constraints into frequent pattern mining?, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.350-354, 2000.
DOI : 10.1145/347090.347166

[. Pei, J. Han, and L. V. Lakshmanan, Mining frequent item sets with convertible constraints, International Conference on Data Engeneering (ICDE), pp.433-442, 2001.

[. Pei, J. Han, and R. Mao, Closet: An efficient algorithm for mining frequent closed itemsets, International Conference on Management of Data (SIGMOD), pp.21-30, 2000.

B. [. Soulet and . Crémilleux, An Efficient Framework for Mining Flexible Constraints, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.661-671, 2005.
DOI : 10.1007/11430919_76
URL : https://hal.archives-ouvertes.fr/hal-00324837

]. A. Sou06 and . Soulet, Un cadre générique de découverte de motifs sous contraintes fondées sur des primitives, 2006.

Q. [. Srikant, R. Vu, and . Agrawal, Mining association rules with item constraints, Conference on Knowledge Discovery and Data Mining (KDD), pp.67-73, 1997.

P. [. Sun and . Yu, Hiding Sensitive Frequent Itemsets by a Border-Based Approach, Journal of Computing Science and Engineering, vol.1, issue.1, pp.74-94, 2007.
DOI : 10.5626/JCSE.2007.1.1.074

T. H. Tan, F. Dillon, E. Hadzic, L. Chang, and . Feng, Imb3-miner: Mining induced/embedded subtrees by constraining the level of embedding Advances in Knowledge Discovery and Data Mining, pp.450-461, 2006.

S. [. Tatikonda and . Parthasarathy, Mining tree-structured data on multicore systems, Very Large Data Base (VLDB), pp.694-705, 2009.

S. [. Tatikonda, T. Parthasarathy, and . Kurc, TRIPS and TIDES, Proceedings of the 15th ACM international conference on Information and knowledge management , CIKM '06, pp.455-464, 2006.
DOI : 10.1145/1183614.1183680

A. Termier, Y. Tamada, K. Numata, S. Imoto, T. Washio et al., Digdag, a first algorithm to mine closed frequent embedded sub-dags, Proceedings of Mining and Learning with Graphs Workshop (MLG'07), pp.41-45, 2007.

T. [. Uno, Y. Asai, H. Uchida, and . Arimura, An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases, Discovery Science, pp.16-31, 2004.
DOI : 10.1007/978-3-540-30214-8_2

M. [. Uno, H. Kiyomi, and . Arimura, Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets, Frequent Itemset Mining Implementatino Workshop (FIMI), 2004.
DOI : 10.1145/1133905.1133916

M. [. Uno, H. Kiyomi, and . Arimura, LCM ver.3, Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations, OSDM '05, pp.77-86, 2005.
DOI : 10.1145/1133905.1133916

S. [. Wulf and . Mckee, Hitting the memory wall, ACM SIGARCH Computer Architecture News, vol.23, issue.1, pp.20-20, 1995.
DOI : 10.1145/216585.216588

J. [. Yan and . Han, gspan: Graph-based substructure pattern mining, International Conference on Data Mining (ICDM), 2002.

J. [. Yan, R. Han, and . Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, SIAM International Conference on Data Mining (SDM), pp.166-177, 2003.
DOI : 10.1137/1.9781611972733.15

X. [. Yan, J. Zhou, and . Han, Mining closed relational graphs with connectivity constraints, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.357-358, 2005.
DOI : 10.1145/1081870.1081908

]. M. Zak01 and . Zaki, SPADE: An efficient algorithm for mining frequent sequences, Machine Learning Journal, vol.42, issue.12, pp.31-60, 2001.

]. M. Zak02 and . Zaki, Efficiently mining frequent trees in a forest, 8th ACM SIGKDD International Conference Knowledge Discovery and Data Mining, 2002.

]. M. Zak05a and . Zaki, Efficiently mining frequent embedded unordered trees, special issue on Advances in Mining Graphs, Trees and Sequences, pp.33-52, 2005.

]. M. Zak05b and . Zaki, Efficiently mining frequent trees in a forest: Algorithms and applications, Transactions on Knowledge and Data Engineering, pp.1021-1035, 2005.

]. M. Zpol97a, S. Zaki, M. Parthasarathy, W. Ogihara, and . Li, New algorithms for fast discovery of association rules, 3rd International Conference on Knowledge Discovery and Data Mining (KDD), 1997.

]. M. Zpol97b, S. Zaki, M. Parthasarathy, W. Ogihara, and . Li, Parallel algorithms for discovery of association rules, Special issue on Scalable High-Performance Computing for KDD, pp.343-373, 1997.