Data structures for computational compound promiscuity analysis and exemplary applications to inhibitors of the human kinome

2019 ◽  
Vol 34 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Filip Miljković ◽  
Jürgen Bajorath
2019 ◽  
Vol 5 (7) ◽  
pp. FSO404 ◽  
Author(s):  
Filip Miljković ◽  
Jürgen Bajorath

Aim: A large collection of promiscuity cliffs (PCs), PC pathways (PCPs) and promiscuity hubs (PHs) formed by inhibitors of human kinases is made freely available. Methodology: Inhibitor PCs were systematically identified and organized in network representations, from which PCPs were extracted. PH compounds were classified and their neighborhoods analyzed. Data & exemplary results: Nearly 16,000 PCs covering the human kinome were identified, which yielded more than 600 PC clusters and 8900 PCPs. Moreover, 520 PHs were obtained. Limitations & next steps: PC and PCP data structures capture structure–promiscuity relationships. Promiscuity assessment is also affected by data sparseness. Given the rapid growth of kinase inhibitor data, the relevance of PC/PCP/PH information for medicinal chemistry and chemical biology applications will further increase.


1994 ◽  
Vol 9 (3) ◽  
pp. 127
Author(s):  
X.-B. Lu ◽  
F. Stetter
Keyword(s):  

Disputatio ◽  
2019 ◽  
Vol 11 (55) ◽  
pp. 345-369
Author(s):  
Peter Ludlow

AbstractDavid Chalmers argues that virtual objects exist in the form of data structures that have causal powers. I argue that there is a large class of virtual objects that are social objects and that do not depend upon data structures for their existence. I also argue that data structures are themselves fundamentally social objects. Thus, virtual objects are fundamentally social objects.


Sign in / Sign up

Export Citation Format

Share Document