LIDeB tools

🖐About Us

We are a drug discovery team with an interest in the development of publicly available open-source customizable cheminformatics tools to be used in computer-assisted drug discovery. We belong to the Laboratory of Bioactive Research and Development (LIDeB) of the National University of La Plata (UNLP), Argentina. Our research group is focused on computer-guided drug repurposing and rational discovery of new drug candidates to treat epilepsy and neglected tropical diseases.


⚡ Coming soon more webapps! 🎈


📌Heatmaps- Similarity

ℹ About this App

Build a Heatmap of molecular similarity. These plots of inter-molecular similarity (computed as Tanimoto similarity coefficient using Morgan fingerprints and other molecular fingerprinting systems) allow for a fast, visual inspection of the molecular diversity of the datasets, and also preliminary detection of clusters within a dataset. The resulting plots are downloadable as .png files through a simple right click on your mouse!.




ℹ About this App

LUDe (LIDEB’s Useful Decoys) is WebApp that generates, from a set of active compounds, decoys (putative inactive compounds) which can be used to retrospectively validate virtual screening tools/protocols. Decoys are molecules that have not been tested against a molecular target of interest but due to their structural features are presumably not prone to bind the target with high affinity. LUDe finds decoys in a curated ChEMBL27 database which are paired with the known active compounds in relation to certain general physicochemical properties (e.g., molecular weight, log P, and others) but which are topologically different from the query compounds. LUDe is conceptually similar to the Directory of Useful Decoys enhanced, but additional filters have been serially implemented to assure the topological dissimilarity between the decoys and the active compounds.



ℹ About this App

iRaPCA Clustering is based on an iterative combination of the random subspace approach (feature bagging), dimensionality reduction through Principal Component Analysis (PCA) and the k-means algorithm. The optimal number of clusters k and the best subset of descriptors are selected from plots of silhouette coefficient against different k values and subsets. Different validation metrics can be downloaded once the process is finished. A number of graphs may be built and readily downloaded through a simple click.