Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Pattern search

Deterministic methods. Deterministic methods follow a predetermined search pattern and do not involve any guessed or random steps. Deterministic methods can be further classified into direct and indirect search methods. Direct search methods do not require derivatives (gradients) of the function. Indirect methods use derivatives, even though the derivatives might be obtained numerically rather than analytically. [Pg.39]

ExPASy Proteomics tools (http //expasy.org/tools/), tools and online programs for protein identification and characterization, similarity searches, pattern and profile searches, posttranslational modification prediction, topology prediction, primary structure analysis, or secondary and tertiary structure prediction. [Pg.343]

Bjorklund M, Sirvio J, Sallinen J, Scheinin M, Kobilka BK, Riekkinen PJ (1999) a c-adrenoceptor overexpression disrupts execution of spatial and non-spatial search patterns. Neuroscience 88 1187-1198... [Pg.179]

Several types of computer models have been developed for estimating the expected concentrations of the chemicals of interest as they move away from the source. Soil transport models attempt to estimate the expected concentration at the surface above buried sources. Plume transport models attempt to estimate the concentrations within a plume, along with its shape and position. A different form of model is designed to guide a search pattern for employing a sensing system to trace a plume. [Pg.102]

Bjorklund, M., Sirvio, J., Riekkinen, M., Sallinen, J., Scheinin, M., and Riekkinen, P., Jr. (2000) Overexpression of ajc-adrenoceptors impairs water maze navigation. Neuroscience 95 481 87. Bjorklund, M., Sirvio, J., Sallinen, J., Scheinin, M., Kobilka, B.K., and Riekkinen, P., Jr. (1999) ajo-Adrenoceptor overexpression disrupts execution of spatial and non-spatial search patterns. Neuroscience 88 1187-1198. [Pg.271]

Other variations of Memory subsystem functioning occur in various d ASCs. The ease with which desired information can be retrieved from memory varies so that in some d-ASCs it seems hard to remember what you want, in others it seems easier than usual. The richness of the information retrieved varies in different d-ASCs, so that sometimes you remember only sketchily, and at other times in great detail. The search pattern for retrieving memories also varies. If you have to go through a fairly complex research procedure to find a particular memory, you may end up with the wrong memories or associated memories rather than what you were looking for. if you want to remember an old friend s name, for example, you may fail to recall the name but remember his bi rthday. [Pg.107]

In creating a database for a search the source characteristics and the desired product profile are natural poles on the matrix axes. Other considerations need then to be layered into the search pattern. Two such considerations might be geography or historical activity. These can be good pointers as to where to search, particularly... [Pg.67]

The final information needed is a search pattern and a definition of the independent variable to be searched. Usual variables are flow rate, %B, and %C %A is assumed to be a dependent variable (100%—the sum of the other solvent percentages). One commercial search pattern starts with all the variables at zero, then systematically changes one variable by a preset percentage and walks incrementally through all possible values, then repeats for the next variable. Once all injections and chromatograms have been run, each run is inspected and the best value is selected. I call this the infinite monkey theory of methods development you will find it uses a lot of time, reagents, and paper. [Pg.174]

A second search pattern makes injections with each variable in turn set at zero with all others at maximum. It then makes an injection with each pair of variables at half maximum and the remaining variable at zero. Finally, it makes an injection with all variables at half maximum and interpolates to predict the best separation. To visualize this half monkey technique, you would plot a triangle with sides defined as 0% to 100% of each variable. First, we would run compositional values at each corner, then the middle of each side, and, finally, at the center point of the triangle. This gets very complicated to visualize with more than two independent variables. [Pg.174]

A more sophisticated method uses a random walk or simplex optimization search pattern, which was developed and is used to find downed aircraft or ships lost at sea. Variable limits are set, then three conditions within these limits are selected at random, injections are made, and chromatograms are run. The resolution sums for the injections are measured and calculated, the lowest value is discarded, and a new variable setting is selected directly opposite the discarded value and equidistant from the reject on a line connecting the two remaining values from the original triad (Fig. 14.3). [Pg.174]

Figure 11,4. ExPASy Proteomic tools. ExPASy server provides various tools for proteomic analysis which can be accessed from ExPASy Proteomic tools. These tools (locals or hyperlinks) include Protein identification and characterization, Translation from DNA sequences to protein sequences. Similarity searches, Pattern and profile searches, Post-translational modification prediction, Primary structure analysis, Secondary structure prediction, Tertiary structure inference, Transmembrane region detection, and Sequence alignment. Figure 11,4. ExPASy Proteomic tools. ExPASy server provides various tools for proteomic analysis which can be accessed from ExPASy Proteomic tools. These tools (locals or hyperlinks) include Protein identification and characterization, Translation from DNA sequences to protein sequences. Similarity searches, Pattern and profile searches, Post-translational modification prediction, Primary structure analysis, Secondary structure prediction, Tertiary structure inference, Transmembrane region detection, and Sequence alignment.
The fact that a profile or HMM can pick out new sequences also related to the given family suggests that these should be used to update the profile or HMM used as search pattern. This idea leads to iterative search algorithms where the database is searched repeatedly, each time updating the query pattern with some or all of the newly identified sequences. Psi-Blast [101] is a very successful implementation of this idea. It starts with a single... [Pg.67]

Kundel, H. S., and LafoUette, B. S. (1972), Visual Search Patterns and Experience with Radiologiceil Images, Radiology, Vol. 103, pp. 523-528. [Pg.1918]

Fig. 7.4. Typical example of a search pattern generated by a mammographer searching a hreast image for lesions. Each small circle/dot represents a fixation or where high-resolution foveal gaze is directed. The lines represent saccades or jumps the eye makes between fixations and indicates the order in which the fixations were generated... Fig. 7.4. Typical example of a search pattern generated by a mammographer searching a hreast image for lesions. Each small circle/dot represents a fixation or where high-resolution foveal gaze is directed. The lines represent saccades or jumps the eye makes between fixations and indicates the order in which the fixations were generated...
Carry out MALDI-TOF MS analyses of spotted peptide solutions on a Proteome-Analyzer 4700 (Applied Biosystems). The spectra are recorded in a reflector mode in a mass range from 900 to 3700 Da. For one main spectrum, 25 subspectra with 100 spots per subspectrum are accumulated using a random search pattern. If the autolytical fragment of trypsin with the monoisotopic (M+H)+ m/z at 2211.104 reaches a signal-to-noise ratio (S/N) of at least 10, an internal calibration is automatically performed using the peak for one point calibration. The peptide search tolerance is 50 ppm, but the actual standard deviation is between 10 and 20 ppm. [Pg.39]


See other pages where Pattern search is mentioned: [Pg.176]    [Pg.39]    [Pg.649]    [Pg.95]    [Pg.95]    [Pg.96]    [Pg.98]    [Pg.99]    [Pg.280]    [Pg.226]    [Pg.146]    [Pg.222]    [Pg.222]    [Pg.68]    [Pg.105]    [Pg.106]    [Pg.159]    [Pg.239]    [Pg.1894]    [Pg.114]    [Pg.118]    [Pg.119]    [Pg.105]    [Pg.40]    [Pg.328]    [Pg.428]    [Pg.428]    [Pg.445]    [Pg.94]    [Pg.95]    [Pg.97]   
See also in sourсe #XX -- [ Pg.102 ]




SEARCH



Pattern search method

Pharmacophoric pattern search

Pharmacophoric pattern searching

Searches, pattern-based

Searching of Multiple Three-Dimensional Pharmacophoric Patterns

Searching, Protein Patterns

© 2024 chempedia.info