Steffen Neumann | Search PubMed

PubMed2004

Database driven test case generation for protein-protein docking.

UNLABELLED: We present a method for automatic test case generation for protein-protein docking. A consensus-type approach is proposed processing the whole PDB and classifying protein structures into complexes and unbound proteins by combining information from three different approaches (current PDB-at-a-glance classification, search of complexes by sequence identical unbound structures and chain naming). Out of this classification test cases are generated automatically. All calculations were run on the database. The information stored is available via a web interface. The user can choose several criteria for generating his own subset out of our test cases, e.g. for testing docking algorithms. AVAILABILITY: http://bibiserv.techfak.uni-bielefeld.de/agt-sdp/ CONTACT: fzoellne@techfak.uni-bielefeld.de.

Algorithms↗

PubMed2002

Comparing bound and unbound protein structures using energy calculation and rotamer statistics.

Protein data in the PDB covers only a snapshot of a protein structure. For flexible docking conformational changes need to be considered. Rotamer statistics provide the likelihood for side chain conformations, and further comparison of bound and unbound state yields differences in preferred positions. Furthermore, we do a full sampling of selected chi angles and apply the AMBER force field. Conformation of energy minima complies with the rotamer statistics. Both types of information target the reduction of search space for enumerative docking algorithms and provide parameters for elastic docking.

Databases, Protein↗