{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:50:20Z","timestamp":1760237420368,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18H04113"],"award-info":[{"award-number":["18H04113"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Inference of chemical compounds with desired properties is important for drug design, chemo-informatics, and bioinformatics, to which various algorithmic and machine learning techniques have been applied. Recently, a novel method has been proposed for this inference problem using both artificial neural networks (ANN) and mixed integer linear programming (MILP). This method consists of the training phase and the inverse prediction phase. In the training phase, an ANN is trained so that the output of the ANN takes a value nearly equal to a given chemical property for each sample. In the inverse prediction phase, a chemical structure is inferred using MILP and enumeration so that the structure can have a desired output value for the trained ANN. However, the framework has been applied only to the case of acyclic and monocyclic chemical compounds so far. In this paper, we significantly extend the framework and present a new method for the inference problem for rank-2 chemical compounds (chemical graphs with cycle index 2). The results of computational experiments using such chemical properties as octanol\/water partition coefficient, melting point, and boiling point suggest that the proposed method is much more useful than the previous method.<\/jats:p>","DOI":"10.3390\/a13050124","type":"journal-article","created":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T11:34:14Z","timestamp":1589801654000},"page":"124","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming"],"prefix":"10.3390","volume":"13","author":[{"given":"Jianshen","family":"Zhu","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8501, Japan"}]},{"given":"Chenxi","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8501, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9224-6929","authenticated-orcid":false,"given":"Aleksandar","family":"Shurbevski","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8501, Japan"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8501, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9763-797X","authenticated-orcid":false,"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji 611-0011, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2020,5,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1021\/acs.jcim.5b00628","article-title":"Inverse QSPR\/QSAR analysis for chemical structure generation (from y to x)","volume":"56","author":"Miyao","year":"2016","journal-title":"J. Chem. Inf. Model."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1021\/ci00014a017","article-title":"Inverse problem in QSAR\/QSPR studies for the case of topological indices characterizing molecular shape (Kier indices)","volume":"33","author":"Skvortsova","year":"1993","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10822-016-0008-z","article-title":"Bayesian molecular design with a chemical language model","volume":"31","author":"Ikebata","year":"2017","journal-title":"J. Comput. Aided Mol. Des."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1021\/ci500749q","article-title":"Strategy to discover diverse optimal molecules in the small molecule universe","volume":"55","author":"Rupakheti","year":"2015","journal-title":"J. Chem. Inf. Model."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1021\/ci700385a","article-title":"Enumerating treelike chemical graphs with given path frequency","volume":"48","author":"Fujiwara","year":"2008","journal-title":"J. Chem. Inf. Model."},{"key":"ref_6","first-page":"205","article-title":"MOLGEN 4.0","volume":"37","author":"Kerber","year":"1998","journal-title":"Match Commun. Math. Comput. Chem."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TCBB.2016.2628888","article-title":"Enumerating substituted benzene isomers of tree-like chemical graphs","volume":"15","author":"Li","year":"2016","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1021\/ar500432k","article-title":"The chemical space project","volume":"48","author":"Reymond","year":"2015","journal-title":"Accounts Chem. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1016\/j.dam.2012.02.002","article-title":"Inferring a Graph From Path Frequency","volume":"160","author":"Akutsu","year":"2012","journal-title":"Discret. Appl. Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00453-008-9184-0","article-title":"A detachment algorithm for inferring a graph from path frequency","volume":"53","author":"Nagamochi","year":"2009","journal-title":"Algorithmica"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s11047-012-9349-2","article-title":"On computational complexity of graph inference from counting","volume":"12","author":"Fazekas","year":"2013","journal-title":"Nat. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1098-1128(199601)16:1<3::AID-MED1>3.0.CO;2-6","article-title":"The art and practice of structure-based drug design: A molecular modeling perspective","volume":"16","author":"Bohacek","year":"1996","journal-title":"Med. Res. Rev."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1021\/acscentsci.7b00572","article-title":"Automatic chemical design using a data-driven continuous representation of molecules","volume":"4","author":"Wei","year":"2018","journal-title":"ACS Cent. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1021\/acscentsci.7b00512","article-title":"Generating focused molecule libraries for drug discovery with recurrent neural networks","volume":"4","author":"Segler","year":"2017","journal-title":"ACS Cent. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1080\/14686996.2017.1401424","article-title":"ChemTS: An efficient python library for de novo molecular generation","volume":"18","author":"Yang","year":"2017","journal-title":"Sci. Technol. Adv. Mater."},{"key":"ref_16","unstructured":"Kusner, M.J., Paige, B., and Hern\u00e1ndez-Lobato, J.M. (2017, January 6\u201311). Grammar variational autoencoder. Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Akutsu, T., and Nagamochi, H. (2019, January 16\u201319). A Mixed Integer Linear Programming Formulation to Artificial Neural Networks. Proceedings of the 2nd International Conference on Information Science and Systems, Tokyo, Japan.","DOI":"10.1145\/3322645.3322683"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Azam, N.A., Chiewvanichakorn, R., Zhang, F., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020, January 24\u201326). A method for the inverse QSAR\/QSPR based on artificial neural networks and mixed integer linear programming. Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies, Valletta, Malta.","DOI":"10.5220\/0008876800002513"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chiewvanichakorn, R., Wang, C., Zhang, Z., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020, January 19\u201322). A method for the inverse QSAR\/QSPR based on artificial neural networks and mixed integer linear programming. Proceedings of the ICBBB2020, Kyoto, Japan.","DOI":"10.1145\/3386052.3386054"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhu, J., Chiewvanichakorn, R., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020, January 22\u201325). A new integer linear programming formulation to the inverse QSAR\/QSPR for acyclic chemical compounds using skeleton trees. Proceedings of the 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Kitakyushu, Japan.","DOI":"10.1007\/978-3-030-55789-8_38"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Ito, R., Azam, N.A., Wang, C., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020, January 27\u201330). A novel method for the inverse QSAR\/QSPR to monocyclic chemical compounds based on artificial neural networks and integer programming, 2020. Proceedings of the BIOCOMP 2020, Las Vegas, NV, USA.","DOI":"10.5220\/0008876800002513"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1758-2946-6-31","article-title":"Efficient enumeration of monocyclic chemical graphs with given path frequencies","volume":"6","author":"Suzuki","year":"2014","journal-title":"J. Cheminform."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1016\/S0079-6700(02)00009-6","article-title":"Topological polymer chemistry","volume":"27","author":"Tezuka","year":"2002","journal-title":"Prog. Polym. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1177\/026119290503300209","article-title":"Current status of methods for defining the applicability domain of (quantitative) structure-activity relationships: The report and recommendations of ECVAM workshop 52","volume":"33","author":"Netzeva","year":"2005","journal-title":"Altern. Lab. Anim."},{"key":"ref_25","unstructured":"Tamura, Y., Nishiyama, Y., Wang, C., Sun, Y., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020). Enumerating chemical graphs with mono-block 2-augmented tree structure from given upper and lower bounds on path frequencies. arXiv."},{"key":"ref_26","unstructured":"Yamashita, K., Masui, R., Zhou, X., Wang, C., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020). Enumerating chemical graphs with two disjoint cycles satisfying given path frequency specifications. arXiv."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/5\/124\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:29:57Z","timestamp":1760174997000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/5\/124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,18]]},"references-count":26,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2020,5]]}},"alternative-id":["a13050124"],"URL":"https:\/\/doi.org\/10.3390\/a13050124","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,5,18]]}}}