Region search

GDB provides a full-featured query interface to its database with extensive online help. Several focused query interfaces and predefined reports, such as the Maps within a Region search and Lists of Genes by Chromosome report, present a more intuitive entry into GDB. In particular, GDB s Mapview program provides a graphical interface to the genetic and physical maps available at GDB. 

A particularly useful query is the Maps within a Region search. This search allows retrieval of all maps stored in GDB that span a defined chromosomal region. 

The first part of the method involves sorting all the atoms into their appropriate cells. This sorting is rapid, and may be perfonned at every step. Then, within the force routine, pointers are used to scan tlirough the contents of cells, and calculate pair forces. This approach is very efficient for large systems with short-range forces. A certain amount of unnecessary work is done because the search region is cubic, not (as for the Verlet list) spherical. 

After an alignment of a set of molecules known to bind to the same receptor a comparative molecular field analysis CoMFA) makes it possible to determine and visuahze molecular interaction regions involved in hgand-receptor binding [51]. Further on, statistical methods such as partial least squares regression PLS) are applied to search for a correlation between CoMFA descriptors and biological activity. The CoMFA descriptors have been one of the most widely used set of descriptors. However, their apex has been reached. 

In a systematic search there is a defined endpoint to the procedure, which is reached whe all possible combinations of bond rotations have been considered. In a random search, ther is no natural endpoint one can never be absolutely sure that all of the minimum energ conformations have been found. The usual strategy is to generate conformations until n new structures can be obtained. This usually requires each structure to be generate many times and so the random methods inevitably explore each region of the conformc tional space a large number of times. 

The generation of loops is necessary because disconnected regions are often separated by a section where a few amino acids have been inserted or omitted. These are often extra loops that can be determined by several methods. One method is to perform a database search to find a similar loop and then use its geometric structure. Often, other conformation search methods are used. Manual structure building may be necessary in order to find a conformation that connects the segments. Visual inspection of the result is recommended in any case. 

Model optimization is a further refinement of the secondary and tertiary structure. At a minimum, a molecular mechanics energy minimization is done. Often, molecular dynamics or simulated annealing are used. These are frequently chosen to search the region of conformational space relatively close to the starting structure. For marginal cases, this step is very important and larger simulations should be run. 

For a conformation in a relatively deep local minimum, a room temperature molecular dynamics simulation may not overcome the barrier and search other regions of conformational space in reasonable computing time. To overcome barriers, many conformational searches use elevated temperatures (600-1200 K) at constant energy. To search conformational space adequately, run simulations of 0.5-1.0 ps each at high temperature and save the molecular structures after each simulation. Alternatively, take a snapshot of a simulation at about one picosecond intervals to store the structure. Run a geometry optimization on each structure and compare structures to determine unique low-energy conformations. 

---