A. Soulet, C. Ra¨?ssira¨?ssi, M. Plantevit, and B. Crémilleux, Mining dominant patterns in the sky, pp.655-664, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00623566

W. Ugarte, P. Boizumault, S. Loudni, B. Crémilleux, and A. Lepailleur, Mining (soft-) skypatterns using dynamic CSP, LNCS, vol.8451, pp.71-87, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01024756

M. J. Zaki and K. Sequeira, Data mining in computational biology, Handbook of Computational Molecular Biology, vol.38, pp.1-26, 2006.

J. Gasteiger and T. Engel, Chemoinformatics: A Textbook, 2003.

L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan, Group formation in large social networks: membership, growth, and evolution, pp.44-54, 2006.

L. Backstrom, J. M. Kleinberg, and R. Kumar, Optimizing web traffic via the media scheduling problem, pp.89-98, 2009.

W. Fan, M. Miller, S. J. Stolfo, W. Lee, and P. K. Chan, Using artificial anomalies to detect unknown and known network intrusions, pp.123-130, 2001.

R. Agrawal, T. Imielinski, and A. N. Swami, Mining association rules between sets of items in large databases, pp.207-216, 1993.

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Min. Knowl. Discov, vol.1, issue.3, pp.241-258, 1997.

S. Wrobel, An algorithm for multi-relational discovery of subgroups, LNCS, vol.1263, pp.78-87, 1997.

P. K. Novak, N. Lavrac, and G. I. Webb, Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining, Journal of Machine Learning Research, vol.10, pp.377-403, 2009.

F. Geerts, B. Goethals, and T. Mielikäinen, Tiling databases, LNCS, vol.3245, pp.278-289, 2004.

F. Bonchi, F. Giannotti, C. Lucchese, S. Orlando, R. Perego et al., A constraint-based querying system for exploratory pattern discovery, Inf. Syst, vol.34, issue.1, pp.3-27, 2009.

N. Pasquier, Y. Bastide, R. Taouil, and L. , Efficient mining of association rules using closed itemset lattices, Inf. Syst, vol.24, issue.1, pp.25-46, 1999.

T. Calders and B. Goethals, Non-derivable itemset mining, Data Min. Knowl. Discov, vol.14, issue.1, pp.171-206, 2007.
DOI : 10.1007/s10618-006-0054-6
URL : https://link.springer.com/content/pdf/10.1007%2Fs10618-006-0054-6.pdf

J. Boulicaut, A. Bykowski, and C. Rigotti, Free-sets: A condensed representation of boolean data for the approximation of frequency queries, Data Min. Knowl. Discov, vol.7, issue.1, pp.5-22, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01503814

S. Bistarelli and F. Bonchi, Soft constraint based pattern mining, Data Knowl. Eng, vol.62, issue.1, pp.118-137, 2007.
DOI : 10.1016/j.datak.2006.07.008

W. Ugarte, P. Boizumault, S. Loudni, B. Crémilleux, and A. Lepailleur, Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs, J. Intell. Inf. Syst, pp.1-29, 2013.

Y. Ke, J. Cheng, and J. X. Yu, Top-k correlative graph mining, pp.1038-1049, 2009.
DOI : 10.1137/1.9781611972795.89

J. Wang, J. Han, Y. Lu, and P. Tzvetkov, TFP: an efficient algorithm for mining top-k frequent closed itemsets, IEEE Trans. Knowl. Data Eng, vol.17, issue.5, pp.652-664, 2005.

S. Börzsönyi, D. Kossmann, and K. Stocker, The skyline operator, ICDE, pp.421-430, 2001.

J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, On the average number of maxima in a set of vectors and applications, J. ACM, vol.25, issue.4, pp.536-543, 1978.

T. Calders, C. Rigotti, and J. Boulicaut, A survey on condensed representations for frequent sets, Constraint-Based Mining and Inductive Databases, vol.3848, pp.64-80, 2005.
DOI : 10.1007/11615576_4
URL : https://hal.archives-ouvertes.fr/hal-01613469

R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang, Exploratory mining and pruning optimizations of constrained association rules, pp.13-24, 1998.
DOI : 10.1145/276305.276307

A. Siebes, J. Vreeken, and M. Van-leeuwen, Item sets that compress, SDM, SIAM, pp.395-406, 2006.
DOI : 10.1137/1.9781611972764.35

A. J. Knobbe and E. K. Ho, Pattern teams, vol.4213, pp.577-584, 2006.
DOI : 10.1007/11871637_58

L. D. Raedt and A. Zimmermann, Constraint-based pattern set mining, SDM, SIAM, pp.237-248, 2007.
DOI : 10.1137/1.9781611972771.22
URL : https://epubs.siam.org/doi/pdf/10.1137/1.9781611972771.22

B. Bringmann and A. Zimmermann, The chosen few: On identifying valuable patterns, ICDM, pp.63-72, 2007.
DOI : 10.1109/icdm.2007.85

G. C. Garriga, P. Kralj, and N. Lavrac, Closed sets for labeled data, Journal of Machine Learning Research, vol.9, pp.559-580, 2008.
DOI : 10.1007/11871637_19
URL : https://link.springer.com/content/pdf/10.1007%2F11871637_19.pdf

K. Kontonasios and T. D. Bie, An information-theoretic approach to finding informative noisy tiles in binary databases, SDM, SIAM, pp.153-164, 2010.
DOI : 10.1137/1.9781611972801.14

W. Hämäläinen and M. Nykänen, Efficient discovery of statistically significant association rules, ICDM, pp.203-212, 2008.

A. Gallo, T. D. Bie, and N. Cristianini, MINI: mining informative non-redundant itemsets, vol.4702, pp.438-445, 2007.
DOI : 10.1007/978-3-540-74976-9_44
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-74976-9_44.pdf

A. Gionis, H. Mannila, T. Mielikäinen, and P. Tsaparas, Assessing data mining results via swap randomization, pp.167-176, 2006.
DOI : 10.1145/1150402.1150424

M. Mampaey, N. Tatti, and J. Vreeken, Tell me what i need to know: succinctly summarizing data with itemsets, SIGKDD, ACM, pp.573-581, 2011.
DOI : 10.1145/2020408.2020499

T. Guns, S. Nijssen, and L. D. Raedt, Itemset mining: A constraint programming perspective, Artif. Intell, vol.175, pp.1951-1983, 2011.
DOI : 10.1016/j.artint.2011.05.002
URL : https://doi.org/10.1016/j.artint.2011.05.002

L. D. Raedt, T. Guns, and S. Nijssen, Constraint programming for itemset mining, pp.204-212, 2008.

M. Khiari, P. Boizumault, and B. Crémilleux, Constraint programming for mining n-ary patterns, LNCS, vol.6308, pp.552-567, 2010.
DOI : 10.1007/978-3-642-15396-9_44
URL : https://hal.archives-ouvertes.fr/hal-01016652

H. T. Kung, F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM, vol.22, issue.4, pp.469-476, 1975.

J. Matousek, Computing dominances in e?n, Inf. Process. Lett, vol.38, issue.5, pp.277-278, 1991.

R. E. Steuer, Multiple Criteria Optimization: Theory, Computation and Application, p.546, 1986.

D. Papadias, Y. Tao, G. Fu, and B. Seeger, Progressive skyline computation in database systems, ACM Trans. Database Syst, vol.30, issue.1, pp.41-82, 2005.
DOI : 10.1145/1061318.1061320
URL : http://www.cs.ust.hk/~dimitris/PAPERS/TODS05-Skyline.pdf

K. Tan, P. Eng, and B. C. Ooi, Efficient progressive skyline computation, pp.301-310, 2001.

A. N. Papadopoulos, A. Lyritsis, and Y. Manolopoulos, Skygraph: an algorithm for important subgraph discovery in relational graphs, Data Min. Knowl. Discov, vol.17, issue.1, pp.57-76, 2008.
DOI : 10.1007/978-3-540-87479-9_16
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-87479-9_16.pdf

P. Shelokar, A. Quirin, and O. Cordón, Mosubdue: a pareto dominance-based multiobjective subdue algorithm for frequent subgraph mining, Knowl. Inf. Syst, vol.34, issue.1, pp.75-108, 2013.
DOI : 10.1007/s10115-011-0452-y

D. J. Cook and L. B. Holder, Graph-based data mining, IEEE Intelligent Systems, vol.15, issue.2, pp.32-41, 2000.

M. Van-leeuwen and A. Ukkonen, Discovering skylines of subgroup sets, ECML/PKDD, vol.8190, pp.272-287, 2013.

B. Négrevergne, A. Dries, T. Guns, and S. Nijssen, Dominance programming for itemset mining, pp.557-566, 2013.

F. Pennerath and A. Napoli, The model of most informative patterns and its application to knowledge extraction from graph databases, ECML/PKDD, vol.5782, pp.205-220, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00437536

A. Soulet and B. Crémilleux, Adequate condensed representations of patterns, Data Min. Knowl. Discov, vol.17, issue.1, pp.94-110, 2008.
DOI : 10.1007/978-3-540-87479-9_18
URL : https://hal.archives-ouvertes.fr/hal-01024051

A. Soulet and B. Crémilleux, Mining constraint-based patterns using automatic relaxation, Intell. Data Anal, vol.13, issue.1, pp.109-133, 2009.
DOI : 10.3233/ida-2009-0358
URL : https://hal.archives-ouvertes.fr/hal-01012079

E. Omiecinski, Alternative interest measures for mining associations in databases, IEEE Trans. Knowl. Data Eng, vol.15, issue.1, pp.57-69, 2003.
DOI : 10.1109/tkde.2003.1161582

R. Dechter and A. Dechter, Belief maintenance in dynamic constraint networks, pp.37-42, 1988.

G. Verfaillie and N. Jussien, Constraint solving in uncertain and dynamic environments: A survey, Constraints, vol.10, issue.3, pp.253-281, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00293900

C. Lecoutre, Constraint Networks: Targeting Simplicity for Techniques and Algorithms, 2009.

F. Rossi and P. Van-beek, Handbook of Constraint Programming, 2006.

A. Lepailleur, G. Poezevara, and R. Bureau, Automated detection of structural alerts (chemical fragments) in (eco)toxicology, Comp and Struct Biotech J, vol.5, p.201302013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01023826

B. Cuissart, G. Poezevara, B. Crémilleux, A. Lepailleur, and R. Bureau, Emerging patterns as structural alerts for computational toxicology, pp.269-282, 2013.
DOI : 10.1201/b12986-25
URL : https://hal.archives-ouvertes.fr/hal-01024000

I. Sushko, E. Salmina, V. Potemkin, G. Poda, and I. V. Tetko, Toxalerts: A web server of structural alerts for toxic chemicals and compounds with potential adverse reactions, Journal of Chemical Information and Modeling, vol.52, issue.8, pp.2310-2316, 2012.

C. Hansch, S. Mccarns, C. Smith, and D. Dodittle, Comparative QSAR evidence for a free-radical mechanism of phenol-induced toxicity, Chem. Biol. Interact, vol.127, pp.61-72, 2000.

S. Lozano, G. Poezevara, M. Halm-lemeille, E. Lescot-fontaine, A. Lepailleur et al., Introduction of jumping fragments in combination with QSARs for the assessment of classification in ecotoxicology, Journal of Chemical Information and Modeling, vol.50, issue.8, pp.1330-1339, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01011322

D. Lo, S. Khoo, and J. Li, Mining and ranking generators of sequential patterns, SDM, SIAM, pp.553-564, 2008.
DOI : 10.1137/1.9781611972788.51

E. Coquery, S. Jabbour, L. Sa¨?ssa¨?s, and Y. Salhi, A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence, Artificial Intelligence and Applications, vol.242, pp.258-263, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00865559

A. Kemmar, W. Ugarte, S. Loudni, T. Charnois, Y. Lebbah et al., Mining relevant sequence patterns with CP-based framework, in: ICTAI, IEEE Computer Society, pp.552-559, 2014.
DOI : 10.1109/ictai.2014.89
URL : https://hal.archives-ouvertes.fr/hal-01628142/file/master-ictai.pdf

W. Ugarte, P. Boizumault, S. Loudni, and B. Crémilleux, Computing skypattern cubes, Frontiers in Artificial Intelligence and Applications, vol.263, pp.903-908, 2014.
DOI : 10.1109/ictai.2014.132
URL : https://hal.archives-ouvertes.fr/hal-01145902