prodigy
importedsoftware/prodigy
Predict the binding affinity of protein-protein complexes from structural data
Machine-generated from the listed sources and not yet reviewed by a human.
- Category
- Software & Systems
- Subcategory
- unknown
- License
- Apache-2.0(osi)
- Status
- maintained
- Maturity
- deployed
- Organization
- haddocking
- Country
- unknown
- Homepage
- wenmr.science.uu.nl/prodigy/
- Repository
- github.com/haddocking/prodigy
- Documentation
- unknown
- Tags
- binding-affinity · bioinformatics · python3 · utrecht-university
- Regulatory
- unknown
Top contributors by commit count, from the project’s public repository. Avatars are served by their origin, not stored here. To be removed from this list, open an issue.
Computed from shared tags, weighted so a rare tag counts for more than a common one. These are suggestions, not curated relationships.
- pdb-toolsbioinformatics · utrecht-university
A dependency-free cross-platform swiss army knife for PDB files.
- haddock3bioinformatics · utrecht-university
Official repo of the modular BioExcel version of HADDOCK
- boltz2-notebookbinding-affinity · bioinformatics
Boltz2 Notebook – A streamlined Colab-based pipeline for protein structure prediction and binding affinity analysis using the Boltz2 deep learning model.
- hybridock-pepbinding-affinity · bioinformatics
Hybrid peptide docking: RAPiDock diffusion sampling + physics-based rescoring (iGEM 2026)
- ComDetutrecht-university
ImageJ plugin detecting and colocalizing particles of given size (vesicles, dots, etc on biological microscopy images)
- Correlescenceutrecht-university
spatial and temporal cross correlations in 1D and 2D for fluorescent microscopy (ImageJ plugin)
- api.github.com/repos/haddocking/prodigyretrieved 2026-08-25 · via github-api
Machine-imported from GitHub search. Last push 2025-10-03, 193 stars, license reported as Apache-2.0. Category and schematic were assigned by keyword heuristics and are unreviewed.
Not yet verified by a human. Correct this record →
/v1/entries/59.json→ .entries["prodigy"]
Entries are sharded 64 ways by a stable hash of the id, so a consumer can find any record without an index.