메뉴 건너뛰기




Volumn 346-347, Issue , 2016, Pages 180-197

Fifty years of graph matching, network alignment and network comparison

Author keywords

Biological networks; Computational graph theory; Graph matching; Network comparison; Network similarity; Quantitative graph theory

Indexed keywords

COMPUTATION THEORY; SURVEYS;

EID: 84964349574     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2016.01.074     Document Type: Article
Times cited : (250)

References (125)
  • 2
    • 84875609301 scopus 로고    scopus 로고
    • Spinal: Scalable protein interaction network alignment
    • A.E. Aladag, and C. Erten Spinal: scalable protein interaction network alignment Bioinformatics 29 7 2013 917 924
    • (2013) Bioinformatics , vol.29 , Issue.7 , pp. 917-924
    • Aladag, A.E.1    Erten, C.2
  • 3
    • 0036013593 scopus 로고    scopus 로고
    • Statistical mechanics of complex networks
    • R. Albert, and A.L. Barabási Statistical mechanics of complex networks Rev. Mod. Phys. 74 2002 47 97
    • (2002) Rev. Mod. Phys. , vol.74 , pp. 47-97
    • Albert, R.1    Barabási, A.L.2
  • 4
    • 84907030076 scopus 로고    scopus 로고
    • Alignment-free protein interaction network comparison
    • W. Ali, T. Rito, G. Reinert, F. Sun, and C.M. Deane Alignment-free protein interaction network comparison Bioinformatics 30 17 2014 i430 i437
    • (2014) Bioinformatics , vol.30 , Issue.17 , pp. i430-i437
    • Ali, W.1    Rito, T.2    Reinert, G.3    Sun, F.4    Deane, C.M.5
  • 5
    • 11344278195 scopus 로고    scopus 로고
    • A measure of similarity between graph vertices: Applications to synonym extraction and web searching
    • V. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P.V. Dooren A measure of similarity between graph vertices: applications to synonym extraction and web searching SIAM Rev. 46 2004 647 666
    • (2004) SIAM Rev. , vol.46 , pp. 647-666
    • Blondel, V.1    Gajardo, A.2    Heymans, M.3    Senellart, P.4    Dooren, P.V.5
  • 6
    • 70349610382 scopus 로고    scopus 로고
    • Ludwig-Maximilians-Universität München, Fakultät für Mathematik, Informatik und Statistik Ph.D. thesis
    • M. Borgwardt Graph Kernels 2007 Ludwig-Maximilians-Universität München, Fakultät für Mathematik, Informatik und Statistik Ph.D. thesis
    • (2007) Graph Kernels
    • Borgwardt, M.1
  • 8
    • 34248202971 scopus 로고
    • What is the distance between graphs ?
    • H. Bunke What is the distance between graphs ? Bull. EATCS 20 1983 35 39
    • (1983) Bull. EATCS , vol.20 , pp. 35-39
    • Bunke, H.1
  • 9
    • 0031198630 scopus 로고    scopus 로고
    • On a relation between graph edit distance and maximum common subgraph
    • H. Bunke On a relation between graph edit distance and maximum common subgraph Pattern Recognit. Lett. 18 9 1997 689 694
    • (1997) Pattern Recognit. Lett. , vol.18 , Issue.9 , pp. 689-694
    • Bunke, H.1
  • 10
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximum common subgraph
    • H. Bunke A graph distance metric based on the maximum common subgraph Pattern Recognit. Lett. 19 3 1998 255 259
    • (1998) Pattern Recognit. Lett. , vol.19 , Issue.3 , pp. 255-259
    • Bunke, H.1
  • 11
    • 0033188822 scopus 로고    scopus 로고
    • Error correcting graph matching: On the influence of the underlying cost function
    • H. Bunke Error correcting graph matching: on the influence of the underlying cost function IEEE Trans. Pattern Anal. Mach. Intell. 21 9 1999 911 917
    • (1999) IEEE Trans. Pattern Anal. Mach. Intell. , vol.21 , Issue.9 , pp. 911-917
    • Bunke, H.1
  • 13
    • 23844449054 scopus 로고    scopus 로고
    • Graph matching: Theoretical foundations, algorithms, and applications
    • H. Bunke Graph matching: theoretical foundations, algorithms, and applications Proceedings of Vision Interface 2000 2000 82 88
    • (2000) Proceedings of Vision Interface 2000 , pp. 82-88
    • Bunke, H.1
  • 15
    • 49849106755 scopus 로고    scopus 로고
    • Graph matching. Exact and error-tolerant methods and the automatic learning of edit costs
    • D. Cook, L.B. Holder, Wiley-Interscience
    • H. Bunke, and M. Neuhaus Graph matching. Exact and error-tolerant methods and the automatic learning of edit costs D. Cook, L.B. Holder, Mining Graph Data 2007 Wiley-Interscience 17 32
    • (2007) Mining Graph Data , pp. 17-32
    • Bunke, H.1    Neuhaus, M.2
  • 21
    • 84906243482 scopus 로고    scopus 로고
    • A comparison of algorithms for the pairwise alignment of biological networks
    • C. Clark, and J. Kalita A comparison of algorithms for the pairwise alignment of biological networks Bioinformatics 30 16 2014 2351 2359
    • (2014) Bioinformatics , vol.30 , Issue.16 , pp. 2351-2359
    • Clark, C.1    Kalita, J.2
  • 25
    • 44749091859 scopus 로고    scopus 로고
    • Information processing in complex networks: Graph entropy and information functionals
    • M. Dehmer Information processing in complex networks: graph entropy and information functionals Appl. Math. Comput. 201 2008 82 94
    • (2008) Appl. Math. Comput. , vol.201 , pp. 82-94
    • Dehmer, M.1
  • 26
    • 84964322615 scopus 로고    scopus 로고
    • Mining graph patterns in web-based systems: A conceptual view
    • A. Mehler, S. Sharoff, G. Rehm, M. Santini, Springer Berlin/New York
    • M. Dehmer, and F. Emmert-Streib Mining graph patterns in web-based systems: a conceptual view A. Mehler, S. Sharoff, G. Rehm, M. Santini, Genres on the Web: Computational Models and Empirical Studies 2010 Springer Berlin/New York 237 253
    • (2010) Genres on the Web: Computational Models and Empirical Studies , pp. 237-253
    • Dehmer, M.1    Emmert-Streib, F.2
  • 27
    • 49849085811 scopus 로고    scopus 로고
    • A new method of measuring similarity for a special class of directed graphs
    • M. Dehmer, and A. Mehler A new method of measuring similarity for a special class of directed graphs Tatra Mount. Math. Publ. 36 2007 39 59
    • (2007) Tatra Mount. Math. Publ. , vol.36 , pp. 39-59
    • Dehmer, M.1    Mehler, A.2
  • 28
    • 33750819438 scopus 로고    scopus 로고
    • A similarity measure for graphs with low computational complexity
    • M. Dehmer, F. Emmert-Streib, and J. Kilian A similarity measure for graphs with low computational complexity Appl. Math. Comput. 182 2006 447 459
    • (2006) Appl. Math. Comput. , vol.182 , pp. 447-459
    • Dehmer, M.1    Emmert-Streib, F.2    Kilian, J.3
  • 30
    • 77949528269 scopus 로고    scopus 로고
    • A large scale analysis of information-theoretic network complexity measures using chemical structures
    • M. Dehmer, N. Barbarini, K. Varmuza, and A. Graber A large scale analysis of information-theoretic network complexity measures using chemical structures PLoS ONE 4 12 2009 e8057
    • (2009) PLoS ONE , vol.4 , Issue.12 , pp. e8057
    • Dehmer, M.1    Barbarini, N.2    Varmuza, K.3    Graber, A.4
  • 31
    • 84896716942 scopus 로고    scopus 로고
    • Large-scale evaluation of molecular descriptors by means of clustering
    • M. Dehmer, F. Emmert-Streib, and S. Tripathi Large-scale evaluation of molecular descriptors by means of clustering PLoS ONE 8 12 2013 e83956
    • (2013) PLoS ONE , vol.8 , Issue.12 , pp. e83956
    • Dehmer, M.1    Emmert-Streib, F.2    Tripathi, S.3
  • 32
    • 84899705018 scopus 로고    scopus 로고
    • Interrelations of graph distance measures based on topological indices
    • M. Dehmer, F. Emmert-Streib, and Y. Shi Interrelations of graph distance measures based on topological indices PLoS ONE 9 2014 e94985
    • (2014) PLoS ONE , vol.9 , pp. e94985
    • Dehmer, M.1    Emmert-Streib, F.2    Shi, Y.3
  • 35
    • 34548747580 scopus 로고    scopus 로고
    • The chronic fatigue syndrome: A comparative pathway analysis
    • F. Emmert-Streib The chronic fatigue syndrome: a comparative pathway analysis J. Comput. Biol. 14 7 2007 961 972
    • (2007) J. Comput. Biol. , vol.14 , Issue.7 , pp. 961-972
    • Emmert-Streib, F.1
  • 36
    • 34548747580 scopus 로고    scopus 로고
    • The chronic fatigue syndrome: A comparative pathway analysis
    • F. Emmert-Streib The chronic fatigue syndrome: a comparative pathway analysis J. Comput. Biol. 14 7 2007
    • (2007) J. Comput. Biol. , vol.14 , Issue.7
    • Emmert-Streib, F.1
  • 38
    • 79960325408 scopus 로고    scopus 로고
    • Networks for systems biology: Conceptual connection of data and function
    • F. Emmert-Streib, and M. Dehmer Networks for systems biology: conceptual connection of data and function IET Syst. Biol. 5 2011 185 207
    • (2011) IET Syst. Biol. , vol.5 , pp. 185-207
    • Emmert-Streib, F.1    Dehmer, M.2
  • 39
    • 84860700562 scopus 로고    scopus 로고
    • Exploring statistical and population aspects of network complexity
    • F. Emmert-Streib, and M. Dehmer Exploring statistical and population aspects of network complexity PLoS ONE 7 2012 e34523
    • (2012) PLoS ONE , vol.7 , pp. e34523
    • Emmert-Streib, F.1    Dehmer, M.2
  • 41
    • 84964371647 scopus 로고    scopus 로고
    • Detecting pathological pathways of the chronic fatigue syndrome by the comparison of networks
    • P. McConnell, S. Lin, A. Cuticcia, CreateSpace
    • F. Emmert-Streib, E.F. Glynn, C. Seidel, C.L. Bausch, and A. Mushegian Detecting pathological pathways of the chronic fatigue syndrome by the comparison of networks P. McConnell, S. Lin, A. Cuticcia, Methods of Microarray Data Analysis VI 2009 CreateSpace
    • (2009) Methods of Microarray Data Analysis VI
    • Emmert-Streib, F.1    Glynn, E.F.2    Seidel, C.3    Bausch, C.L.4    Mushegian, A.5
  • 44
    • 0000673504 scopus 로고
    • Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
    • J.H. Friedman, and L.C. Rafsky Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests Ann. Stat. 7 4 1979 697 717
    • (1979) Ann. Stat. , vol.7 , Issue.4 , pp. 697-717
    • Friedman, J.H.1    Rafsky, L.C.2
  • 45
    • 55949083343 scopus 로고    scopus 로고
    • Neuroendocrine and immune network re-modeling in chronic fatigue syndrome: An exploratory analysis
    • J. Fuite, S. Vernon, and G. Broderick Neuroendocrine and immune network re-modeling in chronic fatigue syndrome: an exploratory analysis Genomics 92 2008 393 399
    • (2008) Genomics , vol.92 , pp. 393-399
    • Fuite, J.1    Vernon, S.2    Broderick, G.3
  • 46
    • 73749086870 scopus 로고    scopus 로고
    • A survey of graph edit distance
    • X. Gao, B. Xiao, D. Tao, and X. Li A survey of graph edit distance Pattern Anal. Appl. 13 1 2010 113 129 10.1007/s10044-008-0141-y
    • (2010) Pattern Anal. Appl. , vol.13 , Issue.1 , pp. 113-129
    • Gao, X.1    Xiao, B.2    Tao, D.3    Li, X.4
  • 48
    • 9444266406 scopus 로고    scopus 로고
    • On graph kernels: Hardness results and efficient alternatives
    • T. Gärtner, P.A. Flach, and S. Wrobel On graph kernels: hardness results and efficient alternatives COLT 2003 129 143
    • (2003) COLT , pp. 129-143
    • Gärtner, T.1    Flach, P.A.2    Wrobel, S.3
  • 49
    • 34248174738 scopus 로고
    • Measuring the similarity of complex structures by means of graph grammars
    • D. Gernert Measuring the similarity of complex structures by means of graph grammars Bull. EATCS 7 1979 3 9
    • (1979) Bull. EATCS , vol.7 , pp. 3-9
    • Gernert, D.1
  • 50
    • 34248154611 scopus 로고
    • Graph grammars which generate graphs with specified properties
    • D. Gernert Graph grammars which generate graphs with specified properties Bull. EATCS 13 1981 13 20
    • (1981) Bull. EATCS , vol.13 , pp. 13-20
    • Gernert, D.1
  • 51
    • 77950544798 scopus 로고    scopus 로고
    • A statistical framework for differential network analysis from microarray data
    • R. Gill, S. Datta, and S. Datta A statistical framework for differential network analysis from microarray data BMC Bioinformat. 11 1 2010 95
    • (2010) BMC Bioinformat. , vol.11 , Issue.1 , pp. 95
    • Gill, R.1    Datta, S.2    Datta, S.3
  • 53
    • 0003780715 scopus 로고
    • Addison Wesley Publishing Company Reading, MA, USA
    • F. Harary Graph Theory 1969 Addison Wesley Publishing Company Reading, MA, USA
    • (1969) Graph Theory
    • Harary, F.1
  • 54
    • 84907022389 scopus 로고    scopus 로고
    • Hubalign: An accurate and efficient method for global alignment of protein-protein interaction networks
    • S. Hashemifar, and J. Xu Hubalign: an accurate and efficient method for global alignment of protein-protein interaction networks Bioinformatics 30 17 2014 i438 i444
    • (2014) Bioinformatics , vol.30 , Issue.17 , pp. i438-i444
    • Hashemifar, S.1    Xu, J.2
  • 55
    • 84874289423 scopus 로고    scopus 로고
    • Graphlet-based measures are suitable for biological network comparison
    • W. Hayes, K. Sun, and N. Przulj Graphlet-based measures are suitable for biological network comparison Bioinformatics 29 4 2013 483 491
    • (2013) Bioinformatics , vol.29 , Issue.4 , pp. 483-491
    • Hayes, W.1    Sun, K.2    Przulj, N.3
  • 58
    • 43049099687 scopus 로고    scopus 로고
    • Graph-based representation for similarity retrieval of symbolic images
    • S.M. Hsieh, and C.C. Hsu Graph-based representation for similarity retrieval of symbolic images Data Knowl. Eng. 65 3 2008 401 418
    • (2008) Data Knowl. Eng. , vol.65 , Issue.3 , pp. 401-418
    • Hsieh, S.M.1    Hsu, C.C.2
  • 59
    • 84929142462 scopus 로고    scopus 로고
    • Localali: An evolutionary-based local alignment approach to identify functionally conserved modules in multiple networks
    • J. Hu, and K. Reinert Localali: an evolutionary-based local alignment approach to identify functionally conserved modules in multiple networks Bioinformatics 31 3 2014 363 372
    • (2014) Bioinformatics , vol.31 , Issue.3 , pp. 363-372
    • Hu, J.1    Reinert, K.2
  • 62
    • 33750816097 scopus 로고
    • Graphmetriken und Distanzgraphen
    • F. Kaden Graphmetriken und Distanzgraphen ZKI-Inform. Akad. Wiss. DDR 2 82 1982 1 63
    • (1982) ZKI-Inform. Akad. Wiss. DDR , vol.2 , Issue.82 , pp. 1-63
    • Kaden, F.1
  • 63
    • 84892817305 scopus 로고
    • Halbgeordnete Graphmengen und Graphmetriken
    • H. Sachs, Teubner Leipzig, DDR
    • F. Kaden Halbgeordnete Graphmengen und Graphmetriken H. Sachs, Graphs, Hypergraphs, and Applications 73 1985 Teubner Leipzig, DDR 92 95
    • (1985) Graphs, Hypergraphs, and Applications , vol.73 , pp. 92-95
    • Kaden, F.1
  • 64
    • 34248150773 scopus 로고
    • Graphmetriken und Isometrieproblemezugehöriger Distanzgraphen
    • F. Kaden Graphmetriken und Isometrieproblemezugehöriger Distanzgraphen ZKI-Inform. Akad. Wiss. DDR 1986 1 100
    • (1986) ZKI-Inform. Akad. Wiss. DDR , pp. 1-100
    • Kaden, F.1
  • 65
    • 84925015929 scopus 로고
    • Graph similarity and distances
    • Bodendiek R. Henn, Physica-Verlag
    • F. Kaden Graph similarity and distances Bodendiek R. Henn, Topics in Combinatorics and Graph Theory 1990 Physica-Verlag 397 404
    • (1990) Topics in Combinatorics and Graph Theory , pp. 397-404
    • Kaden, F.1
  • 66
    • 60849107715 scopus 로고    scopus 로고
    • A new graph-based method for pairwise global network alignment
    • G.W. Klau A new graph-based method for pairwise global network alignment BMC Bioinform. 10 1 2009
    • (2009) BMC Bioinform. , vol.10 , Issue.1
    • Klau, G.W.1
  • 67
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J.M. Kleinberg Authoritative sources in a hyperlinked environment J. ACM 46 5 1999 604 632
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 70
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V.I. Levenstein Binary codes capable of correcting deletions, insertions, and reversals Sov. Phys. - Doklady 10 8 1966 707 710
    • (1966) Sov. Phys. - Doklady , vol.10 , Issue.8 , pp. 707-710
    • Levenstein, V.I.1
  • 73
    • 77956414002 scopus 로고    scopus 로고
    • A network model of interpersonal alignment
    • A. Mehler, P. Weiß, and A. Lücking A network model of interpersonal alignment Entropy 12 6 2010 1440 1483 10.3390/e12061440
    • (2010) Entropy , vol.12 , Issue.6 , pp. 1440-1483
    • Mehler, A.1    Weiß, P.2    Lücking, A.3
  • 75
    • 84911887210 scopus 로고    scopus 로고
    • Distance-based analysis of variance: Approximate inference
    • C. Minas, and G. Montana Distance-based analysis of variance: approximate inference Stat. Anal. Data Mining 7 6 2014 450 470 10.1002/sam.11227
    • (2014) Stat. Anal. Data Mining , vol.7 , Issue.6 , pp. 450-470
    • Minas, C.1    Montana, G.2
  • 76
    • 80053904998 scopus 로고    scopus 로고
    • A network-based approach to classify the three domains of life
    • L.A.J. Müller, K.G. Kugler, A. Graber, and M. Dehmer A network-based approach to classify the three domains of life Biol. Direct 6 2011 140 141
    • (2011) Biol. Direct , vol.6 , pp. 140-141
    • Müller, L.A.J.1    Kugler, K.G.2    Graber, A.3    Dehmer, M.4
  • 79
    • 84879967643 scopus 로고    scopus 로고
    • NETAL: A new graph-based method for global alignment of protein-protein interaction networks
    • B. Neyshabur, A. Khadem, S. Hashemifar, and S.S. Arab NETAL: a new graph-based method for global alignment of protein-protein interaction networks Bioinformatics 2013
    • (2013) Bioinformatics
    • Neyshabur, B.1    Khadem, A.2    Hashemifar, S.3    Arab, S.S.4
  • 80
    • 84870396392 scopus 로고    scopus 로고
    • Global network alignment using multiscale spectral signatures
    • R. Patro, and C. Kingsford Global network alignment using multiscale spectral signatures Bioinformatics 28 23 2012 3105 3114
    • (2012) Bioinformatics , vol.28 , Issue.23 , pp. 3105-3114
    • Patro, R.1    Kingsford, C.2
  • 81
    • 84860471091 scopus 로고    scopus 로고
    • Pinalog: A novel approach to align protein interaction networks implications for complex detection and function prediction
    • H.T.T. Phan, and M.J.E. Sternberg Pinalog: a novel approach to align protein interaction networks implications for complex detection and function prediction Bioinformatics 28 9 2012 1239 1245
    • (2012) Bioinformatics , vol.28 , Issue.9 , pp. 1239-1245
    • Phan, H.T.T.1    Sternberg, M.J.E.2
  • 82
    • 33846672214 scopus 로고    scopus 로고
    • Network comparison using graphlet degree distribution
    • N. Pržulj Network comparison using graphlet degree distribution Bioinformatics 23 2007 e177 e183
    • (2007) Bioinformatics , vol.23 , pp. e177-e183
    • Pržulj, N.1
  • 83
    • 84907910598 scopus 로고    scopus 로고
    • Node fingerprinting: An efficient heuristic for aligning biological networks
    • A. Radu, and M. Charleston Node fingerprinting: an efficient heuristic for aligning biological networks J. Comput. Biol. 21 10 2014 760 770
    • (2014) J. Comput. Biol. , vol.21 , Issue.10 , pp. 760-770
    • Radu, A.1    Charleston, M.2
  • 84
    • 84870441671 scopus 로고    scopus 로고
    • Gene set analysis for self-contained tests: Complex null and specific alternative hypotheses
    • Y. Rahmatallah, F. Emmert-Streib, and G. Glazko Gene set analysis for self-contained tests: complex null and specific alternative hypotheses Bioinformatics 28 23 2012 3073 3080
    • (2012) Bioinformatics , vol.28 , Issue.23 , pp. 3073-3080
    • Rahmatallah, Y.1    Emmert-Streib, F.2    Glazko, G.3
  • 85
    • 84893275855 scopus 로고    scopus 로고
    • Gene Sets Net Correlations Analysis (GSNCA): A multivariate differential coexpression test for gene sets
    • Y. Rahmatallah, F. Emmert-Streib, and G. Glazko Gene Sets Net Correlations Analysis (GSNCA): a multivariate differential coexpression test for gene sets Bioinformatics 30 3 2014 360 368
    • (2014) Bioinformatics , vol.30 , Issue.3 , pp. 360-368
    • Rahmatallah, Y.1    Emmert-Streib, F.2    Glazko, G.3
  • 86
    • 0002887739 scopus 로고
    • Design of molecules with desired properties. Molecular similarity approach to property optimization
    • M.A. Johnson, G. Maggiora, Wiley
    • M. Randić Design of molecules with desired properties. molecular similarity approach to property optimization M.A. Johnson, G. Maggiora, Concepts and Applications of Molecular Similarity 1990 Wiley 77 145
    • (1990) Concepts and Applications of Molecular Similarity , pp. 77-145
    • Randić, M.1
  • 87
    • 0010037175 scopus 로고
    • Graph theoretical approach to recognition of structural similarity in molecules
    • M. Randić, and C.L. Wilkins Graph theoretical approach to recognition of structural similarity in molecules J. Chem. Inf. Comput. Sci. 19 1979 31 37
    • (1979) J. Chem. Inf. Comput. Sci. , vol.19 , pp. 31-37
    • Randić, M.1    Wilkins, C.L.2
  • 88
    • 77956496698 scopus 로고    scopus 로고
    • How threshold behaviour affects the use of subgraphs for network comparison
    • T. Rito, Z. Wang, C.M. Deane, and G. Reinert How threshold behaviour affects the use of subgraphs for network comparison Bioinformatics 26 18 2010 i611 i617
    • (2010) Bioinformatics , vol.26 , Issue.18 , pp. i611-i617
    • Rito, T.1    Wang, Z.2    Deane, C.M.3    Reinert, G.4
  • 95
    • 84921734389 scopus 로고    scopus 로고
    • MAGNA: Maximizing accuracy in global network alignment
    • V. Saraph, and T. Milenkovi MAGNA: Maximizing accuracy in global network alignment Bioinformatics 2014
    • (2014) Bioinformatics
    • Saraph, V.1    Milenkovi, T.2
  • 97
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • S.M. Selkow The tree-to-tree editing problem Inf. Process. Lett. 6 6 1977 184 186
    • (1977) Inf. Process. Lett. , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.M.1
  • 98
    • 0035312753 scopus 로고    scopus 로고
    • Graph matching vs mutual information maximization for object detection
    • L.B. Shams, M.J. Brady, and S. Schaal Graph matching vs mutual information maximization for object detection Neural Netw. 14 3 2001 345 354
    • (2001) Neural Netw. , vol.14 , Issue.3 , pp. 345-354
    • Shams, L.B.1    Brady, M.J.2    Schaal, S.3
  • 99
    • 33645732240 scopus 로고    scopus 로고
    • Modeling cellular machinery through biological network comparison.
    • R. Sharan, and T. Ideker Modeling cellular machinery through biological network comparison. Nat. Biotechnol. 24 4 2006 427 433
    • (2006) Nat. Biotechnol. , vol.24 , Issue.4 , pp. 427-433
    • Sharan, R.1    Ideker, T.2
  • 101
    • 33750843858 scopus 로고
    • Graphmetriken und Klassifikation strukturierter Objekte
    • F. Sobik Graphmetriken und Klassifikation strukturierter Objekte ZKI-Inform. Akad. Wiss. DDR 2 82 1982 63 122
    • (1982) ZKI-Inform. Akad. Wiss. DDR , vol.2 , Issue.82 , pp. 63-122
    • Sobik, F.1
  • 102
    • 33750837832 scopus 로고
    • Modellierung von Vergleichsprozessen auf der Grundlage von Ähnlichkeitsmaßen für Graphen
    • F. Sobik Modellierung von Vergleichsprozessen auf der Grundlage von Ähnlichkeitsmaßen für Graphen ZKI-Inform. Akad. Wiss. DDR 4 1986 104 144
    • (1986) ZKI-Inform. Akad. Wiss. DDR , vol.4 , pp. 104-144
    • Sobik, F.1
  • 103
    • 33745770038 scopus 로고    scopus 로고
    • Simulation-based graph similarity
    • LNCS Springer
    • O. Sokolsky, S. Kannan, and I. Lee Simulation-based graph similarity TACAS LNCS 2006 Springer 426 440
    • (2006) TACAS , pp. 426-440
    • Sokolsky, O.1    Kannan, S.2    Lee, I.3
  • 106
    • 49849104844 scopus 로고
    • Operations on cognitive structures - Their modeling on the basis of graph theory
    • D. Albert, Springer
    • E. Sommerfeld, and F. Sobik Operations on cognitive structures - their modeling on the basis of graph theory D. Albert, Knowledge Structures 1994 Springer 146 190
    • (1994) Knowledge Structures , pp. 146-190
    • Sommerfeld, E.1    Sobik, F.2
  • 109
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K.C. Tai The tree-to-tree correction problem J. ACM 26 3 1979 422 433
    • (1979) J. ACM , vol.26 , Issue.3 , pp. 422-433
    • Tai, K.C.1
  • 111
    • 33745363460 scopus 로고    scopus 로고
    • Multivariate image similarity in the compressed domain using statistical graph matching
    • C. Theoharatos, V.K. Pothos, N.A. Laskaris, G. Economou, and S. Fotopoulos Multivariate image similarity in the compressed domain using statistical graph matching Pattern Recognit. 39 10 2006 1892 1904
    • (2006) Pattern Recognit. , vol.39 , Issue.10 , pp. 1892-1904
    • Theoharatos, C.1    Pothos, V.K.2    Laskaris, N.A.3    Economou, G.4    Fotopoulos, S.5
  • 115
    • 58149411184 scopus 로고
    • Features of similarity
    • A. Tversky Features of similarity Psychol. Rev. 84 1977 327 352
    • (1977) Psychol. Rev. , vol.84 , pp. 327-352
    • Tversky, A.1
  • 116
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • J.R. Ullmann An algorithm for subgraph isomorphism J. ACM 23 1 1976 31 42
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 31-42
    • Ullmann, J.R.1
  • 119
    • 77951085620 scopus 로고    scopus 로고
    • Random projection experiments with chemometric data
    • K. Varmuza, P. Filzmoser, and B. Liebmann Random projection experiments with chemometric data J. Chemom. 24 2010 209 217
    • (2010) J. Chemom. , vol.24 , pp. 209-217
    • Varmuza, K.1    Filzmoser, P.2    Liebmann, B.3
  • 120
    • 0000086098 scopus 로고
    • Some unsolved problems in graph theory
    • V.G. Vizing Some unsolved problems in graph theory Uspehi Mat. Naukno. 23 1968 117 134
    • (1968) Uspehi Mat. Naukno. , vol.23 , pp. 117-134
    • Vizing, V.G.1
  • 121
    • 77951192371 scopus 로고    scopus 로고
    • Global screening of potential Candida albicansbiofilm-related transcription factors via network comparison
    • Y.-C. Wang, C.-Y. Lan, W.-P. Hsieh, L. Murillo, N. Agabian, and B.-S. Chen Global screening of potential Candida albicansbiofilm-related transcription factors via network comparison BMC Bioinform. 11 1 2010 53
    • (2010) BMC Bioinform. , vol.11 , Issue.1 , pp. 53
    • Wang, Y.-C.1    Lan, C.-Y.2    Hsieh, W.-P.3    Murillo, L.4    Agabian, N.5    Chen, B.-S.6
  • 122
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • D.J. Watts, and S.H. Strogatz Collective dynamics of 'small-world' networks Nature 393 1998 440 442
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 124
    • 36248998189 scopus 로고    scopus 로고
    • Graph similarity scoring and matching
    • L.A. Zager, and G.C. Verghese Graph similarity scoring and matching Appl. Math. Lett. 21 2008 86 94
    • (2008) Appl. Math. Lett. , vol.21 , pp. 86-94
    • Zager, L.A.1    Verghese, G.C.2
  • 125
    • 0040994741 scopus 로고
    • On a certain distance between isomorphism classes of graphs
    • B. Zelinka On a certain distance between isomorphism classes of graphs Časopis pro pěst. Math. 100 1975 371 373
    • (1975) Časopis Pro Pěst. Math. , vol.100 , pp. 371-373
    • Zelinka, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.