Cyclical conjunction: An efficient operator for the extraction of cycles from a graph

Journal of Chemical Information and Computer Sciences

Volumn 42, Issue 6, 2002, Pages 1415-1424

  Cerruela García, Gonzalo ^a   Luque Ruiz, Irene ^a   Gómez Nieto, Miguel Angel ^a  

^a UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PHYSICOCHEMICAL PROPERTIES;

CHEMICAL BONDS; COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL OPERATORS;

MOLECULAR STRUCTURE;

EID: 0036865139     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci020373e     Document Type: Article

References (58)

1. Devillers, J.; Balaban, A.T. Topological Indices and related Descriptors in QSAR and QSPR; Gordon and Breach, Eds.; Amsterdam, The Netherlands, 1999.
2. Gutman, I.; Strada, E. Topological indexes based on the line graph of the molecular graph. J. Chem. Inf. Comput. Sci. 1996, 36(3), 541-543.
3. Cao, C.; Yuan, H. Topological indices Based on Vertex, Distance, and Rings: On the Boiling Points of Paraffins and Cycloalkanes. J. Chem. Inf Comput. Sci. 2001, 41(4), 867-877.
4. Randic, M. On Characterization of Cyclic Structures. J. Chem. Inf. Comput. Sci. 1997, 37, 1063-1071.
5. Lipkus, A.H. Exploring Chemical Rings in a Simple Topological-Descriptor Space. J. Chem. Inf. Comput. Sci. 2001, 41(2), 430-438.
6. Rücker, G.; Rücker, C. Walk Counts, Labyrinthicity, and Complexity of Acyctlic and Cyclic Graphs and Molecules. J. Chem. Inf Comput. Sci. 2000, 40(1), 99-106.
7. Pisanski, T.; Plavsic, D.; Randic, M. On Numerical Characterization of Cyclicity. J. Chem. Inf. Comput. Sci. 2000, 40, 520-523.
8. Chua, L.O.; Chen, L.K. On optimally sparce cycle and coboundary basis for a linear graph. IEEE Trans. Circuit Theory 1973, 20, 495-503.
9. Knuth, D.E. The Art of Computer Programing, 1; Addison-Wesley: 1968; pp 363-370.
10. Corey, E.J.; Petersson, G.A. An algorithm for machine perception of synthetically significant rings in complex cyclic organic structures. J. Am. Chem. Soc. 1972, 94, 460-465.
11. Mateti, P.; Deo, N. On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 1976, 5, 90-99.
12. Randic, M. Random walks and their diagnostic value for characterization of atomic environment, J. Comput. Chem. 1980, 1(4), 386-399.
13. Downs G.M.; Gillet V.J.; Holliday J.D.; Lynch, M.F. Theoretical aspects of ring perception and development of the extended set of smallest rings concept. American Chemical Society 1988, 29(3), 187-206.
14. Balasubramanian, K.; Subhash, B. Characterization of isospectral graphs using graph invariants and derived orthogonal parameters. J. Chem. Inf Comput. Sci. 1998, 38(3), 367-373.
15. Basak, S.; Balaban, T.; Grunwald, G.; Brian, D. Topological indices: Their nature and mutual relatedness. American Chemical Society 2000, 40(4), 891-1150.
16. Plotkin, M. Mathematical basis of ring-finding algorithms in CIDS. J. Chem. Doc. 1970, 11(1), 60-63.
17. Bersohn, M. An algorithm for finding the synthetically important rings of a molecule. Theory Graphs, American Mathematical Society Colloquium Publications 1973, 38, 1239-1241.
18. Esack, A.A procedure for rapid recognition of the rings of a molecule. J. Chem Soc. 1975, 1.
19. Schmidt, B.; Fleischhauer, J.A. Fortran iv program for finding the SSSR of a graph. J. Chem. Inf Comput. Sci. 1984, 18.
20. Zamora, A. An algorithm for finding the smallest set of smallest rings. J. Chem. Inf. Comput. Sci. 1976, 16(1), 40-43.
21. Roos-Kozel, B.L.; Jorgensen, W.L. Computer-assisted mechanistic evaluation of organic reactions. 2. perception of rings, aromaticity, and tautomers. American Chemical Society 1981, 21(2), 101-111.
22. Gasteiger, J.; Jochum, C. An algorithm for the perception of synthetically important rings. J. Chem. Inf. Comput. Sci. 1979, 19(1), 43-48.
23. Fan, T.F.; Doucet, J.; Barbu, A. Ring perception, a new algorithm for directly finding the smallest rings from a connection table. J. Chem. Inf. Comput. Sci. 1993, 33, 657-662.
24. Figueras, J. Ring perception using breadth-first search, J. Chem. Inf. Comput. Sci. 1996, 36, 986-991.
25. Shindaku Fujita, A new algorithm for selection of synthetically important rings, J. Chem Inf. Comput. Sci. 1988, 28, 22-26.
26. Welch, J.T.; A mechanical analysis of the cyclic structure of undirected linear graphs, J. ACM 1966, 13(2), 205-210.
27. Gotlieb, C.C.; Corneil, D.G. Algorithms for finding a fundamental set of cycles for an undirected linear graph. Commun. ACM 1967, 10(12), 780-783.
28. Gibbs, E.A cyclic generation algorithm for finite undirected linear graphs, J. Assoc. Comput. Machinery 1969, 16(4), 564-568.
29. Paten, K. An algorithm for finding a fundamental set of cycles of a graph. Commun. ACM 1969, 12(9), 514-518.
30. Wipke, W.; Dyott, M. Use of ring assemblies in a ring perception algorithm. J. Chem. Inf. Comput. Sci. 1975, 15(3), 140-147.
31. Sorkau, Ringerkennung in chemischen strukturen mit dem computer. Wiss. Z. Technol. Hochsch. Leuna-Meuseburg 1985, 27.
32. Tiernan, J. An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 1970, 13, 722-726.
33. Von Beiss, G.; Jänicke, W.; Meisller, H.G. Ein Algorithmus zur bestimmung aller elementarkreise eines gerichteten graphen. Wiss. Z. Hachsch Leuma-Mersebug. 1971, 19, 103-111.
34. Danielson, G.H. On finding the simple paths and circuit in a graph. IEEE Trans. Circuit Theory 1968, 15, 294-295.
35. Yau, S.S. Generation of all Hamiltonian circuits, catchs, and centers of a graph, and related problems. IEEE Trans. Circuit Theory 1967, 14, 79-81.
36. Mateti, P.; Deo, N. On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 1976, 5, 90-99.
37. Tarjan, R.E. Enumeration of the elementary circuits of a directed grap. SIAM J. Comput. 1973, 2, 211-216.
38. Bertziss, A.T.; Data Structures: Theory and Practice; Academic Press: New York, 1971.
39. Corey, E.J.; Wipke, W.T.; Cramer, R.D.; Howe, W.J. Techniques for perception by a computer of synthetically significant structural features in complex molecules, J. Am. Chem. Soc. 1972, 94, 431-439.
40. Balaban, A.; Filip, P.; Balaban, T. Computer program for finding all possible cycles in graphs, J. Comput. Chem. 1985, 6(4), 316-329.
41. Hanser, T.; Jauffret, P.; Kaufmann, G. A new algorithm for exhaustive ring perception in a molecular graph. J. Chem. Inf. Comput, Sci. 1996, 36, 1146-1152.
42. Cerruela García, G.; Luque Ruiz, I.; Gómez-Nieto, M.A. Un algoritmo en zigzag para la obtención de on conjunto de ciclos característicos de un grafo; Internal Report UCO-ISCBD-JCVG93-00; University of Córdoba: 2000.
43. de Laet, A. SPECS and BioSPECS B.V., Fleminglaan, 16 NL-2289 CP Rijswijk, The Netherlands. http://www.specs.net.
44. Deza, M.; Fowler, P.W.; Grishukhim, V. Allowed boundary sequences for fused polycyclic and related algorithm problems. J. Chem. Inf. Comput. Sci. 2001, 41(2), 300-308.
45. Hansch, C.; Leo, A. Exploring QSAR. Fundamentals and Applications in Chemistry and Biology; ACS Professional Reference Book; American Chemical Society: Washington, DC, 1995.
46. MACCS Keys; MDL Information Systems, Inc.: 14600 Catalina Street, San Leandro, CA 94577.
47. Rücker, G.; Rücker, C. Topogical Indices, Boiling Points and Cycloalkanes. J. Chem. Inf. Comput. Sci. 1999, 39, 788-802.
48. Ravi, M.; Hopfinger, A.J.; Hormann, R.E.; Dinan, L. 4D-QSAR Analysis of a set of ecdysteroids and a comparison to CoMFA modeling. J. Chem. Inf Comput. Sci. 2001, 41(6), 1587-1604.
49. Venkatarangan, M.P.; Hopfinger, A.J. Prediction of ligand-receptor binding free energy by 4d-QSAR analysis: Application to a ser of glucose analogue inhibiyors of glycogen phosphorylase. J. Chem. Inf. Comput. Sci. 1999, 39(6), 1141-1150.
50. McGregor, M.J.; Pallai, P.V. Clustering of large databases of compounds: using MDL keys as structural descriptors. J. Chem. Inf. Comput. Sci. 1997, 37, 443-448.
51. Xue, L.; Bajorath, J. Accurate partitioning of compounds belonging to diverse activity classes. J. Chem. Inf. Comput. Sci. 2002, 42(3), 757-764.
52. Dury, L.; Latour, T.; Leherte, L.; Barberis, F.; Vercauteren, D.A new graph descriptor for molecules containing cycles. Application as screening criterion for searching molecular structures within large databases of organic compounds. J. Chem. Inf. Comput. Sci. 2001, 41(6), 1437-1445.
53. de Laet, A.; Hehenkamp, J.J.; Wife, R.L. Finding drug candidates in virtual and lost/emerging chemistry. J. Heterocycl. Chem. 2000, 37, 669-674.
54. Lipkus, A.H. Mining a Large database fro Peptidomimetic Ring Structures Using Topological Index. J. Chem. Inf. Comput. Sci. 1999, 39(3), 582-586.
55. Lipkus, A.H. Exploring chemical rings in a simple topological-descriptor space. J. Chem. Inf. Comput. Sci. 2001, 41(2), 430-438.
56. Flower, D.R. On the properties of bit string-based measures of chemical similarity. J. Chem. Inf. Comput. Sci. 1998, 38, 379-386.
57. Godden, J.; Xae, L.; Bajorath, J. Combinatorial preferences affect molecular similarity/diversity calculations using binary fingerprints and Tanimoto coefficients. J. Chem. Inf. Comput. Sci. 2000, 40, 163-166.
58. Cerruela García, G.; Luque Ruiz, I.; Gómez-Nieto, M.A. Parallel algorithms for graph cycle extraction using the cyclical conjunction operator (accepted for publication to J. Chem. Inf. Comput. Sci.).