C. Résolution-numérique-par-un-algorithme-de-plans, 130 5.2.1 Description générale de l'algorithme 130 5.2.2 Obtention d'une solution entière à partir d'une solution fractionnaire131 5.2.3 Algorithmes de séparation, p.132

M. Abouelhoda and M. Ghanem, String Mining in Bioinformatics, Scientific Data Mining and Knowledge Discovery, pp.207-247, 2010.
DOI : 10.1007/978-3-642-02788-8_9

R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, 1998.

R. Agrawal, T. Imieli?ski, and A. Swami, Mining association rules between sets of items in large databases, ACM SIGMOD Record, vol.22, issue.2, pp.207-216, 1993.
DOI : 10.1145/170036.170072

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14, 1995.
DOI : 10.1109/ICDE.1995.380415

K. Ravindra, T. L. Ahuja, J. B. Magnanti, and . Orlin, Network Flows : Theory, Algorithms, and Applications, 1993.

F. Stephen, W. Altschul, W. Gish, . Miller, W. Eugene et al., Basic local alignment search tool, Journal of Molecular BiologyJ. Mol. Biol.), vol.215, issue.3, pp.403-410, 1990.

F. Stephen, . Altschul, L. Thomas, A. A. Madden, J. Schäffer et al., Gapped blast and psi-blast : a new generation of protein database search programs, Nucleic acids research, vol.25, issue.17, pp.3389-3402, 1997.

A. Amir and M. Farach, Efficient 2-dimensional approximate matching of non-rectangular figures, SODA, pp.212-223, 1991.

M. Ankerst, M. Markus, H. Breunig, J. Kriegel, and . Sander, OPTICS, ACM SIGMOD Record, vol.28, issue.2, pp.49-60, 1999.
DOI : 10.1145/304181.304187

A. Apostolico, L. Parida, E. Simona, and . Rombo, Motif patterns in 2D, Theoretical Computer Science, vol.390, issue.1, pp.40-55, 2008.
DOI : 10.1016/j.tcs.2007.10.019

J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, Sequential PAttern mining using a bitmap representation, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.429-435, 2002.
DOI : 10.1145/775047.775109

R. Baeza-yates and G. Navarro, Fast two-dimensional approximate pattern matching Hans-Jürgen Bandelt, Maarten Oosten, Jeroen HGC Rutten, and Frits CR Spieksma. Lifting theorems and facet characterization for a class of clique partitioning inequalities, LATIN'98 : Theoretical Informatics, pp.341-351235, 1998.

F. Barahona and A. R. Mahjoub, On the cut polytope, Mathematical Programming, vol.2, issue.2, pp.157-173, 1986.
DOI : 10.1007/BF02592023

R. Earl and . Barnes, An algorithm for partitioning the nodes of a graph, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.4, pp.541-550, 1982.

R. Barzilay, M. Collins, J. Hirschberg, and S. Wittaker, The rules behind roles : Identifying speaker role in radio broadcasts, National Conference on Artificial Intelligence (NCAI), pp.679-684, 1999.

P. Berkhin, A Survey of Clustering Data Mining Techniques, Grouping multidimensional data, pp.25-71, 2006.
DOI : 10.1007/3-540-28349-8_2

P. Bonami, V. Nguyen, M. Klein, and M. Minoux, On the Solution of a Graph Partitioning Problem under Capacity Constraints, Combinatorial Optimization, pp.285-296, 2012.
DOI : 10.1007/978-3-642-32147-4_26
URL : https://hal.archives-ouvertes.fr/hal-01272895

L. Brunetta, M. Conforti, and G. Rinaldi, A branch-and-cut algorithm for the equicut problem, Mathematical Programming, vol.7, issue.2, pp.243-263, 1997.
DOI : 10.1007/BF02614373

H. Bunt, The dit++ taxonomy for functional dialogue markup, AAMAS 2009 Workshop, Towards a Standard Markup Language for Embodied Dialogue Acts, pp.13-24, 2009.

M. Campêlo, A. Victor, R. C. Campos, and . Corrêa, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, vol.156, issue.7, pp.1097-1111, 2008.
DOI : 10.1016/j.dam.2007.05.058

D. Catanzaro, E. Gourdin, M. Labbé, and F. A. Özsoy, A branch-and-cut algorithm for the partitioning-hub location-routing problem, Computers & Operations Research, vol.38, issue.2, pp.539-549, 2011.
DOI : 10.1016/j.cor.2010.07.014
URL : https://hal.archives-ouvertes.fr/hal-01255533

P. Cheeseman and J. Stutz, Bayesian classification (autoclass) : Theory and results, Advances in Knowledge Discovery and Data Mining, pp.153-180, 1996.

S. Chopra and M. Rao, The partition problem, Mathematical Programming, vol.49, issue.1-3, pp.87-115, 1993.
DOI : 10.1007/BF01581239

S. Chopra and M. Rao, Facets of the k-partition polytope, Discrete Applied Mathematics, vol.61, issue.1, pp.27-48, 1995.
DOI : 10.1016/0166-218X(93)E0175-X

A. Chowdhary, S. Kale, P. Saripella, N. Sehgal, and R. Gupta, A general approach for regularity extraction in datapath circuits, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design , ICCAD '98, pp.332-339, 1998.
DOI : 10.1145/288548.289050

M. Conforti, A. Rao, and . Sassano, The equipartition polytope. I: Formulations, dimension and basic facets, Mathematical Programming, pp.49-70, 1990.
DOI : 10.1007/BF01588778

M. Conforti, A. Rao, and . Sassano, The equipartition polytope. II: Valid inequalities and facets, Mathematical Programming, pp.71-90, 1990.
DOI : 10.1007/BF01588779

E. Dahlhaus, S. David, C. H. Johnson, . Papadimitriou, D. Paul et al., The complexity of multiway cuts, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp.241-251, 1992.

P. Arthur, . Dempster, M. Nan, . Laird, B. Donald et al., Maximum likelihood from incomplete data via the em algorithm, Journal of the Royal Statistical Society. Series B (Methodological), pp.1-38, 1977.

M. Deza, M. Grötschel, and M. Laurent, Clique-Web Facets for Multicut Polytopes, Mathematics of Operations Research, vol.17, issue.4, pp.981-1000, 1992.
DOI : 10.1287/moor.17.4.981

S. D. Mello, A. Olney, and N. Person, Mining collaborative patterns in tutorial dialogues, Journal of Educational Data Mining (JEDM), vol.2, issue.1, pp.1-37, 2010.

E. William, A. J. Donath, and . Hoffman, Lower bounds for the partitioning of graphs, IBM Journal of Research and Development, vol.17, issue.5, pp.420-425, 1973.

A. Dutot, F. Guinand, D. Olivier, and Y. Pigné, Graphstream : A tool for bridging the gap between complex systems and dynamic graphs
URL : https://hal.archives-ouvertes.fr/hal-00264043

M. Ester, H. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Kdd, pp.226-231, 1996.

N. Fan, M. Panos, and . Pardalos, Linear and quadratic programming approaches for the general graph partitioning problem, Journal of Global Optimization, vol.96, issue.97, pp.57-71, 2010.
DOI : 10.1007/s10898-009-9520-1

S. Faro and T. Lecroq, The exact online string matching problem, ACM Computing Surveys, vol.45, issue.2, p.13, 2013.
DOI : 10.1145/2431211.2431212

C. E. Ferreira, A. Martin, C. C. De, S. , R. Weismantel et al., Formulations and valid inequalities for the node capacitated graph partitioning problem, Mathematical Programming, vol.34, issue.3, pp.247-266, 1996.
DOI : 10.1007/BF02592198

C. E. Ferreira, A. Martin, R. Cc-de-souza, L. A. Weismantel, and . Wolsey, The node capacitated graph partitioning problem: A computational study, Mathematical Programming, pp.229-256, 1998.
DOI : 10.1007/BF01581107

P. Feyereisen, M. Van-de-wiele, and F. Dubois, The meaning of gestures : What can be understood without speech ? Cahiers de Psychologie Cognitive, Current Psychology of Cognition, 1988.

C. Fiot, A. Laurent, M. Teisseire, and B. Laurent, Why Fuzzy Sequential Patterns can Help Data Summarization: An Application to the INPI Trade Mark Database, 2006 IEEE International Conference on Fuzzy Systems, pp.699-706, 2006.
DOI : 10.1109/FUZZY.2006.1681787
URL : https://hal.archives-ouvertes.fr/lirmm-00102712

K. Florek, . ?ukaszewicz, H. Perkal, S. Steinhaus, and . Zubrzycki, Sur la liaison et la division des points d'un ensemble fini, Colloquium Mathematicae, pp.282-285, 1951.

B. J. Frey and D. Dueck, Clustering by Passing Messages Between Data Points, Science, vol.315, issue.5814, pp.315972-976, 2007.
DOI : 10.1126/science.1136800
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.3145

G. Gan, C. Ma, and J. Wu, Data clustering : theory, algorithms, and applications, Siam, vol.20, 2007.
DOI : 10.1137/1.9780898718348

R. Michael, D. S. Garey, L. Johnson, and . Stockmeyer, Some simplified npcomplete graph problems, Theoretical computer science, vol.1, issue.3, pp.237-267, 1976.

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979.

N. Minos, R. Garofalakis, K. Rastogi, and . Shim, Spirit : Sequential pattern mining with regular expression constraints, VLDB, pp.7-10, 1999.

O. Goldschmidt, S. Dorit, and . Hochbaum, Polynomial algorithm for the k-cut problem, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.444-451, 1988.
DOI : 10.1109/SFCS.1988.21960

M. Grötschel and Y. Wakabayashi, A cutting plane algorithm for a clustering problem, Mathematical Programming, vol.7, issue.1-3, pp.59-96, 1989.
DOI : 10.1007/BF01589097

M. Grötschel and Y. Wakabayashi, Composition of Facets of the Clique Partitioning Polytope, Topics in Combinatorics and Graph Theory, pp.271-284, 1990.
DOI : 10.1007/978-3-642-46908-4_31

M. Grötschel and Y. Wakabayashi, Facets of the clique partitioning polytope, Mathematical Programming, pp.367-387, 1990.
DOI : 10.1007/BF01580870

S. Guha, R. Rastogi, and K. Shim, CURE, ACM SIGMOD Record, vol.27, issue.2, pp.73-84, 1998.
DOI : 10.1145/276305.276312

S. Guha, R. Rastogi, and K. Shim, Rock : A robust clustering algorithm for categorical attributes, Data Engineering Proceedings., 15th International Conference on, pp.512-521, 1999.

L. Hagen and A. Kahng, Fast spectral methods for ratio cut partitioning and clustering ICCAD-91, IEEE International Conference on, pp.10-13, 1991.

W. William, . Hager, T. Dzung, H. Phan, and . Zhang, An exact algorithm for graph partitioning, Mathematical Programming, pp.531-556, 2013.

J. Han, H. Cheng, D. Xin, and X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.55-86, 2007.
DOI : 10.1007/s10618-006-0059-1

J. Han and Y. Fu, Discovery of multiple-level association rules from large databases, VLDB, pp.420-431, 1995.

J. Han, J. Pei, B. Mortazavi-asl, Q. Chen, U. Dayal et al., FreeSpan, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.355-359, 2000.
DOI : 10.1145/347090.347167

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD Record, vol.29, issue.2, pp.1-12, 2000.
DOI : 10.1145/335191.335372

P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Mathematical Programming, vol.15, issue.2, pp.191-215, 1997.
DOI : 10.1007/BF02614317

Y. Hu, R. Chen, G. Tzeng, and J. Shieh, A Fuzzy Data Mining Algorithm for Finding Sequential Patterns, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.11, issue.02, pp.173-193, 2003.
DOI : 10.1142/S0218488503002004

Y. Hu, G. Tzeng, and C. Chen, Deriving two-stage learning sequences from knowledge in fuzzy sequential pattern mining, Information Sciences, vol.159, issue.1-2, pp.69-86, 2004.
DOI : 10.1016/S0020-0255(03)00190-7

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

A. K. Jain, Data clustering: 50 years beyond K-means, Pattern Recognition Letters, vol.31, issue.8, pp.31651-666, 2010.
DOI : 10.1016/j.patrec.2009.09.011
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.4286

K. Anil, . Jain, C. Richard, and . Dubes, Algorithms for clustering data, 1988.

X. Ji and J. Mitchell, The clique partitioning problem with minimum size requirement, 2005.

X. Ji and J. E. Mitchell, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Discrete Optimization, vol.4, issue.1, pp.87-102, 2007.
DOI : 10.1016/j.disopt.2006.10.009

R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. Agrawal, Discovering frequent topological structures from graph datasets, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.606-611, 2005.
DOI : 10.1145/1081870.1081944

M. Volker-kaibel, . Peinhardt, E. Marc, and . Pfetsch, Orbitopal fixing. Discrete Optimization, pp.595-610, 2011.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp.302-311, 1984.

G. Karypis, E. H. Han, and V. Kumar, Chameleon: hierarchical clustering using dynamic modeling, Computer, vol.32, issue.8, pp.68-75, 1999.
DOI : 10.1109/2.781637

W. Brian, S. Kernighan, and . Lin, An efficient heuristic procedure for partitioning graphs. Bell system technical journal, pp.291-307, 1970.

S. Nikhil, . Ketkar, B. Lawrence, D. J. Holder, and . Cook, Subdue : Compressionbased frequent pattern discovery in graph data, Proceedings of the 1st international workshop on open source data mining : frequent pattern mining implementations, pp.71-76, 2005.

S. Khuller and B. Saha, On Finding Dense Subgraphs, Automata, Languages and Programming, pp.597-608, 2009.
DOI : 10.1007/978-3-642-02927-1_50

K. Krithivasan and R. Sitalakshmi, Efficient two-dimensional pattern matching in the presence of errors, Information Sciences, vol.43, issue.3, pp.169-184, 1987.
DOI : 10.1016/0020-0255(87)90037-5

B. Joseph and . Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical society, vol.7, issue.1, pp.48-50, 1956.

H. Kum, J. Pei, W. Wang, and D. Duncan, ApproxMAP: Approximate Mining of Consensus Sequential Patterns, SDM, pp.311-315, 2003.
DOI : 10.1137/1.9781611972733.36

M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proceedings 2001 IEEE International Conference on Data Mining, pp.313-320, 2001.
DOI : 10.1109/ICDM.2001.989534

M. Kuramochi and G. Karypis, GREW-A Scalable Frequent Subgraph Discovery Algorithm, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.439-442, 2004.
DOI : 10.1109/ICDM.2004.10024

M. Labbé and F. A. Özsoy, Size-constrained graph partitioning polytopes, Discrete Mathematics, vol.310, issue.24, pp.3103473-3493, 2010.
DOI : 10.1016/j.disc.2010.08.009

P. Laird, Identifying and using patterns in sequential data, Algorithmic learning theory, pp.1-18, 1993.
DOI : 10.1007/3-540-57370-4_33

T. Lecroq, A. Pauchet, É. Chanoni, and G. A. Solano, Pattern discovery in annotated dialogues using dynamic programming, International Journal of Intelligent Information and Database Systems, vol.6, issue.6, pp.603-618, 2012.
DOI : 10.1504/IJIIDS.2012.050097

I. Vladimir and . Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet physics doklady, p.707, 1966.

S. Lin and B. W. Kernighan, An effective heuristic algorithm for the travelingsalesman problem, Operations research, pp.498-516, 1973.

J. David, . Lipman, R. William, and . Pearson, Rapid and sensitive protein similarity searches, Science, vol.227, issue.4693, pp.1435-1441, 1985.

A. Lisser and F. , Graph partitioning using linear and semidefinite programming, Mathematical Programming, pp.91-101, 2003.
DOI : 10.1007/s10107-002-0342-x

R. Nizar, . Mabroukeh, I. Christie, and . Ezeife, A taxonomy of sequential pattern mining algorithms, ACM Computing Surveys (CSUR), vol.43, issue.1, p.3, 2010.

J. Macqueen, Some methods for classification and analysis of multivariate observations, Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, p.14, 1967.

F. Masseglia, F. Cathala, and P. Poncelet, The PSP approach for mining sequential patterns, Principles of Data Mining and Knowledge Discovery, pp.176-184, 1998.
DOI : 10.1007/BFb0094818

A. Mehrabian and M. Wiener, Decoding of inconsistent communications., Journal of Personality and Social Psychology, vol.6, issue.1, p.109, 1967.
DOI : 10.1037/h0024532

A. Mehrotra and M. A. Trick, Cliques and clustering: A combinatorial approach, Operations Research Letters, vol.22, issue.1, pp.1-12, 1998.
DOI : 10.1016/S0167-6377(98)00006-6

J. E. Mitchell, Branch-and-cut for the k-way equipartition problem, Mathematical Sciences, Rensselaer Polytechnic Institute, 2001.

E. John and . Mitchell, Realignment in the national football league : Did they do it right ?, Naval Research Logistics (NRL), vol.50, issue.7, pp.683-701, 2003.

H. Carl, . Mooney, F. John, and . Roddick, Sequential pattern mining?approaches and algorithms, ACM Computing Surveys (CSUR), vol.45, issue.2, p.19, 2013.

E. Moritz, Routine Activity Extraction from Local Alignments in Mobile Phone Context Data, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00944105

R. Müller, On the partial order polytope of a digraph, Mathematical Programming, pp.31-49, 1996.
DOI : 10.1007/BF02592097

S. B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.48, issue.3, pp.443-453, 1970.
DOI : 10.1016/0022-2836(70)90057-4

A. John, R. Nelder, and . Mead, A simplex method for function minimization. The computer journal, pp.308-313, 1965.

S. Nijssen, N. Joost, and . Kok, A quickstart in frequent structure mining can make a difference, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.647-652, 2004.
DOI : 10.1145/1014052.1014134

M. Oosten, J. Rutten, and F. C. Spieksma, The facial structure of the clique partitioning polytope, Report M, pp.95-104, 1995.

M. Oosten, J. H. Rutten, and F. C. Spieksma, The clique partitioning problem: Facets and patching facets, Networks, vol.8, issue.4, pp.209-226, 2001.
DOI : 10.1002/net.10004

S. Orlando, R. Perego, and C. Silvestri, A new algorithm for gap constrained sequence mining, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.540-547, 2004.
DOI : 10.1145/967900.968014

J. Pei, J. Han, B. Mortazavi-asl, H. Pinto, Q. Chen et al., Prefixspan : Mining sequential patterns efficiently by prefix-projected pattern growth, 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp.215-0215, 2001.

H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen et al., Multi-dimensional sequential pattern mining, Proceedings of the tenth international conference on Information and knowledge management , CIKM'01, pp.81-88, 2001.
DOI : 10.1145/502585.502600

R. Clay and P. , Shortest connection networks and some generalizations. Bell system technical journal, pp.1389-1401, 1957.

M. Queyranne, On optimum size-constrained set partitions, Proceedings of AUSSOIS, 1999.

D. S. Rao and F. J. Kurdahi, On clustering for maximal regularity extraction. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol.12, issue.8, pp.1198-1208, 1993.

E. Riloff and R. Jones, Learning dictionaries for information extraction by multi-level bootstrapping, AAAI/IAAI, pp.474-479, 1999.

I. Rish, An empirical study of the naive bayes classifier, IJCAI 2001 workshop on empirical methods in artificial intelligence, pp.41-46, 2001.

L. Rokach, Data mining with decision trees : theory and applications, World scientific, vol.69, 2008.

M. Seno and G. Karypis, SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint, 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp.418-425, 2002.
DOI : 10.1109/ICDM.2002.1183937

J. Shi and J. Malik, Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.22, issue.8, pp.888-905, 2000.

T. F. Smith and M. S. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981.
DOI : 10.1016/0022-2836(81)90087-5

M. M. Sørensen, b-Tree Facets for the Simple Graph Partitioning Polytope, Journal of Combinatorial Optimization, vol.8, issue.2, pp.151-170, 2004.
DOI : 10.1023/B:JOCO.0000031417.96218.26

M. M. Sørensen, Facet-defining inequalities for the simple graph partitioning polytope, Discrete Optimization, vol.4, issue.2, pp.221-231, 2007.
DOI : 10.1016/j.disopt.2006.08.001

T. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons, Biol. skr, vol.5, pp.1-34, 1948.

R. Srikant and R. Agrawal, Mining sequential patterns: Generalizations and performance improvements, 1996.
DOI : 10.1007/BFb0014140

M. Stoer and F. Wagner, A simple min-cut algorithm, Journal of the ACM, vol.44, issue.4, pp.585-591, 1997.
DOI : 10.1145/263867.263872

K. Sudo, S. Sekine, and R. Grishman, Automatic pattern acquisition for Japanese information extraction, Proceedings of the first international conference on Human language technology research , HLT '01, pp.1-7, 2001.
DOI : 10.3115/1072133.1072142

A. Vinciarelli, Speakers role recognition in multiparty audio recordings using social network analysis and duration distribution modeling. Multimedia, IEEE Transactions on, vol.9, issue.6, pp.1215-1226, 2007.

W. Wang, J. Yang, and R. Muntz, Sting : A statistical information grid approach to spatial data mining, VLDB, pp.186-195, 1997.

T. Washio and H. Motoda, State of the art of graph-based data mining, ACM SIGKDD Explorations Newsletter, vol.5, issue.1, pp.59-68, 2003.
DOI : 10.1145/959242.959249

X. Yan and J. Han, gspan : Graph-based substructure pattern mining, Data Mining ICDM 2003. Proceedings. 2002 IEEE International Conference on, pp.721-724, 2002.

G. Yang, The complexity of mining maximal frequent itemsets and maximal frequent patterns, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.344-353, 2004.
DOI : 10.1145/1014052.1014091

Z. Yang and M. Kitsuregawa, Lapin-spam : An improved algorithm for mining sequential pattern, Data Engineering Workshops, 2005. 21st International Conference on, pp.1222-1222, 2005.

R. Yangarber, R. Grishman, P. Tapanainen, and S. Huttunen, Unsupervised discovery of scenario-level patterns for Information Extraction, Proceedings of the sixth conference on Applied natural language processing -, pp.282-289, 2000.
DOI : 10.3115/974147.974186

K. Yoshida, H. Motoda, and N. Indurkhya, Graph-based induction as a unified learning framework, Applied Intelligence, vol.42, issue.2, pp.297-316, 1994.
DOI : 10.1007/BF00872095

J. Mohammed and . Zaki, Sequence mining in categorical domains : incorporating constraints, Proceedings of the ninth international conference on Information and knowledge management, pp.422-429, 2000.

J. Mohammed and . Zaki, Spade : An efficient algorithm for mining frequent sequences, Machine learning, vol.42, issue.12, pp.31-60, 2001.

J. Mohammed and . Zaki, Efficiently mining frequent trees in a forest, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.71-80, 2002.

M. Zhang, B. Kao, C. Yip, and D. Cheung, A gsp-based efficient algorithm for mining frequent sequences, Proc. of IC-AI, pp.497-503, 2001.

L. Zhao, H. Nagamochi, and T. Ibaraki, Greedy splitting algorithms for approximating multiway partition problems, Mathematical Programming, vol.5, issue.1, pp.167-183, 2005.
DOI : 10.1007/s10107-004-0510-2

. Titre, Extraction et partitionnement pour la recherche de régularités : application à l