Cyclical Conjunction: An Efficient Operator for the Extraction of Cycles from a Graph

The structural characteristics of a molecule, namely size, bond type and number, cycles, shape, and functional groups, will largely determine its physicochemical properties and biological activity. Extraction of data such as the complete structural information of a molecule's ring system is complex (NP-complete) and has traditionally involved high computational cost. The present study proposes a new operator for the extraction of cycles from a graph. Based on an initial cycle set, the operator employs a reduced number of operations in an iterative process of error-free cycle extraction, hence greatly reducing computational cost. Algorithm efficiency has been enhanced by designing new data structures suited to cycle storage, useful not only for interactive solutions but also for applications managing large volumes of information such as descriptor calculation, QSPR/QSAR, matching, clustering, screening, and filtering. Validation was performed by applying the algorithm to a test suite of chemical compounds of varying complexity.

[1]  John Figueras,et al.  Ring Perception Using Breadth-First Search , 1996, J. Chem. Inf. Comput. Sci..

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

[3]  Ashmeed Esack.  A procedure for rapid recognition of the rings of a molecule , 1975 .

[4]  Gerta Rücker,et al.  On Topological Indices, Boiling Points, and Cycloalkanes , 1999, J. Chem. Inf. Comput. Sci..

[5]  Miguel Ángel Gómez-Nieto,et al.  Parallel Algorithms for Graph Cycle Extraction Using the Cyclical Conjunction Operator , 2002, J. Chem. Inf. Comput. Sci..

[6]  Subhash C. Basak,et al.  Topological Indices: Their Nature and Mutual Relatedness , 2000, J. Chem. Inf. Comput. Sci..

[7]  John T. Welch,et al.  A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs , 1966, J. ACM.

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

[9]  Jürgen Bajorath,et al.  Accurate Partitioning of Compounds Belonging to Diverse Activity Classes , 2002, J. Chem. Inf. Comput. Sci..

[10]  A. Balaban,et al.  Topological Indices and Related Descriptors in QSAR and QSPR , 2003 .

[11]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[12]  A. Balaban,et al.  Computer program for finding all possible cycles in graphs , 1985, Journal of computational chemistry.

[13]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[14]  Tomaz Pisanski,et al.  On Numerical Characterization of Cyclicity , 2000, J. Chem. Inf. Comput. Sci..

[15]  Andy de Laet,et al.  Finding drug candidates in virtual and lost/emerging chemistry , 2000 .

[16]  W. T. Wipke,et al.  Techniques for perception by a computer of synthetically significant structural features in complex molecules , 1972 .

[17]  Michael F. Lynch,et al.  Theoretical aspects of ring perception and development of the extended set of smallest rings concept , 1989, J. Chem. Inf. Comput. Sci..

[18]  Johann Gasteiger,et al.  An Algorithm for the Perception of Synthetically Important Rings , 1979, J. Chem. Inf. Comput. Sci..

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

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

[21]  Malcolm Bersohn.  An algorithm for finding the synthetically important rings of a molecule , 1973 .

[22]  Malcolm J. McGregor,et al.  Clustering of Large Databases of Compounds: Using the MDL "Keys" as Structural Descriptors , 1997, J. Chem. Inf. Comput. Sci..

[23]  Milan Randic,et al.  Random walks and their diagnostic value for characterization of atomic environment , 1980 .

[24]  Milan Randic,et al.  On Characterization of Cyclic Structures , 1997, J. Chem. Inf. Comput. Sci..

[25]  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..

[27]  Rucker.  Walk counts, labyrinthicity, and complexity of acyclic and cyclic graphs and molecules , 2000, Journal of chemical information and computer sciences.

[28]  G. Danielson,et al.  On finding the simple paths and circuits in a graph , 1968 .

[29]  Alan H. Lipkus,et al.  Mining a Large Database for Peptidomimetic Ring Structures Using a Topological Index , 1999, J. Chem. Inf. Comput. Sci..

[30]  Jürgen Bajorath,et al.  Combinatorial Preferences Affect Molecular Similarity/Diversity Calculations Using Binary Fingerprints and Tanimoto Coefficients , 2000, J. Chem. Inf. Comput. Sci..

[31]  Leon O. Chua,et al.  On optimally sparse cycle and coboundary basis for a linear graph , 1973 .

[32]  Ernesto Estrada,et al.  Topological Indices Based on the Line Graph of the Molecular Graph , 1996, J. Chem. Inf. Comput. Sci..

[33]  Subhash C. Basak,et al.  Characterization of Isospectral Graphs Using Graph Invariants and Derived Orthogonal Parameters , 1998, J. Chem. Inf. Comput. Sci..

[34]  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..

[35]  Keith Paton,et al.  An algorithm for finding a fundamental set of cycles of a graph , 1969, CACM.

[36]  Darren R. Flower,et al.  On the Properties of Bit String-Based Measures of Chemical Similarity , 1998, J. Chem. Inf. Comput. Sci..

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

[38]  Anton J. Hopfinger,et al.  Prediction of Ligand-Receptor Binding Free Energy by 4D-QSAR Analysis: Application to a Set of Glucose Analogue Inhibitors of Glycogen Phosphorylase , 1999, J. Chem. Inf. Comput. Sci..

[39]  S. Yau,et al.  Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems , 1967, IEEE Transactions on Circuit Theory.

[40]  William L. Jorgensen,et al.  Computer-assisted mechanistic evaluation of organic reactions. 2. Perception of rings, aromaticity, and tautomers , 1981, J. Chem. Inf. Comput. Sci..

[41]  Calvin C. Gotlieb,et al.  Algorithms for finding a fundamental set of cycles for an undirected linear graph , 1967, CACM.

[42]  Patrick W. Fowler,et al.  Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems , 2001, J. Chem. Inf. Comput. Sci..

[43]  Annick Panaye,et al.  Ring perception. A new algorithm for directly finding the smallest set of smallest rings from a connection table , 1993, J. Chem. Inf. Comput. Sci..

[44]  Alan H. Lipkus,et al.  Exploring Chemical Rings in a Simple Topological-Descriptor Space , 2001, J. Chem. Inf. Comput. Sci..

[45]  Norman E. Gibbs,et al.  A Cycle Generation Algorithm for Finite Undirected Linear Graphs , 1969, JACM.

[46]  James C. Tiernan,et al.  An efficient search algorithm to find the elementary circuits of a graph , 1970, CACM.