2000
DOI: 10.1021/ci990121m
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Algorithms To Enumerate Isomers and Diamutamers with More Than One Type of Substituent

Abstract: In this paper we describe numeric as well as symbolic algorithms for the enumeration of substitutional isomers with an unlimited number of different achiral substituents. We consider three different scenarios: first, the enumeration of diamutamers with a given set of ligand types and ligand multiplicity, second, the enumeration of diamutamer libraries with a given ligand assortment pattern, and, third, the enumerations of libraries with diamutamers exhibiting a limited number of ligands.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2000
2000
2008
2008

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…The complete number N of enumerated molecules can be expressed as: where L is the number of linker fragments, F is the number of functional groups, and S is the number of substitution points marked on the scaffold. The complete enumeration with a core structure showing a local symmetry in substitution points gives a lower number of unique structures according to the Pólya counting theory . The complete enumeration method is implemented in SLF_LibMaker, a C++ program based on OpenEye's OEChem 1.3 library .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The complete number N of enumerated molecules can be expressed as: where L is the number of linker fragments, F is the number of functional groups, and S is the number of substitution points marked on the scaffold. The complete enumeration with a core structure showing a local symmetry in substitution points gives a lower number of unique structures according to the Pólya counting theory . The complete enumeration method is implemented in SLF_LibMaker, a C++ program based on OpenEye's OEChem 1.3 library .…”
Section: Methodsmentioning
confidence: 99%
“…The complete enumeration with a core structure showing a local symmetry in substitution points gives a lower number of unique structures according to the Po ´lya counting theory. 28 The complete enumeration method is implemented in SLF_LibMaker, a C++ program based on OpenEye's OEChem 1.3 library. 29 The molecular fragments (scaffolds, linkers, functional groups) are encoded as SMILES 30 or SDF 31,32 file formats with connecting pseudo-atoms represented by "*" in both formats.…”
Section: Methodsmentioning
confidence: 99%
“…van Almsick et al developed an algorithm to enumerate isomers and diamutamers (same central skeleton but different arrangements of ligands) and wrote an implementation. They used the Cauchy–Frobenius lemma and Pólya polynomials 298, 299.…”
Section: Chemical Graph Theorymentioning
confidence: 99%
“…Firstly, the use of the over all numbers (or coefficients of the generating functions) corresponding to one supergroup often makes it possible to simplify the calculations. The alternative procedures for counting the total number of completely asymmetric (C 1 ) prismane derivatives may serve as examples, see Eqs (20), (21), and (22). representation in Fig.…”
Section: Final Calculationsmentioning
confidence: 99%