1996
DOI: 10.1021/ci960013p
|View full text |Cite
|
Sign up to set email alerts
|

Ring Perception Using Breadth-First Search

Abstract: Combining breadth-first search with new ideas for uncovering embedded rings in complex systems yields a very fast routine for ring perception. With large structures, the new routine is orders of magnitude faster than depth-first ring detection, a result expected on the basis of recent work that establishes polynomial order for BFS.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0

Year Published

1998
1998
2009
2009

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(51 citation statements)
references
References 9 publications
0
51
0
Order By: Relevance
“…John Figueras' fast algorithm for finding the Smallest Set of Smallest Rings (SSSR) has been implemented and is used for example by the structure diagram generation package. 37 Especially large condensed ring systems, for which the process of coordinate generation could take up to a minute due to a slow depth first ring perception algorithm in older systems, 38 can now be layed out within fractions of a second as shown in Figure 4. Further this package contains a class for partioning a given ring systems into AtomContainers, one for each ring.…”
Section: D Structure Graphicalmentioning
confidence: 99%
“…John Figueras' fast algorithm for finding the Smallest Set of Smallest Rings (SSSR) has been implemented and is used for example by the structure diagram generation package. 37 Especially large condensed ring systems, for which the process of coordinate generation could take up to a minute due to a slow depth first ring perception algorithm in older systems, 38 can now be layed out within fractions of a second as shown in Figure 4. Further this package contains a class for partioning a given ring systems into AtomContainers, one for each ring.…”
Section: D Structure Graphicalmentioning
confidence: 99%
“…The set of the minimum number of cycles in the compound is calculated using an algorithm [41] and stored in the LIST. 2.…”
Section: Structure Diagram Generation Of Polycyclic Compoundsmentioning
confidence: 99%
“…Figueras' algorithm [20] for computing an SSSR has been celebrated as significant advance because of its computational speed. It is implemented e.g.…”
Section: Sssr: Smallest Set Of Smallest Ringsmentioning
confidence: 99%
“…Figueras' method, however, may fail also for simple planar graphs: (i) In the first step of the algorithm the set of vertices of degree two (the N2 nodes in [20]) is investigated. For each vertex of this type, the algorithm generates a shortest cycle (note that this cycle need not be unique) and adds it to a cycle set.…”
Section: Sssr: Smallest Set Of Smallest Ringsmentioning
confidence: 99%