AutoDock Vina is an open-source molecular docking engine designed to predict the binding mode and binding affinity of a small molecule ligand to a target protein receptor. Developed by Dr. Oleg Trott at The Scripps Research Institute, it significantly improves upon its predecessor AutoDock 4 by combining a novel empirical scoring function with an efficient iterated local search global optimizer, achieving approximately two orders of magnitude speedup while maintaining high prediction accuracy.
Glossary
AutoDock Vina

What is AutoDock Vina?
AutoDock Vina is a widely used open-source molecular docking engine that employs a sophisticated empirical scoring function and an iterated local search global optimization algorithm for rapid and accurate pose prediction.
The engine operates by treating the ligand as flexible and the receptor as rigid or partially flexible, exploring the conformational space of the ligand within a user-defined search volume. Its scoring function approximates the free energy of binding by combining terms for steric, hydrophobic, and hydrogen bonding interactions, outputting results in kcal/mol. AutoDock Vina is a core component of many virtual screening pipelines and is frequently integrated with platforms like PyRx for high-throughput drug-target interaction prediction.
Key Features of AutoDock Vina
AutoDock Vina is an open-source molecular docking engine that combines a sophisticated empirical scoring function with an iterated local search global optimizer to achieve rapid and accurate binding pose prediction.
Iterated Local Search Global Optimizer
Vina employs a stochastic global optimization algorithm that combines local BFGS optimization with a Metropolis acceptance criterion. The algorithm performs a series of random Markov chain mutations to escape local minima, followed by local optimization steps. This hybrid approach achieves a success rate of predicting near-native poses within 2 Å RMSD that rivals more computationally expensive methods, while requiring only a fraction of the CPU time.
Empirical Scoring Function
The scoring function approximates the binding free energy as a sum of intermolecular and intramolecular contributions:
- Steric interactions: Modeled by a repulsive term and an attractive Gaussian term
- Hydrophobic effect: Proportional to the buried solvent-accessible surface area
- Hydrogen bonding: A directional term dependent on donor-acceptor geometry
- Torsional entropy: Penalty proportional to the number of rotatable bonds frozen upon binding This function was trained on a diverse set of protein-ligand complexes from the PDBbind database.
Multithreaded Parallel Execution
Vina natively supports multithreaded parallelism to exploit multi-core CPU architectures. The global optimization algorithm runs multiple independent search trajectories concurrently, each starting from a different random seed. This embarrassingly parallel design yields near-linear speedup with the number of available cores, enabling high-throughput virtual screening of large compound libraries on standard workstation hardware without requiring specialized cluster management software.
Flexible Receptor Sidechains
While the protein backbone remains rigid, Vina allows selected receptor sidechains to be treated as flexible during docking. Users specify which residues to make flexible in the PDBQT input file. The optimizer simultaneously samples ligand poses and sidechain rotameric states, capturing induced-fit effects that are critical for targets with plastic binding pockets. This partial flexibility model balances computational tractability with biological realism.
AutoDock PDBQT Format
Vina uses the PDBQT format, which extends the standard PDB format with partial charges and atom type assignments. Key features include:
- AutoDock atom types: Assigns each atom a type (e.g., C, OA, HD) for scoring function lookups
- Gasteiger partial charges: Computed using an empirical method for electrostatic interaction calculation
- Rotatable bond flags: Marked with BRANCH/ENDBRANCH keywords to define torsional degrees of freedom This format ensures seamless interoperability with the broader AutoDock ecosystem.
Exhaustiveness Parameter
The exhaustiveness parameter controls the trade-off between speed and accuracy by setting the number of independent global optimization runs. A higher value increases the probability of finding the global minimum but linearly increases computation time. Typical values range from 8 for quick screening to 32-64 for high-accuracy pose prediction. This tunable knob allows researchers to adapt Vina's behavior to the specific requirements of virtual screening versus lead optimization workflows.
AutoDock Vina vs. Other Docking Engines
Comparative analysis of AutoDock Vina against widely used molecular docking engines across key performance, algorithmic, and usability dimensions.
| Feature | AutoDock Vina | AutoDock 4 | Glide (SP) | rDock |
|---|---|---|---|---|
Search Algorithm | Iterated Local Search + BFGS | Lamarckian Genetic Algorithm | Systematic + Monte Carlo | Genetic Algorithm + Monte Carlo |
Scoring Function | Empirical + Knowledge-based | Semi-empirical Force Field | Empirical (GlideScore) | Empirical (SCORE) |
Approximate Docking Time per Ligand | < 1 min | 10-30 min | 30 sec - 2 min | 1-5 min |
Redocking RMSD Accuracy | < 2.0 Å | < 2.0 Å | < 1.5 Å | < 2.5 Å |
License Type | Apache 2.0 (Open Source) | GPL (Open Source) | Commercial (Proprietary) | LGPL (Open Source) |
GPU Acceleration | ||||
Flexible Receptor Residues | ||||
Command-line Scriptable |
Frequently Asked Questions
Clear, technically precise answers to the most common questions about the AutoDock Vina molecular docking engine, its scoring function, and its role in computational drug discovery workflows.
AutoDock Vina is an open-source molecular docking engine that predicts the preferred binding pose and affinity of a small molecule ligand within a target protein's binding site. It operates through a novel iterated local search global optimization algorithm, which systematically explores the conformational and positional space of the ligand. The algorithm begins by generating random starting poses, then applies a sequence of local optimizations using the quasi-Newton Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. Crucially, Vina employs a stochastic mutation step to escape local minima, followed by another local optimization. This cycle repeats, with the algorithm accumulating a diverse set of low-energy poses. The final output is a ranked list of predicted binding modes, each with an associated binding affinity score in kcal/mol. Unlike its predecessor AutoDock 4, Vina was designed from the ground up for multicore processors, achieving a speedup of up to two orders of magnitude without sacrificing accuracy.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Core concepts and computational methods that interact with AutoDock Vina in structure-based drug discovery workflows.
Conformational Sampling
The process of exploring the rotatable bond space of a flexible ligand to generate diverse 3D shapes. Vina employs an iterated local search algorithm that combines stochastic global exploration with local BFGS optimization.
- Each ligand typically has 5–15 rotatable bonds, creating an enormous search space
- Vina's algorithm efficiently escapes local minima to find the global energy minimum
- Sampling quality directly determines whether the correct binding pose is recovered
Root-Mean-Square Deviation (RMSD)
The gold-standard metric for evaluating docking accuracy. RMSD measures the average atomic distance between a predicted ligand pose and the experimentally determined pose from X-ray crystallography.
- A prediction is considered successful if RMSD ≤ 2.0 Å
- Vina typically achieves success rates of 70–80% on redocking benchmarks
- Lower RMSD values indicate near-native pose prediction quality
Virtual Screening
The high-throughput computational evaluation of large chemical libraries (10⁵–10⁹ compounds) against a target protein. Vina's speed—typically < 1 second per ligand on a single CPU core—makes it a workhorse for this application.
- Used to filter commercial compound catalogs before expensive physical screening
- Often combined with pharmacophore filters to pre-select drug-like molecules
- Success measured by enrichment factor: how many actives appear in the top-ranked fraction
Binding Affinity Prediction
The quantitative estimation of interaction strength between ligand and receptor. While Vina's scores correlate with experimental binding affinities, they are approximate and best used for ranking rather than absolute free energy calculation.
- For rigorous ΔG prediction, methods like Free Energy Perturbation (FEP) are preferred
- Vina's scoring function was trained on the PDBbind refined set of experimentally measured complexes
- Typical correlation with experimental pKi/pKd: R ≈ 0.5–0.6

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us