Efficient maximum common subgraph (MCS) searching of large chemical databases

被引：0
|
作者：
Roger A Sayle
Jose Batista
J Andrew Grant
机构：
[1] NextMove Software Limited,Discovery Sciences
[2] AstraZeneca R&D,undefined
[3] Alderley Park,undefined
来源：
Journal of Cheminformatics | / 5卷 / Suppl 1期
关键词：
Harness; Chemical Similarity; Efficient Maximum; Dramatic Improvement; Previous Effort;
D O I：
10.1186/1758-2946-5-S1-O15
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] SmallWorld: Efficient maximum common subgraph searching of large databases
    Sayle, Roger A.
    Batista, Jose C.
    Grant, Andrew
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2012, 244
  • [2] Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm
    Raymond, JW
    Gardiner, EJ
    Willett, P
    [J]. JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2002, 42 (02): : 305 - 316
  • [3] SEARCHING OF LARGE DATABASES OF CHEMICAL-REACTIONS
    MILNE, GWA
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1995, 210 : 65 - CINF
  • [4] Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases
    Yuan, Ye
    Wang, Guoren
    Chent, Lei
    Wang, Haixun
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (09): : 800 - 811
  • [5] Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    John W. Raymond
    Peter Willett
    [J]. Journal of Computer-Aided Molecular Design, 2002, 16 : 521 - 533
  • [6] Between Subgraph Isomorphism and Maximum Common Subgraph
    Hoffmann, Ruth
    McCreesh, Ciaran
    Reilly, Craig
    [J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3907 - 3914
  • [7] Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    Raymond, JW
    Willett, P
    [J]. JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 2002, 16 (07) : 521 - 533
  • [8] An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
    Rutgers, Jochem H.
    Wolkotte, Pascal T.
    Holzenspies, Philip K. F.
    Kuper, Jan
    Smit, Gerard J. M.
    [J]. 13TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN: ARCHITECTURES, METHODS AND TOOLS, 2010, : 699 - 705
  • [9] Efficient mining for structurally diverse subgraph patterns in large molecular databases
    Maunz, Andreas
    Helma, Christoph
    Kramer, Stefan
    [J]. MACHINE LEARNING, 2011, 83 (02) : 193 - 218
  • [10] Efficient mining for structurally diverse subgraph patterns in large molecular databases
    Andreas Maunz
    Christoph Helma
    Stefan Kramer
    [J]. Machine Learning, 2011, 83 : 193 - 218
12345