Open Daniel-Ibarrola opened 3 years ago
The paper describes an algorithm for finding rings in a molecular graph. It is based on the breadth first search algorithm. This algorithm could be used for finding aromatic features in a pharmacophore model.
The paper describes an algorithm for finding rings in a molecular graph. It is based on the breadth first search algorithm. This algorithm could be used for finding aromatic features in a pharmacophore model.