Big Chemical Encyclopedia

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

Articles Figures Tables About

Searches, pattern-based

Another approach to the relationship between electronic structure and catalysis has been the search for catalytic activity patterns based on electron configuration and semiconductor type. The first of these patterns to be established was in nitrous oxide decomposition (69-71), as illustrated in Fig. 8. This series, with one or two exceptions, divides remarkably into... [Pg.32]

When experimental data remain unidentified using a digitized pattern-based search-match, different databases should be checked before drawing a conclusion that a material is new. Continuing searches, however, usually require unit cell dimensions and therefore, a powder pattern should be indexed prior to the search. There are a variety of databases dedicated to different classes of compounds and containing different information as shown in Table 4.3. ... [Pg.376]

Recently the ICDD Powder Diffraction File underwent a substantial and useful upgrade calculated patterns based on single crystal data from the ICSD file have been included into the PDF-2/PDF-4 Full File calculated patterns of structures stored in the CSD file, have been included into the PDF-4 Organics (see Table 4.3). These additions make it possible to conduct searches and find matches with computed digitized powder patterns in addition to experimentally measured powder diffraction data, thus improving automation, simplifying phase identification process and considerably expanding the applicability of the powder method for a qualitative phase analysis. [Pg.376]

Search engines can be classified in three main groups (i) sequence search engines (reviewed in Ref. (61)), which try to match experimental spectra with theoretical in silico spectra (ii) search engines based on spectral libraries (assessed in Ref. (62)), which attempt to match spectra with a library of previously observed and identified spectra and (iii) de novo search engines (revised in Ref. (63)), which attempt to derive peptide identifications based on the MS/MS spectrum peak patterns. [Pg.397]

Patterns and other characteristics of RDF descriptors that seem to indicate unique features are not easy to determine. However, compiled carefully they are helpful tools for a quick recognition of substructures. A pattern search algorithm based on binary pattern descriptors can then be used for substructure search. [Pg.131]

Descriptors based on pattern functions are helpful tools for a quick recognition of substructures. A pattern-search algorithm based on binary pattern descriptors can then be used for substructure search. However, patterns and other characteristics of descriptors that seem to indicate unique features should be investigated carefully. With these descriptors 3D similarity searches for complete structures or substructures in large databases are possible and computationally very efficient. In addition, descriptors can serve as the basis for a measure for the diversity of compounds in large data sets, a topic that is of high interest in combinatorial chemistry. [Pg.162]

Data mining is an extension to linear searches, mainly based on pattern recognition in a large data set, and is of particular interest in combination with expert systems capabilities in scientific areas. [Pg.293]

Recursive dynamic programming (RDP) Another heuristic search procedure based on a branch-and-bound approach has been described in [188]. The approach tries to avoid the restrictions implied by a predefined structural core. Even if the structural core is correctly and completely defined, even the best alignment of the query sequence onto the structure core can be based on information of about half or less of the residues and structural positions of the template structure. Often, structures contain highly conserved loop regions, which if responsible for conserved functions (e.g. ATP binding loops [170]) are also conserved on the sequence level or contain detectable sequence motifs or functional patterns. Such loops can provide important initial hints on similarities and partial alignments exploitable for the assembly of overall alignments. [Pg.285]

The lower terrestrial Xe/Kr ratio has since usually been considered a feature of the Earth (see, however, Ozima and Podosek 1999 and Rayleigh distillation section below). Although relative abundances in chondrites were historically called the planetary pattern based on similarities with the Earth s atmosphere, and this in turn drove the search for the missing Xe , it is now clear that these trapped meteoritic gases do not have such direct relevance to the planets, and so are no longer properly termed planetary . However, the reason why the Earth does not exhibit a systematic depletion pattern relative to solar gases (Fig. 2) still requires explanation. [Pg.193]

Isotope pattern-searching algorithm based MS-analysis... [Pg.46]

Figures 5 and 6 demonstrate that even if structures have the same number of atoms, their INBS curves look very different. Figure 5 compares the curves of three structures which have 11 atoms Figure 6 compares the curves from three 22-atom structures. It would appear that the use of INBS frequencies may prove to be of use in a pattern-based similarity search. We report below a series of preliminary experiments where INBS frequencies were used to describe query structures in a similarity search. Figures 5 and 6 demonstrate that even if structures have the same number of atoms, their INBS curves look very different. Figure 5 compares the curves of three structures which have 11 atoms Figure 6 compares the curves from three 22-atom structures. It would appear that the use of INBS frequencies may prove to be of use in a pattern-based similarity search. We report below a series of preliminary experiments where INBS frequencies were used to describe query structures in a similarity search.
Tanimoto measure . The adoption of bit-encoded information led to the use of association coefficients for comparison of equal-length bit-vectors. In the case of our pattern-based similarity search, it is not the presence or absence of a feature that is being compared, but its frequency of occurrence. Discussions of the different types of similarity measures available for numerical, rather than binary, data can be found in books by Willett and Everitt. From these we chose to test the frequency Tanimoto coefficient and the Minkowski metric ... [Pg.367]

The pattern-based searches which have been tested so far are ... [Pg.368]

One of the earliest applications of techniques of artificial intelligence (a term used here in its broadest sense) in decisionmaking was the reduction of spectral data to their structural implications, information that is usually expressed in terms of substructures predicted to be present or absent in the unknown. The actual techniques used generally fall into one of three classes library search, pattern recognition, and knowledge-based systems. However, the boundaries between these classes are not sharp. Regardless of the technique selected, it is important that the spectral data should be diagnostic for the type of structural features the user needs to identify. [Pg.2790]

Continuing the search for periodic patterns based on similarity measures, as introduced in Sect. 9.7 and motivated by the results obtained in an information theoretical framework in Sect. 9.9.1, we will now combine the ideas from both efforts and construct an information theoretical similarity measure. [Pg.167]

The two basic parameters being used in this search/ match process are the d values calculated from the measured 29 values in the diflf actogram and the relative intensities of the lines in the pattern. Whereas the d value can be accurately measured (with an accuracy of better than 0.5% in routine analysis), the intensities are rather unreliable by comparison and can be subject to error, sometimes running into tens of percent. Because of the unreliable nature of the measured intensities, any search procedure based on the selection of lines by their intensities must be used with caution. [Pg.579]

It may not be possible to develop a mathematical model for the fourth problem it not enough is known to characterize the performance of a rod versus the amounts of the various ingredients used in its manufacture. The rods may have to be manufactured and judged by ranking the rods relative to each other, perhaps based partially or totally on opinions. Pattern search methods have been devised to attack problems in this class. [Pg.483]

Because the breadth of chemical behavior can be bewildering in its complexity, chemists search for general ways to organize chemical reactivity patterns. Two familiar patterns are Br< )nsted acid-base (proton transfer) and oxidation-reduction (electron transfer) reactions. A related pattern of reactivity can be viewed as the donation of a pair of electrons to form a new bond. One example is the reaction between gaseous ammonia and trimethyl boron, in which the ammonia molecule uses its nonbonding pair of electrons to form a bond between nitrogen and boron ... [Pg.1499]

Each atom in the lattice acts as a scattering centre, which means that the total intensity of the diffracted beam in a given direction depends on the extent to which contributions from individual atoms are in phase. Relating the underlying structure to the observed diffraction pattern is not straightforward, but is essentially a trial-and-error search involving extensive computer-based calculations. [Pg.368]


See other pages where Searches, pattern-based is mentioned: [Pg.51]    [Pg.166]    [Pg.39]    [Pg.206]    [Pg.17]    [Pg.113]    [Pg.157]    [Pg.135]    [Pg.106]    [Pg.94]    [Pg.66]    [Pg.149]    [Pg.2810]    [Pg.2867]    [Pg.578]    [Pg.131]    [Pg.531]    [Pg.531]    [Pg.2]    [Pg.116]    [Pg.5]    [Pg.74]    [Pg.195]    [Pg.387]    [Pg.387]    [Pg.35]    [Pg.825]    [Pg.187]    [Pg.417]    [Pg.1005]   
See also in sourсe #XX -- [ Pg.368 ]




SEARCH



Search pattern

© 2024 chempedia.info