Made on
Tilda
The first time they ran a benchmark, the results were almost unbelievable. A docking run that used to take twelve minutes on AutoDock 4 completed in forty seconds with the new engine. And the accuracy—measured by how well it reproduced known crystal structures—was slightly better . Forli ran it again. Then again. Each time, the same result: a hundredfold speedup, no loss of fidelity.
In the early 2000s, computational chemistry faced a bottleneck as stubborn as a stuck door in a blast-proof vault. It was called the docking problem. Researchers would spend months synthesizing a molecule they hoped would bind to a disease-causing protein, only to find it was a poor fit—like trying to force a square peg into a round hole. The process was slow, expensive, and demoralizing. Then, a modest laboratory at The Scripps Research Institute in La Jolla, California, decided to stop hammering the door and instead redesign the key.
The scoring function was next. They simplified the complex empirical equations of its predecessor, stripping away parameters that added noise without improving predictive power. "Elegance is precision with fewer variables," Forli liked to say. They added a simple but clever twist: a set of pre-calculated affinity maps for each atom type, turning a calculation of many-body physics into a fast look-up table. autodock vina
As the years passed, Forli continued to refine the code, but the core philosophy remained: simplicity, speed, and accuracy in balance. He would later write in a retrospective paper, "Vina succeeded not because it was the most sophisticated tool, but because it was the most usable tool. We removed the friction between a scientist and an answer."
Morris nodded. "We're not looking for the perfect answer. We need the right-enough answer, fast." The first time they ran a benchmark, the
That was the conceptual spark. They decided to break the unwritten rule of docking: that accuracy and speed were eternal enemies. Forli began rewriting the search algorithm from scratch, replacing the sluggish genetic algorithm with a combination of iterative local search and what he called a "broyden–fletcher–goldfarb–shanno" (BFGS) quasi-Newton method. It was a mathematical mouthful, but its effect was profound. Instead of randomly sampling poses like a blindfolded miner, the new method intelligently rolled downhill toward the lowest energy, learning the terrain as it went.
They named it AutoDock Vina—"Vina" for "vine," suggesting something that grows quickly and finds its way. Forli ran it again
The release in 2010 was not a press conference with flashing cameras. It was a quiet upload to a server, a few lines of code, and a command-line interface with no graphical buttons. Yet within weeks, the computational biology world trembled. Graduate students who had been waiting days for docking results suddenly got them during a coffee break. A lab in Germany used Vina to screen ten million compounds against a malaria target in a single weekend—a task that previously would have taken a year. Pharmaceutical companies, initially skeptical of its stripped-down approach, began quietly integrating it into their pipelines when they realized it was finding the same hits as their expensive commercial software, only faster.