Unique Ring Families: A Chemically Meaningful Description of Molecular Ring Topologies

The perception of a set of rings forms the basis for a number of chemoinformatics applications, e.g. the systematic naming of compounds, the calculation of molecular descriptors, the matching of SMARTS expressions, and the generation of atomic coordinates. We introduce the concept of unique ring families (URFs) as an extension of the concept of relevant cycles (RCs). URFs are consistent for different atom orders and represent an intuitive description of the rings of a molecular graph. Furthermore, in contrast to RCs, URFs are polynomial in number. We provide an algorithm to efficiently calculate URFs in polynomial time and demonstrate their suitability for real-time applications by providing computing time benchmarks for the PubChem Database. URFs combine three important properties of chemical ring descriptions, for the first time, namely being unique, chemically meaningful, and efficient to compute. Therefore, URFs are a valuable alternative to the commonly used concept of the smallest set of smallest rings (SSSR) and would be suited to become the standard measure for ring topologies of small molecules.

[1]  W. Todd Wipke,et al.  Use of Ring Assemblies in Ring Perception Algorithm , 1975, J. Chem. Inf. Comput. Sci..

[2]  Shinsaku Fujita,et al.  A new algorithm for selection of synthetically important rings. The essential set of essential rings for organic structures , 1988, J. Chem. Inf. Comput. Sci..

[3]  E. J. Corey,et al.  Algorithm for machine perception of synthetically significant rings in complex cyclic organic structures , 1972 .

[4]  Morris Plotkin,et al.  Mathematical Basis of Ring-Finding Algorithms in CIDS , 1971 .

[5]  Yanli Wang,et al.  PubChem: a public information system for analyzing bioactivities of small molecules , 2009, Nucleic Acids Res..

[6]  Antonio Zamora,et al.  An Algorithm for Finding the Smallest Set of Smallest Rings , 1976, J. Chem. Inf. Comput. Sci..

[7]  David G. Lloyd,et al.  Permuting input for more effective sampling of 3D conformer space , 2006, J. Comput. Aided Mol. Des..

[8]  Franziska Berger,et al.  Counterexamples in Chemical Ring Perception , 2004, J. Chem. Inf. Model..

[9]  Philippe Vismara,et al.  Union of all the Minimum Cycle Bases of a Graph , 1997, Electron. J. Comb..

[10]  Thierry Hanser,et al.  A New Algorithm for Exhaustive Ring Perception in a Molecular Graph , 1996, J. Chem. Inf. Comput. Sci..

[11]  Peter F. Stadler,et al.  Interchangeability of Relevant Cycles in Graphs , 2000, Electron. J. Comb..

[12]  Raphael Yuster,et al.  Packing Graphs: The packing problem solved , 1996, Electron. J. Comb..

[13]  José A. Dobado Jimez,et al.  CoNTub v2.0 - Algorithms for Constructing C3-Symmetric Models of Three-Nanotube Junctions , 2011, J. Chem. Inf. Model..

[14]  Renzo Balducci,et al.  Efficient exact solution of the ring perception problem , 1994, J. Chem. Inf. Comput. Sci..

[15]  Matthias Rarey,et al.  NAOMI: On the Almost Trivial Task of Reading Molecules from Different File formats , 2011, J. Chem. Inf. Model..

[16]  Michael F. Lynch,et al.  Theoretical Aspects of Ring Perception and Development of the Extended Set of Smallest Rings Concept. , 1989 .

[17]  Thibaud Latour,et al.  A New Graph Descriptor for Molecules Containing Cycles. Application as Screening Criterion for Searching Molecular Structures within Large Databases of Organic Compounds , 2001, J. Chem. Inf. Comput. Sci..

[18]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..