Efficient heuristics for maximum common substructure search

Journal of Chemical Information and Modeling

Volumn 55, Issue 5, 2015, Pages 941-955

  Englert, Péter ^a   Kovács, Péter ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b ChemAxon Kft   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION;

CHEMINFORMATICS; DIVERSE APPLICATIONS; LEAD OPTIMIZATION; OPTIMIZATION PROBLEMS; RUNNING TIME; SIMILARITY SEARCH; STRICT CONSTRAINT; TOPOLOGICAL FEATURES;

HEURISTIC METHODS;

COMPUTER HEURISTICS; DRUG DEVELOPMENT; PROCEDURES; TIME FACTOR;

COMPUTER HEURISTICS; DRUG DISCOVERY; TIME FACTORS;

EID: 84930194247     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/acs.jcim.5b00036     Document Type: Article

References (59)

1. Ehrlich, H.-C.; Rarey, M. Maximum Common Subgraph Isomorphism Algorithms and Their Applications in Molecular Science: A review Wiley Interdiscip. Rev.: Comput. Mol. Sci. 2011, 1, 68-79
2. Dean, P. M. Molecular Similarity in Drug Design; Blackie Academic & Professional: London, 1995.
3. Sheridan, R. P.; Kearsley, S. K. Why Do We Need So Many Chemical Similarity Search Methods? Drug Discovery Today 2002, 7, 903-911
4. Willett, P.; Barnard, J. M.; Downs, G. M. Chemical Similarity Searching J. Chem. Inf. Comput. Sci. 1998, 38, 983-996
5. Willett, P. Searching Techniques for Databases of Two- and Three-Dimensional Chemical Structures J. Med. Chem. 2005, 48, 4183-4199
6. Willett, P. Similarity Methods in Chemoinformatics Annu. Rev. Inf. Sci. Technol. 2009, 43, 1-117
7. Bunke, H.; Shearer, K. A Graph Distance Metric Based on the Maximal Common Subgraph Pattern Recognit. Lett. 1998, 19, 255-259
8. Raymond, J. W.; Gardiner, E. J.; Willett, P. RASCAL: Calculation of Graph Similarity Using Maximum Common Edge Subgraphs Comput. J. 2002, 45, 631-644
9. Raymond, J. W.; Willett, P. Effectiveness of Graph-Based and Fingerprint-Based Similarity Measures for Virtual Screening of 2D Chemical Structure Databases J. Comput.-Aided Mol. Des. 2002, 16, 59-71
10. Johnson, M. A.; Maggiora, G. M. Concepts and Applications of Molecular Similarity; Wiley-Interscience: New York, 1990.
11. Boström, J.; Hogner, A.; Schmitt, S. Do Structurally Similar Ligands Bind in a Similar Fashion? J. Med. Chem. 2006, 49, 6716-6725
12. Stahl, M.; Mauser, H. Database Clustering with a Combination of Fingerprint and Maximum Common Substructure Methods J. Chem. Inf. Model. 2005, 45, 542-548
13. Gardiner, E. J.; Gillet, V. J.; Willett, P.; Cosgrove, D. A. Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs J. Chem. Inf. Model. 2007, 47, 354-366
14. Böcker, A. Toward an Improved Clustering of Large Data Sets Using Maximum Common Substructures and Topological Fingerprints J. Chem. Inf. Model. 2008, 48, 2097-2107
15. Sheridan, R. P. The Most Common Chemical Replacements in Drug-Like Compounds J. Chem. Inf. Comput. Sci. 2002, 42, 103-108
16. Southall, N. T. Kinase Patent Space Visualization Using Chemical Replacements J. Med. Chem. 2006, 49, 2103-2109
17. Raymond, J. W.; Watson, I. A.; Mahoui, A. Rationalizing Lead Optimization by Associating Quantitative Relevance with Molecular Structure Modification J. Chem. Inf. Model. 2009, 49, 1952-1962
18. McGregor, J. J.; Willett, P. Use of a Maximum Common Subgraph Algorithm in the Automatic Identification of Ostensible Bond Changes Occurring in Chemical Reactions J. Chem. Inf. Comput. Sci. 1981, 21, 137-140
19. Fooshee, D.; Andronico, A.; Baldi, P. ReactionMap: An Efficient Atom-Mapping Algorithm for Chemical Reactions J. Chem. Inf. Model. 2013, 53, 2812-2819
20. Marialke, J.; Körner, R.; Tietze, S.; Apostolakis, J. Graph-Based Molecular Alignment (GMA) J. Chem. Inf. Model. 2007, 47, 591-601
21. Kawabata, T.; Nakamura, H. 3D Flexible Alignment Using 2D Maximum Common Substructure: Dependence of Prediction Accuracy on Target-Reference Chemical Similarity J. Chem. Inf. Model. 2014, 54, 1850-1863
22. Shearer, K.; Bunke, H.; Venkatesh, S. Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection Using Decision Trees Pattern Recognit. 2001, 34, 1075-1091
23. Conte, D.; Foggia, P.; Sansone, C.; Vento, M. Thirty Years of Graph Matching in Pattern Recognition Int. J. Pattern Recognit. Artif. Intell. 2004, 18, 265-298
24. Trinajstic, N. Chemical Graph Theory; CRC Press: London, 1992.
25. Garey, M. R.; Johnson, D. S. Computers and Intractability; A Guide to the Theory of NP-Completeness; W. H. Freeman & Co.: San Francisco, 1990.
26. Brown, N. Chemoinformatics-An Introduction for Computer Scientists ACM Comput. Surv. 2009, 41, 8-38
27. Raymond, J. W.; Willett, P. Maximum Common Subgraph Isomorphism Algorithms for the Matching of Chemical Structures J. Comput.-Aided Mol. Des. 2002, 16, 521-533
28. Cao, Y.; Jiang, T.; Girke, T. A Maximum Common Substructure-Based Algorithm for Searching and Predicting Drug-Like Compounds Bioinformatics 2008, 24, 366-374
29. Kawabata, T. Build-Up Algorithm for Atomic Correspondence between Chemical Structures J. Chem. Inf. Model. 2011, 51, 1775-1787
30. Wang, Y.; Backman, T. W. H.; Horan, K.; Girke, T. fmcsR: Mismatch Tolerant Maximum Common Substructure Searching in R Bioinformatics 2013, 29, 2792-2794
31. Hariharan, R.; Janakiraman, A.; Nilakantan, R.; Singh, B.; Varghese, S.; Landrum, G.; Schuffenhauer, A. MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules J. Chem. Inf. Model. 2011, 51, 788-806
32. Dalke, A.; Hastings, J. FMCS: A Novel Algorithm for the Multiple MCS Problem J. Cheminf. 2013, 5, O6
33. McGregor, J. J. Backtrack Search Algorithms and the Maximal Common Subgraph Problem Software: Pract. Exper. 1982, 12, 23-34
34. Chen, L.; Robien, W. MCSS: A New Algorithm for Perception of Maximal Common Substructures and Its Application to NMR Spectral Studies. 1. The Algorithm J. Chem. Inf. Comput. Sci. 1992, 32, 501-506
35. Krissinel, E. B.; Henrick, K. Common Subgraph Isomorphism Detection by Backtracking Search Software: Pract. Exper. 2004, 34, 591-607
36. Durand, P. J.; Pasari, R.; Baker, J. W.; Tsai, C.-c. An Efficient Algorithm for Similarity Analysis of Molecules Internet J. Chem. 1999, 2, 1-16
37. Koch, I. Enumerating All Connected Maximal Common Subgraphs in Two Graphs Theor. Comput. Sci. 2001, 250, 1-30
38. Raymond, J. W.; Gardiner, E. J.; Willett, P. Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm J. Chem. Inf. Comput. Sci. 2002, 42, 305-316
39. Brown, R. D.; Jones, G.; Willett, P.; Glen, R. C. Matching Two-Dimensional Chemical Graphs Using Genetic Algorithms J. Chem. Inf. Comput. Sci. 1994, 34, 63-70
40. Wang, T.; Zhou, J. EMCSS: A New Method for Maximal Common Substructure Search J. Chem. Inf. Comput. Sci. 1997, 37, 828-834
41. Takahashi, Y.; Sukekawa, M.; Sasaki, S. Automatic Identification of Molecular Similarity Using Reduced-Graph Representation of Chemical Structure J. Chem. Inf. Comput. Sci. 1992, 32, 639-643
42. Rarey, M.; Dixon, J. S. Feature Trees: A New Molecular Similarity Measure Based on Tree Matching J. Comput.-Aided Mol. Des. 1998, 12, 471-490
43. Barker, E. J.; Buttar, D.; Cosgrove, D. A.; Gardiner, E. J.; Kitts, P.; Willett, P.; Gillet, V. J. Scaffold Hopping Using Clique Detection Applied to Reduced Graphs J. Chem. Inf. Model. 2006, 46, 503-511
44. Levi, G. A. Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs Calcolo 1973, 9, 341-352
45. Nicholson, V.; Tsai, C.-C.; Johnson, M.; Naim, M. A Subgraph Isomorphism Theorem for Molecular Graphs. In Graph Theory and Topology in Chemistry; Elsevier: Amsterdam, 1987; pp 226-230.
46. Grosso, A.; Locatelli, M.; Pullan, W. Simple Ingredients Leading to Very Efficient Heuristics for the Maximum Clique Problem J. Heuristics 2008, 14, 587-612
47. Whitney, H. Congruent Graphs and the Connectivity of Graphs Am. J. Math. 1932, 54, 150-168
48. Harary, F. Graph Theory; Addison-Wesley: Reading, MA, 1969.
49. Bolton, E. E.; Wang, Y.; Thiessen, P. A.; Bryant, S. H. PubChem: Integrated Platform of Small Molecules and Biological Activities. In Annual Reports in Computational Chemistry, Vol. 4; American Chemical Society: Washington, DC, 1990; Chapter 12.
50. Morgan, H. L. The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service J. Chem. Doc. 1965, 5, 107-113
51. Rogers, D.; Hahn, M. Extended-Connectivity Fingerprints J. Chem. Inf. Model. 2010, 50, 742-754
52. Stahl, M.; Mauser, H.; Tsui, M.; Taylor, N. R. A Robust Clustering Method for Chemical Structures J. Med. Chem. 2005, 48, 4358-4366
53. Rahman, S.; Bashton, M.; Holliday, G.; Schrader, R.; Thornton, J. Small Molecule Subgraph Detector (SMSD) Toolkit J. Cheminf. 2009, 1, 12
54. Kawabata, T. KCOMBU: For Matching Chemical Structure by the Build-Up Algorithm. http://strcomp.protein.osaka-u.ac.jp/kcombu/ (accessed March 2015).
55. Berman, H. M.; Westbrook, J.; Feng, Z.; Gilliland, G.; Bhat, T. N.; Weissig, H.; Shindyalov, I. N.; Bourne, P. E. The Protein Data Bank Nucleic Acids Res. 2000, 28, 235-242
56. Berman, H. M.; Henrick, K.; Nakamura, H.; Markley, J. L. The Worldwide Protein Data Bank (wwPDB): Ensuring a Single, Uniform Archive of PDB Data Nucleic Acids Res. 2007, 35, D301-D303
57. Funabiki, N.; Kitamichi, J. A Two-Stage Discrete Optimization Method for Largest Common Subgraph Problems IEICE Trans. Inf. Syst. 1999, E82-D, 1145-1153
58. Fukunishi, Y.; Nakamura, H. Integration of Ligand-Based Drug Screening with Structure-Based Drug Screening by Combining Maximum Volume Overlapping Score with Ligand Docking Pharmaceuticals 2012, 5, 1332-1345
59. Brylinski, M. Nonlinear Scoring Functions for Similarity-Based Ligand Docking and Binding Affinity Prediction J. Chem. Inf. Model. 2013, 53, 3097-3112