1. Kuramochi M, Karypis G. Frequent subgraph discovery. In: Proceedings 2001 IEEE International Conference on Data Mining. IEEE Comput. Soc; 2001. p. 313–320. Available from: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=989534
2. Backstrom L, Leskovec J. Supervised random walks. In: Proceedings of the fourth ACM international conference on Web search and data mining—WSDM’11. New York, New York, USA: ACM Press; 2011. p. 635–644. Available from: http://portal.acm.org/citation.cfm?doid=1935826.1935914
3. The link-prediction problem for social networks;D Liben-Nowell;Journal of the American Society for Information Science and Technology,2007
4. Uncovering biological network function via graphlet degree signatures;T Milenković;Cancer informatics,2008
5. Graph kernels for chemical informatics;L Ralaivola;Neural Networks,2005