Rings Perception

In this section only three of the various ring perception algorithms are introduced. The initial approaches are  

---

Ring perception and equivalence of atoms and bonds are also very important tasks in for processing chemical compounds. 

Ring strain energies30) and aromatic delocalization energies must also be parameterized and calculated. This is handled automatically in EROS and makes use of the ring perception routine mentioned earlier15). 

R. Balducci, R. S. Pearlman. Efficient exact solution of the ring perception problem. /. Chem. Inf. Comput. Sci., 34, 822-831, 1994. 

B.T. Fan, A. Panaye, J.P. Doucet, A. Barbu. Ring perception. A new algorithm for directly finding the smallest set of smallest rings from a connection table. 

Hanser, T, Jauffret, P. and Kaufmann, G. (19%). A New Algorithm for Exhaustive Ring Perception in a Molecular Graph. J.Chem.Inf.ComputScL, 36,1146-1152. 

Downs, G.M. (2003) Ring perception, in Handbook of Chemoinformatics, Vol. 1 (ed. J. Gasteiger), WUey-VCH Verlag GmbH, Weinheim, Germany, pp. 161-177. 

The review of existing ring perception algorithms under the following seven categories showed the following characteristics ... 

The ring system identification currently implemented in AUTONOM is a two-step process initiated by the ring system perception. The reliability of the ring perception routine is the crux of the naming algorithm. 

Ring perception is one of those background tasks mainly of interest to programmers and system designers. Users rarely give the matter a second thought, until unexpected results or annoying limitations are revealed. 

Ring perception is a routine task, a utihty to provide a description of cyclic pa of a structure in such a way as to complement other topologicad anadyses, such fragmentation, functional group detection, and topological indices. 

Ring perception is thus an important component in a wide range of applicatu requiring structurad analysis. The task is to perceive the most appropriate set rings for the particular appUcation in an efficient and consistent manner. For t it is necessary first to classify rings in some way so that comparisons a appropriate selections can be made. 

An extensive review of ring perception algorithms has been pubhshed. This section summarises a few points that make life easier when implementing an algorithm to find a particular ring set, and outlines some of the more general issues. 

In conclusion it can be stated simply that no ring set solves all the issues and problems mentioned in this paper for some it is just the start of further problems However, the ability to differentiate ring types based on the classification outlined here will enable implementors of ring perception routines to categorise and choose a particular desired set of rings, and assess the consequences and potential inconsistencies associated with that choice. With reference to the introduction a start has been made to the necessary developments in language and graph theory. 

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 (ESSR) concept . J. Chem. Inf. Comput. Sci. 1989,29, 187-206. 

---