Abstract | ||
---|---|---|
We present a scalable method to extensively search for and accurately select pharmaceutical drug candidates in large spaces of drug conformations computationally generated and stored across the nodes of a large distributed system. For each legend conformation in the dataset, our method first extracts relevant geometrical properties and transforms the properties into a single metadata point in the three-dimensional space. Then, it performs an ochre-based clustering on the metadata to search for predominant clusters. Our method avoids the need to move legend conformations among nodes because it extracts relevant data properties locally and concurrently. By doing so, we can perform accurate and scalable distributed clustering analysis on large distributed datasets. We scale the analysis of our pharmaceutical datasets a factor of 400X higher in performance and 500X larger in size than ever before. We also show that our clustering achieves higher accuracy compared with that of traditional clustering methods and conformational scoring based on minimum energy. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/CCGrid.2015.94 | Cluster Computing and the Grid |
Field | DocType | ISSN |
Data mining,Cluster (physics),Metadata,Extreme scale,Computer science,Protein–ligand docking,Cluster analysis,Scalable distributed,Data reduction,Scalability | Conference | 2376-4414 |
Citations | PageRank | References |
2 | 0.37 | 7 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
boyu zhang | 1 | 71 | 17.54 |
Trilce Estrada | 2 | 120 | 18.27 |
Pietro Cicotti | 3 | 101 | 14.52 |
Pavan Balaji | 4 | 1475 | 111.48 |
michela taufer | 5 | 352 | 53.04 |