p2rank

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

(★ 451)

P2Rank: Protein-ligand binding site prediction from protein structure based on machine learning.

p2rank Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

<img src="https://github.com/rdk/p2rank/blob/develop/misc/img/p2rank_logo.svg?raw=true" width="280" alt="P2Rank" title="logo">

Ligand-binding site prediction based on machine learning.

<a href="https://github.com/rdk/p2rank/releases" title="go to the release page"><img src="https://img.shields.io/badge/release-2.5.1-green.svg"></img></a>
[![Build Status](https://github.com/rdk/p2rank/actions/workflows/develop.yml/badge.svg)](https://github.com/rdk/p2rank/actions)
[![License: MIT](https://img.shields.io/badge/license-MIT-blue.svg?style=flat)](https://raw.githubusercontent.com/rdk/p2rank/develop/LICENSE.txt)
![GitHub all releases](https://img.shields.io/github/downloads/rdk/p2rank/total)

### Description

P2Rank is a stand-alone command-line program for fast and accurate prediction of ligand-binding sites from protein structures. 
It achieves high prediction success rates without relying on external software for computation of complex features or on a database of known protein-ligand templates.
           
### ✨ What's new?
  
* Available in **2.6** (alpha): pocket-grid & per-pocket descriptor exports, [cofactor-as-surface handling](documentation/cofactors.md), [modified-to-canonical residue mapping](documentation/aa-mapping.md), and additional supported methods for rescoring (see [alpha release](https://github.com/rdk/p2rank/releases/tag/2.6-alpha)).
* Version **2.5** brings speed optimizations (~2x faster prediction), ChimeraX visualizations, and improvements to rescoring (`fpocket-rescore` command).
* Version **2.4.2** adds support for BinaryCIF (`.bcif`) input and rescoring of fpocket predictions in `.cif` format.          
* Version **2.4** adds support for mmCIF (`.cif`) input and contains a special profile for predictions on AlphaFold models and NMR/cryo-EM structures.

Version 2.6 also brings substantially improved documentation, headlined by a new comprehensive **[User Guide](documentation/user-guide.md)** that covers installation, prediction, rescoring, configuration, performance tuning, and troubleshooting in one place. Several topic-specific docs have been added or expanded alongside it (see the [documentation index](documentation/readme.md)).

### Requirements

* **Runtime**: Java 17 or later (tested up to Java 26)
* **Visualization** (optional): PyMOL or ChimeraX

Runs on Linux, macOS, and Windows. \
On Windows, run from Git Bash to avoid command-line formatting issues.

### Setup

P2Rank requires no installation. Binary packages are available as GitHub Releases.

* **Download**: https://github.com/rdk/p2rank/releases
* Source code: https://github.com/rdk/p2rank
* Datasets: https://github.com/rdk/p2rank-datasets
* **[User Guide](documentation/user-guide.md)**: comprehensive documentation for new and advanced users
* All documentation: [documentation/](documentation/readme.md)

### Usage

<pre>
prank predict -f test_data/1fbl.pdb # predict pockets on a single pdb file 
</pre>

See more usage examples below...

### Algorithm

P2Rank makes predictions by scoring and clustering points on the protein's solvent accessible surface. 
Ligandability score of individual points is determined by a machine learning model trained on a dataset of known protein-ligand complexes. 
For more details, see the slides and publications.

Presentation slides introducing the original version of the algorithm: [Slides (pdf)](https://bit.ly/p2rank-slides)

### Publications

If you use P2Rank, please cite relevant papers: <a href="misc/citations.md" title="go to the BibTex citations" target="_blank"><img align="right" src="https://img.shields.io/badge/BibTeX-eee"></img></a>

* [Software article](https://doi.org/10.1186/s13321-018-0285-8) about P2Rank pocket prediction tool  
 Krivak R, Hoksza D. ***P2Rank: machine learning based tool for rapid and accurate prediction of ligand binding sites from protein structure.*** Journal of Cheminformatics. 2018 Aug.  
* [Latest web-server article](https://doi.org/10.1093/nar/gkaf421) about updates in P2Rank and [prankweb.cz](https://prankweb.cz)  
 Polak L, Skoda P, Riedlova K, Krivak R, Novotny M, Hoksza D. ***PrankWeb 4: a modular web server for protein–ligand binding site prediction and downstream analysis.*** Nucleic Acids Research, 2025 May.
  * [Web-server article](https://doi.org/10.1093/nar/gkac389) about updates in [prankweb.cz](https://prankweb.cz)  
 Jakubec D, Skoda P, Krivak R, Novotny M, Hoksza D. ***PrankWeb 3: accelerated ligand-binding site predictions for experimental and modelled protein structures.*** Nucleic Acids Research, Volume 50, Issue W1, 5 July 2022, Pages W593–W597  
  * [Web-server article](https://doi.org/10.1093/nar/gkz424) introducing the web interface at [prankweb.cz](https://prankweb.cz)  
 Jendele L, Krivak R, Skoda P, Novotny M, Hoksza D. ***PrankWeb: a web server for ligand binding site prediction and visualization.*** Nucleic Acids Research, Volume 47, Issue W1, 02 July 2019, Pages W345-W349 
* [Conference paper](https://doi.org/10.1007/978-3-319-21233-3_4) introducing P2Rank prediction algorithm  
 Krivak R, Hoksza D. ***P2RANK: Knowledge-Based Ligand Binding Site Prediction Using Aggregated Local Features.*** International Conference on Algorithms for Computational Biology 2015 Aug 4 (pp. 41-52). Springer
* [Research article](https://doi.org/10.1186/s13321-015-0059-5) about PRANK rescoring algorithm (now included in P2Rank)  
 Krivak R, Hoksza D. ***Improving protein-ligand binding site prediction accuracy by classification of inner pocket points using local features.*** Journal of Cheminformatics. 2015 Dec.

👨‍💻 Usage Examples
--------------

Following commands can be executed in the installation directory.

### Help and version

~~~ruby
prank help   # print help for main commands and parameters
prank -v     # print version and some system info
~~~

### Predict ligand binding sites (P2Rank algorithm)

~~~ruby
prank predict test.ds                    # run on dataset containing a list of pdb/cif files

prank predict -f test_data/1fbl.pdb      # run on a single pdb file
prank predict -f test_data/1fbl.cif      # run on a single mmCIF file
prank predict -f test_data/1fbl.bcif     # run on a single BinaryCIF file
prank predict -f test_data/1fbl.pdb.gz   # run on a single gzipped pdb file (other formats can be compressed too)
prank predict -f test_data/1fbl.cif.zst  # run on a single cif file compressed with Zstandard

prank predict -threads 8     test.ds     # specify num. of working threads for parallel dataset processing
prank predict -o output_here test.ds     # explicitly specify output directory

prank predict -c alphafold   test.ds     # use alphafold config and model (config/alphafold.groovy)
~~~

> [!TIP]
> Use `-c alphafold` for **AlphaFold models, NMR ensembles, and cryo-EM structures**.
> The default model uses B-factor as a feature, which is meaningful for X-ray crystal
> structures but stores pLDDT confidence in AlphaFold models and resolution-based values
> in cryo-EM. The `alphafold` config drops B-factor from the feature set.

### Prediction output

For each structure file `{protein_file}` in the dataset, P2Rank generates several output files:
   * `{protein_file}_predictions.csv`: lists **predicted pockets** in order of score, including each pocket's score, center coordinates, adjacent residues, adjacent protein surface atoms, and a calibrated probability of being a ligand-binding site.
   * `{protein_file}_residues.csv`: lists **all residues** from the input protein along with their scores, mapping to predicted pockets, and a calibrated probability of being a ligand-binding residue.
   * **PyMol and ChimeraX visualizations**: `.pml` and `.cxc` scripts in `visualizations/` directory  with additional files in `data/`.
     * Optional settings:
       * Use `-visualizations 0` to disable visualization generation.
       * Use `-vis_renderers 'pymol,chimerax'` to toggle specific renderers on/off.
       * Use `-vis_copy_proteins 0` to prevent copying protein structures to the visualizations directory (faster, but visualizations won't be portable). 
   * **SAS points data**: coordinates and ligandability scores for solvent-accessible surface (SAS) points are saved in `visualizations/data/{protein_file}_points.pdb.gz`. Here:
     * Residue sequence number (position 23-26) represents the pocket rank (0 indicates no pocket).
     * B-factor column contains predicted ligandability score.
   * **Opt-in tabular exports** (off by default):
     * `-export_pocket_descriptors 1` → per-pocket geometric, shape, and electrostatic descriptors (volume, sphericity, radius of gyration, residue/atom counts, principal moments, net charge, polarity, dipole magnitude) in CSV/Arrow/Parquet. See [`documentation/export-pocket-descriptors.md`](documentation/export-pocket-descriptors.md).
     * `-export_pocket_grid 1` → per-pocket 3D grid of points covering the empty space around predicted pockets, with per-grid-point descriptors (volsite pharmacophore indicators + smoothed analogue + Coulomb-flavour electrostatics). See [`documentation/export-pocket-grid.md`](documentation/export-pocket-grid.md).
     * `-vis_pocket_grid 1` → additional PyMOL/ChimeraX overlays of the grid for visualization.

### Configuration

You can override the default parameter values in a custom config file:

~~~ruby
prank predict -c config/example.groovy  test.ds
prank predict -c example                test.ds # same effect, config/ is default location and .groovy implicit extension
~~~

It is also possible to override parameters on the command line using their full name after `-` (not `--`).

~~~ruby
prank predict                   -visualizations 0 -threads 8  test.ds   #  turn off visualizations and set the number of threads
prank predict -c example.groovy -visualizations 0 -threads 8  test.ds   #  overrides defaults as well as values from example.groovy
~~~

P2Rank has many configurable parameters. 
To see the list of standard parameters look into `config/default.groovy` and other example config files in this directory.
To see the complete commented list of all (including undocumented)
parameters see [Params.groovy](https://github.com/rdk/p2rank/blob/develop/src/main/groovy/cz/siret/prank/program/params/Params.groovy) in the source code.

### Rescoring (PRANK algorithm)

In addition to predicting new ligand binding sites, 
P2Rank is also able to rescore pockets predicted by other methods
(Fpocket,
Pocketeer,
ConCavity,
SiteHound,
MetaPocket2,
LISE,
DeepSite,
PUResNetV2.0,
SwinSite,
and Seq2Pocket
are supported at the moment).
See [rescoring documentation](documentation/rescoring.md) for details.

Rescoring output:
* `{protein_file}_rescored.csv`: list of pockets sorted by the new score
* `{protein_file}_predictions.csv`: same as with `prank predict` (since 2.5)
  * Note: probability column is calibrated for rescoring fpocket predictions
* visualizations

~~~ruby
prank rescore fpocket.ds                   
prank rescore fpocket.ds -o output_here   # explicitly specify output directory
prank rescore fpocket.ds -c rescore_2024  # use new experimental rescoring model (recommended for alphafold models)
~~~

For rescoring, the dataset file needs to have a specific 2-column format. See examples in `test_data/`: `fpocket.ds`, `concavity.ds`, `puresnet.ds`, `pocketeer.ds`, `swinsite.ds`.

New experimental rescoring model `-c rescore_2024` shows promising results but hasn't been fully evaluated yet. It is recommended for AlphaFold models, NMR and cryo-EM structures since it doesn't depend on b-factor as a feature.

#### Run fpocket and rescore in one command

You can use `fpocket-rescore` command to run [Fpocket](https://github.com/Discngine/fpocket) and then rescore its predictions automatically.

~~~ruby
prank fpocket-rescore test.ds                                       # expects 'fpocket' command in PATH
prank fpocket-rescore test.ds -fpocket_command "/bin/fpocket -w m"  # specify custom fpocket command (optionally with arguments)
prank fpocket-rescore test.ds -fpocket_keep_output 0                # delete fpocket output files
~~~

In this case, the dataset file can be a simple list of pdb/cif files since Fpocket predictions will be calculated ad-hoc.
`prank fpocket-rescore` will produce `predictions.csv` as well, so it can be used as an in-place replacement for `prank predict` in most scenarios.
Note: if you use `fpocket-rescore`, please cite Fpocket as well.

### Evaluate prediction and rescoring models

Use following commands to calculate prediction metrics (prediction success rates using DCA, DCC, ...) on structure files, where the ligands are present.

~~~ruby
prank eval-predict -f test_data/1fbl.pdb         # evaluate default prediction model on a single file
prank eval-predict              test.ds          # evaluate default prediction model on a dataset with known ligands
prank eval-predict -c alphafold test.ds          # evaluate specific prediction model on a dataset with known ligands

prank eval-rescore                 fpocket.ds    # evaluate default rescoring model on a dataset with known ligands
prank eval-rescore -c rescore_2024 fpocket.ds    # evaluate specific rescoring model on a dataset with known ligands
~~~

## 🏗️ Build from sources

This project uses [Gradle](https://gradle.org/) build system via included Gradle wrapper.
Requires a **JDK** (not JRE) 17 or later on `PATH` or via `JAVA_HOME`.
On Windows, use `bash` to run build commands (installed by default with [Git for Windows](https://git-scm.com/download/win)).

> [!NOTE]
> `distro/prank` is the production launcher you'll also find in the downloaded release.
> `prank.sh` (repo root) is the development launcher used during training and feature work,
> as described in the training tutorial. Routine prediction work uses `distro/prank`
> (or just `prank` if the directory is on your `PATH`).

```ruby
git clone https://github.com/rdk/p2rank.git && cd p2rank
./make.sh          # after this, you can use the program by running ./prank.sh or ./distro/prank

./make-distro.sh   # creates a tar.gz archive with the program in .build/
                   # which can be used as a portable binary package

./unit-tests.sh    # optionally you can run tests to check everything works fine on your machine        
./tests.sh quick   # script that runs further tests

```    
You can now run the program using:
```ruby
distro/prank       # standard mode that is run in production
./prank.sh         # development/training mode 
``` 
To use `./prank.sh` (development/training mode) first you should copy and edit `misc/local-env.sh` into repo root directory (see [training tutorial](https://github.com/rdk/p2rank/blob/develop/documentation/training-tutorial.md#preparing-the-environment)).

## ⚖️ Comparison with Fpocket

[Fpocket](https://github.com/Discngine/fpocket) is a widely used open source ligand binding site prediction program.
It is fast, easy to use and well documented. As such, it served as a great inspiration for this project.

Some practical differences:

* **Fpocket**
    - has a much smaller memory footprint 
    - runs faster when executed on a single protein
    - produces a high number of less relevant pockets (and since the default scoring function isn't very effective, the most relevant pockets often don't get to the top)
    - contains MDpocket algorithm for pocket predictions from molecular trajectories
* **P2Rank** 
    - achieves significantly higher identification success rates when considering top-ranked pockets
    - produces a smaller number of more relevant pockets
    - speed:
        + slower when running on a single protein (due to JVM startup cost)
        + approximately as fast on average running on a big dataset on a single core
        + due to parallel implementation potentially much faster on multi-core machines
    - higher memory footprint (~1G but doesn't grow much with more parallel threads)

Both Fpocket and P2Rank have many configurable parameters that influence behaviour of the algorithm and can be tweaked to achieve better results for particular requirements.

## 🙌 Thanks

This program builds upon software written by other people, either through library dependencies or through code included in its source tree (where no library builds were available). Notably:
* FastRandomForest by Fran Supek (https://code.google.com/archive/p/fast-random-forest/)
* FastRandomForest 2.0 (https://github.com/GenomeDataScience/FastRandomForest)
* KDTree by Rednaxela (https://robowiki.net/wiki/User:Rednaxela/kD-Tree)
* BioJava (https://github.com/biojava)
* Chemistry Development Kit (https://github.com/cdk)

## 🤝 Contributing

We welcome any bug reports, enhancement requests, and other contributions. To submit a bug report or enhancement request, please use the [GitHub issues tracker](https://github.com/rdk/p2rank/issues). For more substantial contributions, please fork this repo, push your changes to your fork, and submit a pull request with a good commit message.

p2rank

p2rank Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

p2rank

p2rank Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README