ProBiS-Fold overview for predicted binding sites in the human structural proteome
Web server

ProBiS-Fold

Interactive and downloadable predicted binding sites across the human structural proteome, including AlphaFold models and thousands of potentially druggable sites without corresponding PDB structures.

ProBiS-Dock algorithm overview
Docking software

ProBiS-Dock

Fast flexible protein–ligand docking based on a maximum-weight k-clique algorithm, allowing conformational changes in both the ligand and the protein.

ProBiS-Dock Database interface and binding-site data
Database

ProBiS-Dock Database

More than 1.4 million binding sites that can be explored and ranked for their potential utility in drug development across proteins from different species.

CaNDis disease and drug interaction network
Web server

CaNDis

Explore a human causal interaction network enriched with disease and FDA-approved drug data to study disease co-occurrence, candidate genes, and drug–drug interactions.

GenProBiS interface for mapping sequence variants to protein binding sites
Web server

GenProBiS

Map sequence variants onto PDB protein structures enriched with predicted protein, nucleic-acid, compound, and metal-ion binding sites and explore them interactively in 3D.

ProBiS H2O application for identifying conserved water sites in protein structures
Conserved waters

ProBiS H2O

Identify conserved water sites from experimental or user-supplied protein structures using structural comparisons based on the ProBiS algorithm.

ProBiS-CHARMMing protein and ligand visualization
Web server

ProBiS-CHARMMing

Predict and optimize ligands on protein structures with CHARMM, calculate interaction energies, and prepare inputs for minimization and molecular-dynamics simulations.

LiSiCA ligand similarity visualization
Virtual screening

LiSiCA

Ligand-based virtual screening using 2D and 3D molecular similarity, with Tanimoto-based ranking and an accompanying PyMOL plugin.

Graph clique illustration representing the MaxCliqueDyn algorithm
Algorithm

MaxCliqueDyn

A fast exact C++ algorithm for finding a maximum clique in an undirected graph, with applications in bioinformatics and other graph-optimization problems.

About Insilab

Our work spans fundamental graph algorithms and computational methods directly applicable to structural biology, pharmacy and drug discovery.

Insilab was created as a repository for open-source software developed by our group over the years. We continuously develop ProBiS-based approaches for the prediction and comparison of protein binding sites and protein–ligand interactions.

Our methods detect structurally similar binding sites by comparing local physicochemical properties of protein surfaces independently of global sequence or fold. Protein structures are represented as graphs, enabling efficient local structural comparison, binding-site prediction and ligand transposition across PDB structures.

We focus on pharmaceutically relevant proteins and collaborate with experimental laboratories and pharmaceutical partners. Our goal is to use robust in silico methods to prioritize experiments, tackle difficult computational problems and build useful scientific software.