Enhanced algorithm for finding the smallest set of smallest rings

The search algorithm for the smallest set of smallest rings (SSSR) has long been an important basic algorithm for processing chemical information. This paper describes the merits and limitations of one of the SSSR search algorithms used at Chemical Abstracts Service (CAS), provides the mathematical basis for the general approach, presents enhancements to this algorithm, and includes a new, more rigorous approach that extends the scope of the original algorithm while reducing its limitations