{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T07:32:54Z","timestamp":1690961574228},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"crossref","award":["200021-175944"],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Swiss Federal Institute of Technology Zurich"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"abstract":"Abstract<\/jats:title>This article documents enu<\/jats:italic>, a freely-downloadable, open-source and stand-alone program written in C++ for the enumeration of the constitutional isomers and stereoisomers of a molecular formula. The program relies on graph theory to enumerate all the constitutional isomers of a given formula on the basis of their canonical adjacency matrix. The stereoisomers of a given constitutional isomer are enumerated as well, on the basis of the automorphism group of this matrix. The isomer list is then reported in the form of canonical SMILES strings within files in XML format. The specification of the molecule family of interest is very flexible and the code is optimized for computational efficiency. The algorithms and implementations underlying enu<\/jats:italic> are described, and simple illustrative applications are presented. The enu<\/jats:italic> code is freely available on GitHub at https:\/\/github.com\/csms-ethz\/CombiFF<\/jats:ext-link>.<\/jats:p>","DOI":"10.1186\/s13321-022-00677-6","type":"journal-article","created":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T05:02:26Z","timestamp":1674363746000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Development of an open-source software for isomer enumeration"],"prefix":"10.1186","volume":"15","author":[{"given":"Salom\u00e9 R.","family":"Rieder","sequence":"first","affiliation":[]},{"given":"Marina P.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Sereina","family":"Riniker","sequence":"additional","affiliation":[]},{"given":"Philippe H.","family":"H\u00fcnenberger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,22]]},"reference":[{"key":"677_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1201\/9781420082999-c8","volume-title":"Handbook of chemoinformatics algorithms","author":"M Meringer","year":"2010","unstructured":"Meringer M (2010) Structure enumeration and sampling (Chap 8). In: Faulon J-L, Bender A (eds) Handbook of chemoinformatics algorithms. Chapman & Hall\/CRC, London, pp 233\u2013267"},{"key":"677_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1039\/9781847553324-00056","volume-title":"Chemical modelling: applications and theory","author":"DJ Klein","year":"2002","unstructured":"Klein DJ, Babi\u0107 D, Trinajsti\u0107 N (2002) Enumeration in chemistry (Chap 2). In: Hinchliffe A (ed) Chemical modelling: Applications and theory, vol 2. The Royal Society of Chemistry, Cambridge, pp 56\u201395"},{"key":"677_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02546665","volume":"68","author":"G P\u00f3lya","year":"1937","unstructured":"P\u00f3lya G (1937) Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen. Acta Mathematica 68:145\u2013254","journal-title":"Acta Mathematica"},{"key":"677_CR4","volume-title":"Applications of artificial intelligence for organic chemistry. The DENDRAL Project.","author":"RK Lindsay","year":"1980","unstructured":"Lindsay RK, Buchanan BG, Feigenbaum EA, Lederberg J (1980) Applications of artificial intelligence for organic chemistry. The DENDRAL Project. McGraw-Hill Companies Inc, New York"},{"key":"677_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/0471720895.ch3","volume":"21","author":"J-L Faulon","year":"2005","unstructured":"Faulon J-L, Visco DP, Roe D (2005) Enumerating molecules. Rev Comput Chem 21:209\u2013286","journal-title":"Rev Comput Chem"},{"key":"677_CR6","volume-title":"An algorithm for the construction of the graphs of organic molecules","author":"H Brown","year":"1973","unstructured":"Brown H, Masinter L (1973) An algorithm for the construction of the graphs of organic molecules. Stanford University, Stanford"},{"key":"677_CR7","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1021\/ci700156f","volume":"47","author":"AA Melnikov","year":"2007","unstructured":"Melnikov AA, Palyulin VA, Zefirov NS (2007) Generation of molecular graphs for QSAR studies: An approach based on supergraphs. J Chem Inf Model 47:2077\u20132088","journal-title":"J Chem Inf Model"},{"key":"677_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1021\/ci950393z","volume":"36","author":"MS Molchanova","year":"1996","unstructured":"Molchanova MS, Shcherbukhin VV, Zefirov NS (1996) Computer generation of molecular structures by the SMOG program. J Chem Inf Comput Sci 36:888\u2013899","journal-title":"J Chem Inf Comput Sci"},{"key":"677_CR9","unstructured":"Grund R (1994) Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und \u00fcberlappungsfreien Fragmenten. PhD thesis, Lehrstuhl II f\u00fcr Mathematik der Universit\u00e4t Bayreuth . [cito:extends] [cito:usesMethodIn]"},{"key":"677_CR10","first-page":"113","volume-title":"Advances in mathematical chemistry and applications","author":"R Gugisch","year":"2015","unstructured":"Gugisch R, Kerber A, Kohnert A, Laue R, Meringer M, R\u00fccker C, Wassermann A (2015) MOLGEN 5.0, a molecular structure generator (Chap 6). In: Basak SC, Restrepo G, Villaveces JL (eds) Advances in mathematical chemistry and applications, vol 1, Revised. Bentham Science Publishers, Sharjah, pp 113\u2013138","edition":"Revised"},{"key":"677_CR11","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1021\/ci300415d","volume":"52","author":"L Ruddigkeit","year":"2012","unstructured":"Ruddigkeit L, van Deursen R, Blum LC, Reymond J-L (2012) Enumeration of 166 billion organic small molecules in the chemical universe database GDB-17. J Chem Inf Model 52:2864\u20132875","journal-title":"J Chem Inf Model"},{"key":"677_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-021-00529-9","volume":"13","author":"MA Yirik","year":"2021","unstructured":"Yirik MA, Sorokina M, Steinbeck C (2021) MAYGEN: An open-source chemical structure generator for constitutional isomers based on the orderly generation principle. J Cheminform 13:1\u201314","journal-title":"J Cheminform"},{"key":"677_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-022-00604-9","volume":"14","author":"BD McKay","year":"2022","unstructured":"McKay BD, Yirik MA, Steinbeck C (2022) Surge: A fast open-source chemical graph generator. J Cheminform 14:1\u20139","journal-title":"J Cheminform"},{"key":"677_CR14","doi-asserted-by":"publisher","first-page":"1008504","DOI":"10.1371\/journal.pcbi.1008504","volume":"17","author":"MA Yirik","year":"2021","unstructured":"Yirik MA, Steinbeck C (2021) Chemical graph generators. PLoS Comput Biol 17:1008504","journal-title":"PLoS Comput Biol"},{"key":"677_CR15","doi-asserted-by":"crossref","unstructured":"Oliveira MP, Andrey M, Rieder SR, Kern L, Hahn DF, Riniker S, Horta BA, H\u00fcnenberger PH (2020) Systematic optimization of a fragment-based force field against experimental pure-liquid properties considering large compound families: Application to saturated haloalkanes. J Chem Theory 16: 7525\u20137555 . [cito:providesMethodFor] [cito:sharesAuthorWith]","DOI":"10.1021\/acs.jctc.0c00683"},{"key":"677_CR16","doi-asserted-by":"crossref","unstructured":"Oliveira MP, H\u00fcnenberger PH (2021) Systematic optimization of a fragment-based force field against experimental pure-liquid properties considering large compound families: application to oxygen and nitrogen compounds. Phys Chem Chem Phys 23: 17774\u201317793 . [cito:providesMethodFor] [cito:sharesAuthorWith]","DOI":"10.1039\/D1CP02001C"},{"key":"677_CR17","unstructured":"Daylight Chemical Information Systems\u2014SMILES. Accessed: 23.04.2020. https:\/\/www.daylight.com\/dayhtml\/doc\/theory\/theory.smiles.html"},{"key":"677_CR18","unstructured":"MOLGEN. Accessed: 04.06.2022. https:\/\/www.molgen.de\/"},{"key":"677_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1021\/ci00057a005","volume":"28","author":"D Weininger","year":"1988","unstructured":"Weininger D (1988) SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules. J Chem Inf Comput Sci 28:31\u201336","journal-title":"J Chem Inf Comput Sci"},{"key":"677_CR20","doi-asserted-by":"crossref","unstructured":"Weininger D, Weininger A, Weininger JL (1989) SMILES. 2. Algorithm for generation of unique SMILES notation. J Chem Inf Comput Sci 29: 97\u2013101 . [cito:usesMethodIn]","DOI":"10.1021\/ci00062a008"},{"key":"677_CR21","doi-asserted-by":"crossref","unstructured":"Schneider N, Sayle RA, Landrum GA (2015) Get your atoms in order. An open-source implementation of a novel and robust molecular canonicalization algorithm. J Chem Inf Model 55: 2111\u20132120 . [cito:usesMethodIn]","DOI":"10.1021\/acs.jcim.5b00543"},{"key":"677_CR22","volume-title":"Graph theory, 1736\u20131936","author":"NL Biggs","year":"1998","unstructured":"Biggs NL, Lloyd EK, Wilson RJ (1998) Graph theory, 1736\u20131936. Oxford University Press, Oxford"},{"key":"677_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0933-1","volume-title":"Graph theory applications","author":"LR Foulds","year":"1992","unstructured":"Foulds LR (1992) Graph theory applications. Springer, New York"},{"key":"677_CR24","unstructured":"Mcnaught AD, Wilkinson A (1997) IUPAC. Compendium of chemical terminology. In: Gold Book. 2nd edn. Blackwell Scientific Publications, Oxford, p. 951."},{"key":"677_CR25","doi-asserted-by":"crossref","unstructured":"Read RC (1978) Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. In: Alspach B, Hell P, Miller DJ (eds) Annals of discrete mathematics. vol. 2, pp. 107\u2013120","DOI":"10.1016\/S0167-5060(08)70325-X"},{"key":"677_CR26","unstructured":"Faradzhev IA (1978) Generation of nonisomorphic graphs with a given degree sequence. Algorithmic Studies in Combinatorics, 11\u201319"},{"key":"677_CR27","unstructured":"Faradzhev IA (1978) Constructive enumeration of combinatorial objects. probl\u00e8mes combinatoires et th\u00e9orie des graphes. In: Colloq. Internat. CNRS, University of Orsay, Orsay, vol. 260, pp. 131\u2013135"},{"key":"677_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-8274-2804-2","volume-title":"Algorithmen und Datenstrukturen","author":"T Ottmann","year":"2012","unstructured":"Ottmann T, Widmayer P (2012) Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, Heidelberg"},{"key":"677_CR29","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1021\/c160017a018","volume":"5","author":"HL Morgan","year":"1965","unstructured":"Morgan HL (1965) The generation of a unique machine description for chemical structures. A technique developed at chemical abstracts service. J Chem Doc 5:107\u2013113","journal-title":"J Chem Doc"},{"key":"677_CR30","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1021\/ci0341823","volume":"44","author":"J-L Faulon","year":"2004","unstructured":"Faulon J-L, Collins MJ, Carr RD (2004) The signature molecular descriptor. 4. Canonizing molecules using valence sequences. J Chem Inf Comput Sci 44:427\u2013436","journal-title":"J Chem Inf Comput Sci"},{"key":"677_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-4-22","volume":"4","author":"NM O\u2019Boyle","year":"2012","unstructured":"O\u2019Boyle NM (2012) Towards a universal SMILES representation\u2014a standard method to generate canonical SMILES based on the InChI. J Cheminform 4:1\u201314","journal-title":"J Cheminform"},{"key":"677_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-020-00453-4","volume":"12","author":"DG Krotko","year":"2020","unstructured":"Krotko DG (2020) Atomic ring invariant and modified CANON extended connectivity algorithm for symmetry perception in molecular graphs and rigorous canonicalization of SMILES. J Cheminform 12:1\u201311","journal-title":"J Cheminform"},{"key":"677_CR33","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1021\/ci00016a003","volume":"33","author":"M Razinger","year":"1993","unstructured":"Razinger M, Balasubramanian K, Perdih M, Munk ME (1993) Stereoisomer generation in computer-enhanced structure elucidation. J Chem Inf Comput Sci 33:812\u2013825","journal-title":"J Chem Inf Comput Sci"},{"key":"677_CR34","unstructured":"Landrum G, Tosco P, Kelley B, Riniker S, Ric gedeck Vianello R, Schneider N, Dalke A, N D, Cole B, Swain M, Turk S, Cosgrove D, Savelyev A, Vaucher A, W\u00f3jcikowski M, Jones G, Probst D, Scalfani VF, Godin G, Pahl A, Berenger F, Varjo JL (2021) strets123, JP, DoliathGavid, Sforna, G., Jensen, J.H.: rdkit\/rdkit: 2020_09_5 (q3 2020) release . [cito:usesMethodIn] [cito:sharesAuthorWith]"},{"key":"677_CR35","doi-asserted-by":"publisher","unstructured":"van Rossum G, Drake FL (2009) Python 3 Reference Manual. Create Space, Scotts Valley, CA . https:\/\/doi.org\/10.5555\/1593511","DOI":"10.5555\/1593511"},{"key":"677_CR36","unstructured":"Maupin P (2017) pdfrw. Accessed: 6.9.2022 [cito:usesMethodIn] . https:\/\/github.com\/pmaupin\/pdfrw"},{"key":"677_CR37","doi-asserted-by":"crossref","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23: 31\u201342 . [cito:usesMethodIn]","DOI":"10.1145\/321921.321925"},{"key":"677_CR38","doi-asserted-by":"crossref","unstructured":"Ehrlich HC, Rarey M (2012) Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2. J Cheminform 4: 13\u201311317 . [cito:usesMethodIn]","DOI":"10.1186\/1758-2946-4-13"},{"key":"677_CR39","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26:1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"677_CR40","unstructured":"ETH Z\u00fcrich Euler VII Cluster. https:\/\/scicomp.ethz.ch\/wiki\/Euler#Euler_VII_.E2.80.94_phase_2. Accessed: 13.09.2022"},{"key":"677_CR41","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay BD, Piperno A (2014) Practical graph isomorphism. II. J Symb Comput 60:94\u2013112","journal-title":"J Symb Comput"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-022-00677-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13321-022-00677-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-022-00677-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T05:02:50Z","timestamp":1674363770000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/s13321-022-00677-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,22]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["677"],"URL":"https:\/\/doi.org\/10.1186\/s13321-022-00677-6","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,22]]},"assertion":[{"value":"17 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This declaration is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"10"}}