{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T10:10:31Z","timestamp":1675159831298},"reference-count":6,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We present a method for automatic test case generation for protein\u2013protein 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.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/bibiserv.techfak.uni-bielefeld.de\/agt-sdp\/<\/jats:p>\n               <jats:p>Contact: \u00a0fzoellne@techfak.uni-bielefeld.de<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti061","type":"journal-article","created":{"date-parts":[[2004,10,13]],"date-time":"2004-10-13T01:32:31Z","timestamp":1097631151000},"page":"683-684","source":"Crossref","is-referenced-by-count":1,"title":["Database driven test case generation for protein\u2013protein docking"],"prefix":"10.1093","volume":"21","author":[{"given":"Frank","family":"Z\u00f6llner","sequence":"first","affiliation":[{"name":"Applied Computer Science, Faculty of Technology, Bielefeld University D-33594 Bielefeld, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Neumann","sequence":"additional","affiliation":[{"name":"Applied Computer Science, Faculty of Technology, Bielefeld University D-33594 Bielefeld, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Kummert","sequence":"additional","affiliation":[{"name":"Applied Computer Science, Faculty of Technology, Bielefeld University D-33594 Bielefeld, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Sagerer","sequence":"additional","affiliation":[{"name":"Applied Computer Science, Faculty of Technology, Bielefeld University D-33594 Bielefeld, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2004,10,12]]},"reference":[{"key":"2023013107223863100_B1","unstructured":"Bermann, H.M., Westbrook, J., Zukang, F., Gilliland, G., Bhat, T.N., Weissig, H., Shindylalov, I.N., Bourne, P.E. 2000The Protein Data Bank. Nucleic Acids Res.28235\u2013242"},{"key":"2023013107223863100_B2","unstructured":"Chen, R., Mintseric, N., Janin, J., Weng, Z. 2003A protein\u2013protein docking benchmark. Proteins5288\u201391"},{"key":"2023013107223863100_B3","unstructured":"Halperin, I., Ma, B., Wolfson, H., Nussinov, R. 2002Principles of docking: an overview of search algorithms and a guide to scoring functions. Proteins47409\u2013443"},{"key":"2023013107223863100_B4","unstructured":"Martin, O., Heuser, P., Schomburg, D. 2003An automatic procedure for the search and identification of new unbound docking examplex. Proceedings of the European Conference on Computational Biology (ECCB 2003) , Paris, France  September 27\u201330, Poster PS-12"},{"key":"2023013107223863100_B5","doi-asserted-by":"crossref","unstructured":"Murzin, A.G., Brenner, S.E., Hubbard, T., Chothia, C. 1995SCOP: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol.247,  pp. 536\u2013540","DOI":"10.1016\/S0022-2836(05)80134-2"},{"key":"2023013107223863100_B6","unstructured":"Pearlstein, R. and FitzGerald, P. 1996PDB-at-a-glance.                     http:\/\/cmm.info.nih.gov\/modeling\/pdb_at_a_glance.html"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/5\/683\/48962477\/bioinformatics_21_5_683.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/5\/683\/48962477\/bioinformatics_21_5_683.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T09:49:00Z","timestamp":1675158540000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/5\/683\/220315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,12]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2005,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti061","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,3,1]]},"published":{"date-parts":[[2004,10,12]]}}}