Biomedical subjects

Andreas Teckentrup

Publications and source records attributed to Andreas Teckentrup.

4 recordsLinked to original sources

PubMed2002

Flexsim-R: a virtual affinity fingerprint descriptor to calculate similarities of functional groups.

Methods to describe the similarity of fragments occurring in drug-like molecules are of fundamental importance in computational drug design. In the early phase of lead discovery, they can help to select diverse building blocks for combinatorial compound libraries intended for broad screening. In lead optimization, such methods can guide bioisosteric replacements of one functional group by another or serve as descriptors for QSAR calculations. In this paper, we outline the development of a novel 3D descriptor, termed Flexsim-R, which is a further extension of our virtual affinity fingerprint idea. Descriptors are calculated based on docking of small fragments such as building blocks for combinatorial chemistry or functional groups of drug-like molecules into a reference panel of protein binding sites. The method is validated by examining the neighborhood behavior of the affinity fingerprints and by deriving predictive QSAR models for a couple of literature peptide data sets.

Algorithms↗

PubMedDate not supplied

Mining high-throughput screening data of combinatorial libraries: development of a filter to distinguish hits from nonhits.

Kohonen neural networks generate projections of large data sets defined in high-dimensional space. The resulting self-organizing maps can be used in many applications in the drug discovery process, such as to analyze combinatorial libraries for their similarity or diversity and to select descriptors for structure-activity relationships. The ability to investigate thousands of compounds in parallel also allows one to conduct a study based on single-dose experiments of high-throughput screening campaigns, which are known to have a greater uncertainty than IC50 or Ki values. This is demonstrated here for a data set of 5513 compounds from one combinatorial library. Furthermore, a method was developed that uses self-organizing maps not only as an indicator of structure-activity relationships, but as the basis of a classification system allowing predictive modeling of combinatorial libraries.

Journal Article↗

PubMedDate not supplied

A hierarchical clustering approach for large compound libraries.

A modified version of the k-means clustering algorithm was developed that is able to analyze large compound libraries. A distance threshold determined by plotting the sum of radii of leaf clusters was used as a termination criterion for the clustering process. Hierarchical trees were constructed that can be used to obtain an overview of the data distribution and inherent cluster structure. The approach is also applicable to ligand-based virtual screening with the aim to generate preferred screening collections or focused compound libraries. Retrospective analysis of two activity classes was performed: inhibitors of caspase 1 [interleukin 1 (IL1) cleaving enzyme, ICE] and glucocorticoid receptor ligands. The MDL Drug Data Report (MDDR) and Collection of Bioactive Reference Analogues (COBRA) databases served as the compound pool, for which binary trees were produced. Molecules were encoded by all Molecular Operating Environment 2D descriptors and topological pharmacophore atom types. Individual clusters were assessed for their purity and enrichment of actives belonging to the two ligand classes. Significant enrichment was observed in individual branches of the cluster tree. After clustering a combined database of MDDR, COBRA, and the SPECS catalog, it was possible to retrieve MDDR ICE inhibitors with new scaffolds using COBRA ICE inhibitors as seeds. A Java implementation of the clustering method is available via the Internet (http://www.modlab.de).

Algorithms↗

PubMedDate not supplied

NIPALSTREE: a new hierarchical clustering approach for large compound libraries and its application to virtual screening.

A hierarchical clustering algorithm--NIPALSTREE--was developed that is able to analyze large data sets in high-dimensional space. The result can be displayed as a dendrogram. At each tree level the algorithm projects a data set via principle component analysis onto one dimension. The data set is sorted according to this one dimension and split at the median position. To avoid distortion of clusters at the median position, the algorithm identifies a potentially more suited split point left or right of the median. The procedure is recursively applied on the resulting subsets until the maximal distance between cluster members exceeds a user-defined threshold. The approach was validated in a retrospective screening study for angiotensin converting enzyme (ACE) inhibitors. The resulting clusters were assessed for their purity and enrichment in actives belonging to this ligand class. Enrichment was observed in individual branches of the dendrogram. In further retrospective virtual screening studies employing the MDL Drug Data Report (MDDR), COBRA, and the SPECS catalog, NIPALSTREE was compared with the hierarchical k-means clustering approach. Results show that both algorithms can be used in the context of virtual screening. Intersecting the result lists obtained with both algorithms improved enrichment factors while losing only few chemotypes.

Algorithms↗