메뉴 건너뛰기




Volumn , Issue 48, 2003, Pages 197-207

A line graph algorithm for clustering chemical structures based on common substructural cores

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; CLUSTER ANALYSIS; MATHEMATICAL COMPUTING; THEORETICAL STUDY;

EID: 0142169800     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)

References (13)
  • 2
    • 0036022963 scopus 로고    scopus 로고
    • Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases
    • in the press
    • J. Raymond and P. Willett, Effectiveness of Graph-Based and Fingerprint-Based Similarity Measures for Virtual Screening of 2D Chemical Structure Databases, J. Comput.-Aided Mol. Des., in the press.
    • J. Comput.-Aided Mol. Des.
    • Raymond, J.1    Willett, P.2
  • 4
    • 0000821949 scopus 로고
    • The interchange graph of a finite graph
    • A. van Rooij and H. Wilf, The Interchange Graph of a Finite Graph, Acta Math. Hungar., 16 (1965), 263-269.
    • (1965) Acta Math. Hungar. , vol.16 , pp. 263-269
    • Van Rooij, A.1    Wilf, H.2
  • 5
    • 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, Patt. Recog. Lett., 18 (1997), 689-694.
    • (1997) Patt. Recog. Lett. , vol.18 , pp. 689-694
    • Bunke, H.1
  • 6
    • 0005579249 scopus 로고
    • Edge rotation and distance between graphs
    • G. Chartrand, F. Saba and H. Zou, Edge Rotation and Distance Between Graphs, Cas. Pest. Mat., 110 (1985), 87-91.
    • (1985) Cas. Pest. Mat. , vol.110 , pp. 87-91
    • Chartrand, G.1    Saba, F.2    Zou, H.3
  • 7
    • 0036522746 scopus 로고    scopus 로고
    • Heuristics for rapid similarity searching of chemical graphs using a maximum common edge subgraph algorithm
    • J. Raymond, E. Gardiner and P. Willett, Heuristics for Rapid Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm, J. Chem. Inf. Comput. Sci., 42 (2002), 305-316.
    • (2002) J. Chem. Inf. Comput. Sci. , vol.42 , pp. 305-316
    • Raymond, J.1    Gardiner, E.2    Willett, P.3
  • 8
    • 0036448558 scopus 로고    scopus 로고
    • RASCAL: Calculation of graph similarity using maximum common edge subgraphs
    • in the press
    • J. Raymond, E. Gardiner and P. Willett, RASCAL: Calculation of Graph Similarity Using Maximum Common Edge Subgraphs, Comput. J., in the press.
    • Comput. J.
    • Raymond, J.1    Gardiner, E.2    Willett, P.3
  • 9
    • 0001919798 scopus 로고
    • Graph theoretic techniques for cluster analysis algorithms
    • J. Van Ryzin, Ed., Academic Press
    • D.W. Matula, Graph Theoretic Techniques for Cluster Analysis Algorithms, in: Classification and Clustering, J. Van Ryzin, Ed., Academic Press (1977), 95-129.
    • (1977) Classification and Clustering , pp. 95-129
    • Matula, D.W.1
  • 10
    • 0000462999 scopus 로고    scopus 로고
    • Comparison of 2D fingerprint types and hierarchy level selection methods for structural grouping using ward's clustering
    • D.J. Wild and C.J. Blankley, Comparison of 2D Fingerprint Types and Hierarchy Level Selection Methods for Structural Grouping Using Ward's Clustering, J. Chem. Inf. Comput. Sci., 40 (2000), 155-162.
    • (2000) J. Chem. Inf. Comput. Sci. , vol.40 , pp. 155-162
    • Wild, D.J.1    Blankley, C.J.2
  • 11
    • 0001787150 scopus 로고
    • Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry
    • Y. Alavi, et al., Ed., J. Wiley & Sons
    • M. Johnson, Relating Metrics, Lines and Variables Defined on Graphs to Problems in Medicinal Chemistry, in: Graph Theory and Its Applications to Algorithms and Computer Science, Y. Alavi, et al., Ed., J. Wiley & Sons (1985), 457-470.
    • (1985) Graph Theory and Its Applications to Algorithms and Computer Science , pp. 457-470
    • Johnson, M.1
  • 12
    • 0142166593 scopus 로고
    • Graph decomposition: Imposing order on chaos
    • E. Allburn, Graph Decomposition: Imposing Order on Chaos, Dr. Dobbs J., 16 (1991), 88,90-2,94-6,118-20,122,124.
    • (1991) Dr. Dobbs J. , vol.16 , pp. 88
    • Allburn, E.1
  • 13
    • 0000228352 scopus 로고
    • A Monte Carlo study of thirty internal criterion measures for cluster analysis
    • G.W. Milligan, A Monte Carlo Study of Thirty Internal Criterion Measures for Cluster Analysis, Psychometrika, 46 (1980), 187-199.
    • (1980) Psychometrika , vol.46 , pp. 187-199
    • Milligan, G.W.1


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