PDBj Mine is a new web interface to PDBj.
PDBj Mine has the following basic features:
PDBj Mine: Design and implementation of relational database interface for Protein Data
Kinjo AR, Yamashita R, Nakamura H.
Database, 2010:baq021 (2010) PubMed:20798081 DOI:10.1093/database/BAQ021
You can use boolean operators for keyword search: &, |, and !. The operators have the usual precedence: NOTANDOR.
If multiple keywords split by and, & or white space are input, you will get a PDB entry list including all the keywords.
e.g.: Searching entries included both "antibody" and "virus"
antibody and virus
You can also describe following form:
If multiple keywords split by or or | are input, you will get a PDB entry list including more than one keyword.
e.g.: Searching entries included both "erythrocyte" and "leukocyte"
erythrocyte or leukocyte
If you want to search not including some keywords, add not or ! operator before such keywords.
e.g.: Searching entries including the "hydrolase" keyword but not including the "phosphate" keyword.
hydrolase not phosphate
You can search entries including an amino acid sequence or a nucleic acid sequence. The sequence is to direct with one letter form. More than five residues can be search.
The format of author name is following:Family name+ commna (,) + white space ( ) +Initial of given name+ period (.)
As only one author assignment is available in the basic search, you may use the advanced search or the sql search for multiple author search.
If you want to find entries that satisfy certain conditions such as resolution, polymer types, annotations, etc., you can use the Advanced Search interface at /advancedSearch where you can specify a variety of conditions.
If Advanced Search does not suffice your need, you can resort to SQL Search where you can write fine-grained queries in SQL, the standard query language for relational databases. To use SQL Search, you must be familiar with SQL as well as the structure of PDBML (PDB's canonical XML format). The structure of the relational database underlying PDBj Mine is based on that of PDBML. The hierarchical structure of PDBML is represented as nested sets defined by pointers to each XML element or attribute.
Some examples of SQL queries based on XPath expressions are presented in PDBj Mine:SQL Queries.
Note: They can be extremely slow! (Please see the examples for demonstration only.)