# Difference between revisions of "Ring detection"

From Open Babel

(Use article link-out) |
(Splitted Lynch et al.) |
||

Line 1: | Line 1: | ||

− | Extensive reviews about ring detection algorithms can be found in the work of Lynch et al. ([[Article: | + | Extensive reviews about ring detection algorithms can be found in the work of Lynch et al. ([[Article:dghl89a]],[[Article:dghl89b]]), Gleiss ([[PhdThesis:gle01]]), and Downs ([[Article:dow03]]). |

One of the most often used ring sets in Cheminformatics application is the Smallest Set of Smallest Rings (SSSR) ([[Article:fig96]]). This algorithms is a combination of the breadth first search (BFS) of Balducci ([[Article:bp94]]) and the node elimination procedure of Doucet ([[Article:fpdb93]]). | One of the most often used ring sets in Cheminformatics application is the Smallest Set of Smallest Rings (SSSR) ([[Article:fig96]]). This algorithms is a combination of the breadth first search (BFS) of Balducci ([[Article:bp94]]) and the node elimination procedure of Doucet ([[Article:fpdb93]]). |

## Latest revision as of 11:47, 4 March 2006

Extensive reviews about ring detection algorithms can be found in the work of Lynch et al. (Article:dghl89a,Article:dghl89b), Gleiss (PhdThesis:gle01), and Downs (Article:dow03).

One of the most often used ring sets in Cheminformatics application is the Smallest Set of Smallest Rings (SSSR) (Article:fig96). This algorithms is a combination of the breadth first search (BFS) of Balducci (Article:bp94) and the node elimination procedure of Doucet (Article:fpdb93).