Enumerating Naphthalene Isomers of Tree-like Chemical Graphs

Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu

Abstract

In this paper, we consider the problem of enumerating naphthalene isomers, where enumeration of isomers is important for drug design. A chemical graph G with no other cycles than naphthalene rings is called tree-like, and becomes a tree T possibly with multiple edges if we contract each naphthalene ring into a single virtual atom of valence 8. We call tree T the tree representation of G. There may be more than one tree-like chemical graphs whose tree representations equal to T, which are called naphthalene isomers of T. We present an efficient algorithm that enumerates all naphthalene isomers of a given tree representation. Our algorithm first counts the number of all the naphthalene isomers using dynamic programming, and then for each k, generates the k-th isomer by backtracking the counting computation. In computational experiment, we compare our method with MolGen, a state-of-the-art enumeration tool, and it is observed that our program enumerates the same number of naphthalene isomers within extremely shorter time, which proves that our algorithm is effectively built.

References

  1. Akutsu, T. and Nagamochi, H. (2011). Kernel methods for chemical compounds, from classification to design. In IEICE Transactions on Information and Systems, Vol. E94-D, No. 10, pp. 1846-1853.
  2. Benecke, C., G. R.-H. R. K. A. L. R. and Wieland, T., M. (1995). A generator of connectivity isomers and stereoisomers for molecular structure elucidation. In Analytica Chimica Acta, Vol. 314.
  3. Benecke, C., G. T.-K. A. L. R. and Wieland, T. (1997). Molecular structures generation with molgen, new features and future developments. In Fresenius' Journal of Analytical Chemistry, Vol. 359, No. 1, pp. 23- 32.
  4. Blum, L. C. and Reymond, J. L. (2009). 970 million druglike small molecules for virtual screening in the chemical universe database gdb-13. In J. Am. Chem. Soc., Vol. 131, No. 25, pp. 8732-8733.
  5. Buchanan, B. G., S.-D. H. W. W. G. R. F. E. L. J. and Djerassi, C. (1976). Applications of artificial intelligence for chemical inference. 22, automatic rule formation in mass spectrometry by means of the metadendral program. In J. Am. Chem. Soc., Vol. 98, No. 20, pp. 6168-6178.
  6. Fink, T. and Reymond, J. L. (2007). Virtual exploration of the chemical universe up to 11 atoms of C, N, O, F, assembly of 26.4 million structures (110.9 million stereoisomers) and analysis for new ring systems, stereochemistry, physicochemical and properties, compound classes, and drug discovery. In Journal of Chemical Information and Modeling, Vol. 47, No. 2, pp. 342-353.
  7. Fujiwara, H., W. J.-Z. L. N. H. and Akutsu, T. (2008). Enumerating tree-like chemical graphs with given path frequency. In Journal of Chemical Information and Modeling, Vol. 48, pp. 1345-1357.
  8. Hardinger, S. (2005). Chemistry 14D thinkbook. Hayden McNeil.
  9. He, F. and Nagamochi, H. (2015). A method for generating colorings over graph automorphism. In ISORA 2015, Luoyang, China, pp. 70-81.
  10. Kerber, A., L. R.-G. T. and Meringer, M. (1998). Molgen 4.0, match commun. math. comput. chem. In Vol. 37, pp. 205-208.
  11. Li, J., N. H. and Akutsu, T. (2013). Enumerating benzene isomers of tree-like chemical graphs. In Manuscript submitted to a journal.
  12. Meringer, M. and Schymanski, E. L. (2013). Small molecule identification with molgen and mass spectrometry. In Metabolites, Vol. 3, pp. 440-462.
  13. Nakano, S. and Uno, T. (2005). Generating colored trees. In Lect. Notes Comput. Sci., Vol. 3787, pp. 249-260.
  14. Peironcely, J. E., R.-C. M. F. D. R. T. C. L. F. J.-L. H. T. (2012). Omg: open molecule generator. In Journal of Cheminformatics, Vol. 4, Ariticle 21.
  15. Shimizu, M., N. H. and Akutsu, T. (2011). Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. In BMC Bioinformatics, Vol. 12, Suppl 14, S3.
Download


Paper Citation


in Harvard Style

He F., Hanai A., Nagamochi H. and Akutsu T. (2016). Enumerating Naphthalene Isomers of Tree-like Chemical Graphs . In Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3: BIOINFORMATICS, (BIOSTEC 2016) ISBN 978-989-758-170-0, pages 258-265. DOI: 10.5220/0005783902580265


in Bibtex Style

@conference{bioinformatics16,
author={Fei He and Akiyoshi Hanai and Hiroshi Nagamochi and Tatsuya Akutsu},
title={Enumerating Naphthalene Isomers of Tree-like Chemical Graphs},
booktitle={Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3: BIOINFORMATICS, (BIOSTEC 2016)},
year={2016},
pages={258-265},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005783902580265},
isbn={978-989-758-170-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3: BIOINFORMATICS, (BIOSTEC 2016)
TI - Enumerating Naphthalene Isomers of Tree-like Chemical Graphs
SN - 978-989-758-170-0
AU - He F.
AU - Hanai A.
AU - Nagamochi H.
AU - Akutsu T.
PY - 2016
SP - 258
EP - 265
DO - 10.5220/0005783902580265