Table 4. Computational time.
| Chains | PDBID | Length | Pair Dock | Multi. Dock | Path | Total |
|---|---|---|---|---|---|---|
| 3 | 1a0r | 650 | 30.5 | 470.0 | 2.5 | 503.0 |
| 1ikn | 641 | 56.0 | 372.5 | 2.8 | 431.3 | |
| 4 | 1es7 | 410 | 32.0 | 331.0 | 1.6 | 364.6 |
| 2qsp | 572 | 148.3 | 464.0 | 5.3 | 617.6 | |
| 3fh6 | 1552 | 254.5 | 1214.5 | 42.8 | 1511.8 | |
| 5 | 1w88 | 1433 | 352.3 | 1431.3 | 32.8 | 1816.4 |
| 6 | 1du3 | 894 | 165.0 | 749.0 | 5.5 | 919.5 |
| 1s5b | 1303 | 134.0 | 624.0 | 7.3 | 765.3 |
Length shows the total length of the chains of a complex. The unit of computational time is in CPU hours. Computational time for a complex is divided into three steps, the pairwise subunit docking (Pair Dock), multiple docking (Multi. Dock; assembling a complex), and computing paths from the docking results (Path). Computations were performed on a computer with Intel Xeon-E5 CPU and 126 or 96 GB RAM.