Structure-based graph distance measures of high degree of precision

Pattern Recognition

Volumn 41, Issue 12, 2008, Pages 3547-3561

  Xiao, Yanghua ^a   Dong, Hua ^b   Wu, Wentao ^a   Xiong, Momiao ^b,c   Wang, Wei ^a   Shi, Baile ^a  

^a FUDAN UNIVERSITY   (China)

^b FUDAN UNIVERSITY   (China)

^c UNIVERSITY OF TEXAS   (United States)

Author keywords

Distance metric; Graph distance; SNP linkage disequilibrium; Structure based graph distance

Indexed keywords

COST FUNCTIONS; IMAGE SEGMENTATION; NUCLEIC ACIDS;

DEGREE OF PRECISION; DISTANCE GRAPHS; DISTANCE MEASURES; DISTANCE METRIC; EDGE INFORMATION; EXISTING STRUCTURES; FINER GRAINS; GRAPH DISTANCE; LINKAGE DISEQUILIBRIUM; LOW DEGREE; OF GRAPHS; POPULATION EVOLUTION; REAL APPLICATIONS; SINGLE-NUCLEOTIDE POLYMORPHISM; SNP LINKAGE DISEQUILIBRIUM; STRUCTURE-BASED GRAPH DISTANCE;

GRAPH THEORY;

EID: 49449118815     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.06.008     Document Type: Article

References (38)

1. Yan X., Zhu F., Yu P.S., and Han J. Feature-based similarity search in graph structures. ACM Trans. Database Systems 31 4 (2006) 1418-1453
2. Chevalier F., Domenger J.-P., Benois-Pineau J., and Delest M. Retrieval of objects in video by similarity based on graph matching. Pattern Recognition Lett. 28 8 (2007) 939-949
3. Flesca S., Manco G., Masciari E., Pontieri L., and Pugliese A. Exploiting structural similarity for effective Web information extraction. Data Knowledge Eng. 60 1 (2007) 222-234
4. Raymond J.W., Gardiner E.J., and Willett P. RASCAL: calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45 6 (2002) 631-644
5. Raymond J.W., Gardiner E.J., and Willett P. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J. Chem. Inform. Comput. Sci. 42 2 (2002) 305-316
6. Raymond J.W., and Willett P. Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. J. Comput.-Aided Mol. Des. 16 1 (2002) 59-71
7. Raymond J.W., and Willett P. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Comput.-Aided Mol. Des. 16 7 (2002) 521-533
8. Conte D., Foggia P., Sansone C., and Vento M. Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognition Artif. Intell. 18 3 (2004) 265-298
9. Bunke H., and Shearer K. A graph distance metric based on the maximal common subgraph. Pattern Recognition Lett. 19 (1998) 255-259
10. Fernandez M.L., and Valiente G. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Lett. 22 (2001) 753-758
11. Hidovic D., and Pelillo M. Metrics for attributed graphs based on the maximal similarity common subgraph. IJPRAI 18 3 (2004) 299-313
12. Wallis W.D., Shoubridge P., Kraetz M., and Ray D. Graph distances using graph union. Pattern Recognition Lett. 22 (2001) 701-704
13. Dehmer M., and Emmert-Streib F. Structural similarity of directed universal hierarchical graphs: a low computational complexity approach. Appl. Math. Comput. 194 1 (2007) 7-20
14. Dehmer M., Emmert-Streib F., and Kilian J. A similarity measure for graphs with low computational complexity. Appl. Math. Comput. 182 1 (2006) 447-459
15. Dehmer M., and Emmert-Streib F. Comparing large graphs efficiently by margins of feature vectors. Appl. Math. Comput. 188 2 (2007) 1699-1710
16. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 18 (1997) 689-694
17. Messmer B.T., and Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20 5 (1998) 493-504
18. Riesen K., Neuhaus M., and Bunke H. Bipartite Graph Matching for Computing the Edit Distance of Graphs. Lecture Notes in Computer Science vol. 4538 (2007) 1-12
19. Neuhaus M., and Bunke H. Automatic learning of cost functions for graph edit distance. Inform. Sci. 177 1 (2007) 239-247
20. M. Neuhaus, H. Bunke, Self-organizing maps for learning the edit costs in graph matching 35(3) (2005) 503-514.
21. K.P. Murphy, A Brief Introduction to Graphical Models and Bayesian Networks, 2001.
22. Kruglyak L., and Nickerson D.A. Variation is the spice of life. Nat. Genet. 27 3 (2001) 234-236
23. Stephens M., Smith N.J., and Donnelly P. A new statistical method for haplotype reconstruction from population data. Am. J. Hum. Genet. 68 4 (2001) 978-989
24. Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., and Alon U. Network motifs: simple building blocks of complex networks. Science 298 (2002) 824-827
25. Wang B., Tang H.W., Guo C.H., and Xiu Z.L. Entropy optimization of scale-free networks robustness to random failures. Physica A 363 (2005) 591
26. Bollobás B. Modern Graph Theory, Graduate Texts in Mathematics vol. 184 (1998), Springer, New York
27. The International HapMap Consortium. The International HapMap Project. Nature 426 (2003) 789-796
28. Nothnagel M., Furst R., and Rohde K. Entropy as a measure for linkage disequilibrium over multilocus haplotype blocks. Hum. Hered. 54 (2002) 186-198
29. Borgwardt K., and Kriegel H.-P. Shortest-path kernels on graphs. Proceedings of the 5th International Conference on Data Mining (2005) 74-81
30. Schölkopf B., and Smola A. Learning with Kernels (2002), MIT Press, Cambridge, MA
31. Ramon J., and Gärtner T. Expressivity versus efficiency of graph kernels. Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (2003) 65-74
32. Gärtner T., Flach P.A., and Wrobel S. On graph kernels: hardness results and efficient alternatives. LTKM vol. 2843 (2003), Springer, Berlin 129-143
33. Kashima H., Tsuda K., and Inokuchi A. Marginalized kernels between labeled graphs. Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003), Washington, DC, USA (2003)
34. Agrafiotis D.K., Myslik J.C., and Salemme F.R. Advances in diversity profiling and combinatorial series design. Mol. Diversity 4 (1999) 1-22
35. Durant J.L., Leland B.A., Henry D.R., and Nourse J.G. Reoptimization of MDL keys for use in drug discovery. J. Chem. Inf. Comput. Sci. 42 (2002) 1273-1280
36. Jansen R., Yu H., Gerstein M., et al. A Bayesian networks approach for predicting protein-protein interactions from genomic data. Science 302 (2003) 449-453
37. Rhodes D., Chinnaiyan A.M., et al. Probabilistic model of the human protein-protein interaction network. Nature Biotechnol. 23 8 (2005) 951-959
38. Segal E., Shapira M., Regev A., et al. Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data. Nature Genetics 34 2 (2003) 166-176