H. Masahiro, O. Yasushi, and G. Susumu, Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways, Journal of the American Chemical Society, issue.39, pp.125-11853, 2003.

S. Volker and . Bioinformatics, Problem Solving Paradigms, 2008.

H. E. Cees and W. Hui, Kernels for acyclic digraphs, Pattern Recognition Letters, vol.2012, issue.16, pp.33-2239

U. Kang, T. Hanghang, and S. Jimeng, Fast Random Walk Graph Kernel, Proceedings of the Twelfth SIAM International Conference on Data Mining, pp.828-838
DOI : 10.1137/1.9781611972825.71

K. Amin and M. Peyman, A General Framework for Regularized, Similarity- Based Image Restoration, IEEE Transactions on Image Processing, vol.2014, issue.12, pp.23-5136

Y. Ye, W. Guoren, and C. Lei, Graph similarity search on large uncertain graph databases, The International Journal on Very Large Data Bases, pp.271-296, 2015.

S. Nino and M. B. Karsten, Fast subtree kernels on graphs, The annual Conference on Neural Information Processing Systems, pp.1660-1668, 2009.

M. B. Karsten and K. Hans-peter, Shortest-Path Kernels on Graphs, IEEE International Conference on Data Mining, pp.74-81, 2005.

W. Hui, Nearest Neighbors by Neighborhood Counting, IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), vol.28, issue.6, pp.942-953, 2006.

W. Hui, All Common Subsequences, Proceeding 20th International Joint Conference on Artificial Intelligence, pp.635-640, 2007.

W. Hui and M. Fionn, A Study of the Neighborhood Counting Similarity, IEEE Transactions on Knowledge and Data Engineering, vol.20, issue.4, pp.449-461, 2008.

H. Jun, L. Hongyan, and Y. J. Xu, Assessing single-pair similarity over graphs by aggregating first-meeting probabilities, Information Systems, vol.42, pp.107-122, 2014.

K. Michael, D. Janusz, and Y. Michael, Inferring gene ontologies from pairwise similarity data, Bioinformatics, issue.12, pp.30-34, 2014.

R. Andrew, K. Byunghoon, and L. Jaemin, Graph kernel based measure for evaluating the influence of patents in a patent citation network, Expert Systems with Applications, pp.42-1479, 2015.

M. Pierre and U. Nobuhisa, Akutsu Tatsuya et al. Extensions of marginalized graph kernels, Proceedings of the 21st International Conference on Machine Learning, pp.552-559, 2004.

W. Robert and . Floyd, Algorithm 97: Shortest Path, Communications of the ACM, vol.1962, issue.56, p.345

. Ká-sa-zoltá-n, On scattered subword complexity, Acta Univ. Sapientiae, Informatica, vol.3, issue.1, pp.127-136, 2011.

I. Wang, An algebraic decomposed algorithm for all pairs shortest paths, J]. Pacific journal of optimization, vol.2014, issue.103, pp.561-576