A Similarity Search Using Molecular Topological Graphs

被引:1
|
作者
Fukunishi, Yoshifumi [1 ]
Nakamura, Haruki [1 ,2 ]
机构
[1] Natl Inst Adv Ind Sci & Technol, BIRC, Koto Ku, Tokyo 1350064, Japan
[2] Osaka Univ, Inst Prot Res, Suita, Osaka 5650871, Japan
关键词
LIGAND-BINDING; AFFINITY; DOCKING;
D O I
10.1155/2009/231780
中图分类号
Q81 [生物工程学(生物技术)]; Q93 [微生物学];
学科分类号
071005 ; 0836 ; 090102 ; 100705 ;
摘要
A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule. The ordinary adjacency matrix is suitable to compare the local structures of molecules such as functional groups, and the other matrix is suitable to compare the global structures of molecules. The combination of these two matrices gave a similarity measure. This method was applied to in silico drug screening, and the results showed that it was effective as a similarity measure. Copyright (C) 2009 Y. Fukunishi and H. Nakamura.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Similarity Search Over Graphs Using Localized Spectral Analysis
    Aizenbud, Yariv
    Averbuch, Amir
    Shabat, Gil
    Ziv, Guy
    2017 INTERNATIONAL CONFERENCE ON SAMPLING THEORY AND APPLICATIONS (SAMPTA), 2017, : 635 - 638
  • [2] Mining patents using molecular similarity search
    Rhodes, James
    Boyer, Stephen
    Kreulen, Jeffrey
    Chen, Ying
    Ordonez, Patricia
    PACIFIC SYMPOSIUM ON BIOCOMPUTING 2007, 2007, : 304 - +
  • [3] Characterization of the molecular similarity of chemicals using topological invariants
    Basak, SC
    Gute, BD
    Grunwald, GD
    ADVANCES IN MOLECULAR SIMILARITY, VOL 2 - 1998, 1998, 2 : 171 - 185
  • [4] On entropy measures of molecular graphs using topological indices
    Manzoor, Shazia
    Siddiqui, Muhammad Kamran
    Ahmad, Sarfraz
    ARABIAN JOURNAL OF CHEMISTRY, 2020, 13 (08) : 6285 - 6298
  • [5] Fast filtering of structural similarity search using discovery of topological patterns
    Park, SH
    Ryu, KH
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING IDEAL 2004, PROCEEDINGS, 2004, 3177 : 396 - 401
  • [6] Fast Similarity Search for Graphs by Edit Distance
    D. A. Rachkovskij
    Cybernetics and Systems Analysis, 2019, 55 : 1039 - 1051
  • [7] Towards distributed node similarity search on graphs
    Zhang, Tianming
    Gao, Yunjun
    Zheng, Baihua
    Chen, Lu
    Wen, Shiting
    Guo, Wei
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2020, 23 (06): : 3025 - 3053
  • [8] Towards distributed node similarity search on graphs
    Tianming Zhang
    Yunjun Gao
    Baihua Zheng
    Lu Chen
    Shiting Wen
    Wei Guo
    World Wide Web, 2020, 23 : 3025 - 3053
  • [9] Fast Similarity Search for Graphs by Edit Distance
    Rachkovskij, D. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2019, 55 (06) : 1039 - 1051
  • [10] Efficient Similarity Search for Sets over Graphs
    Wang, Yue
    Feng, Zonghao
    Chen, Lei
    Li, Zijian
    Jian, Xun
    Luo, Qiong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (02) : 444 - 458