The BiBiServ team discontinued the online service for AGt_SDP. Please contact the author(s)
of AGT-SDP for any questions concerning AGT-SDP.

In unbound protein--protein docking, the complex of two proteins is predicted using
the unbound conformations of the proteins (Halperin et al.,2002). For testing of docking
algorithms, two unbound proteins which form a known complex have to be identified, so
that the result of the docking algorithm can be compared to the known complex. For the
identification of test cases, the structures taken from the PDB have to be classified
as unbound proteins or complexes and unbound proteins with a 100% sequence identity to
one complex part have to be searched. By now, most groups use handpicked test sets. The
largest collection of test cases used so far is described by Chen et al. (Chen et al.,2003)
and contains 31 test cases for unbound docking. Because of the exponential growth of
available protein structures in the PDB, automatic generation of test cases will become
more and more important in the future.