Frequent subgraph mining

Compute (2jg 0 for all possible g using a frequent subgraph mining algorithm in terms of support(( [,.) Q). ... 

Huan, J., Bandyopadhyay, D., Prins, J., Snoeyink, J., Tropsha, A., Wang, W. (2006). Distance-based identification of structure motifs in proteins using constrained frequent subgraph mining. Computational Systems Bioinformatics Conference, 227. 

J. Huang, W. Wang and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, in Proceedings of the 3rd IEEE International. Conference on Data Mining (ICDM), IEEE Press, Piscataway, NJ, 2004. 

We can use any algorithm for mining frequent subgraphs (subsequences) to compute the marginal support in Q with the traversal over T (and T). As mentioned above, for this purpose, we use gSpan and PrefixSpan for graphs and sequences, respectively. 

---