R. Michael and . Berthold, Mining molecular fragments: Finding relevant substructures of molecules, ICDM '02, pp.51-58, 2002.

L. Borges, M. Borges, and . Levene, A fine grained heuristic to capture web navigation patterns, Bringmann and Nijssen, pp.40-50, 2000.
DOI : 10.1145/360402.360416

S. Nijssencalders, Toon Calders, Christophe Rigotti, and Jean-François Boulicaut. A survey on condensed representations for frequent sets, PAKDD '08 Constraint-Based Mining and Inductive Databases, pp.858-863, 2004.

B. Fiedler, Mathias Fiedler and Christian Borgelt Support computation for mining frequent subgraphs in a single graph In Mining and Learning with Graphs, MLG '07 Finding itemset-sharing patterns in a large itemset-associated graph, PAKDD '10, pp.147-159, 2007.

. Geng, WTPMiner: Efficient Mining of Weighted Frequent Patterns Based on Graph Traversals, KSEM '07, pp.412-424, 2007.
DOI : 10.1007/978-3-540-76719-0_41

. Gudes, Discovering Frequent Graph Patterns Using Disjoint Paths, IEEE Transactions on Knowledge and Data Engineering, vol.18, issue.11, pp.1441-1456, 2006.
DOI : 10.1109/TKDE.2006.173

. Inokuchi, An apriori-based algorithm for mining frequent substructures from graph data Finding frequent patterns in a large sparse graph*, PKDD '00 Lo¨?cLo¨?c Mabit, Nazha Selmaoui-Folcher, and Frédéric Flouvat, pp.13-23243, 2000.

. Matsuda, Extension of graphbased induction for general graph structured data, PAKDD '00, pp.420-431, 2000.

. Miyoshi, Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets, 2009 IEEE International Conference on Data Mining Workshops, pp.527-532, 2009.
DOI : 10.1109/ICDMW.2009.11

. Moser, Mining cohesive patterns from graphs with feature vectors Alexandros Nanopoulos and Yannis Manolopoulos. Mining patterns from graph traversals, SDM '09Nanopoulos and Manolopoulos, pp.593-604243, 2001.

. Pasquier, Discovering frequent closed itemsets for association rules [Selmaoui-Folcher and Flouvat, 2011] Nazha Selmaoui- Folcher and Frédéric Flouvat. How to use " classical " tree mining algorithms to find complex spatio-temporal patterns? Digdag, a first algorithm to mine closed frequent embedded sub-dags, ICDT '99 MLG '07Washio and Motoda, 2003] Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl, pp.398-416, 1999.

H. Yan, Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining, ICDM '02, pp.721-724, 2002.

Y. , H. Yan, and J. Han, Closegraph: mining closed frequent graph patterns, KDD '03, pp.286-295, 2003.