Big Chemical Encyclopedia

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

Articles Figures Tables About

Identification Algorithm for

Bradbury S, Kamenska V, Schmieder PK, Ankley G, Mekenyan O. A computationally based identification algorithm for estrogen receptor ligands Part 1. Predicting hERalpha binding affinity. Toxicol Sci 2000 58 253-69. [Pg.177]

Mekenyan O, Nikolova N, Karabunarliev S, Bradbury S, Ankley G, Hansen, B. New developments in a hazard identification algorithm for hormone receptor ligands. Quant Struct-Act Rel 1999 18 139-53. [Pg.342]

Sato, T. and Takei, K. Real time robust identification algorithm for structural systems with time-varying dynamic characteristics. In Proceedings ofSPIE 4th Annual Symposium on Smart Structures and Materials (Bellingham, WA, 1997), pp. 393 04. [Pg.287]

The comprehensive identification algorithm for product-ion scans discriminates each lipid by matching the predicted fragmentation pattern stored in the database. [Pg.138]

In section Structural Parametric Identification by Extended Kalman Filter, online structural parametric identification using the EKF will be briefly reviewed. In section Online Identification of Noise Parameters, an online identification algorithm for the noise parameters in the EKF is introduced. Then, in section Outlier-Resistant Extended Kalman Filter, an online outlier detection algorithm is presented, and it is embedded into the EKF. This algorithm allows for robust structural identification in the presence of possible outliers. In section Online Bayesian Model Class Selection, a recursive Bayesian model class section method is presented for non-parametric identification problems. [Pg.22]

The EKF has by far been the most extensively used identification algorithm, for the case of nonlinear systems, over the past 30 years, and has been applied for a number of civil engineering applications, such as structural damage identification, parameter identification of inelastic structures, and so forth. It is based on the propagation of a Gaussian random variable (GRV) through the first-order linearization of the state-space model of the system. Despite... [Pg.1677]

S. E. Stein, D. R. Scott,/. Am. Soc. Mass Spectrom. 1994, 5, 856-866. Optimization and testing of mass spectral library seardi algorithms for compound identification. [Pg.540]

N4SID = numerical algorithms for subspace state space system identification t = time [sec]... [Pg.699]

The complete algorithm for the identification of White Knights is as follows ... [Pg.69]

Jarman, K. H. Cebula, S. T. Saenz, A. J. Peterson, C. E. Valentive, N. B. Kingsley, M. T. Wahl, K. L. An algorithm for automated bacterial identification using matrix-assisted laser desorption/ionization mass spectrometry. Anal. Chem. 2000, 72, 1217-1223. [Pg.122]

A typical MALDI spectrum of a bacterial sample has a number of peaks that vary greatly in intensity superimposed on a relatively noisy baseline. This can be problematic for many peak detection routines. Therefore methods that eliminate the need for peak detection also eliminate problems associated with poor peak detection performance. Full-spectrum identification algorithms use the (usually smoothed) spectral data without first performing peak detection. [Pg.155]

In developing algorithms for automated identification of bacterial samples using MALDI MS, it is important to consider only those reproducible peaks... [Pg.157]

Demirev, P. A. Lin, J. S. Pineda, F. J. Fenselau, C. Bioinformatics and mass spectrometry for microorganism identification Proteome-wide post-translational modifications and database search algorithms for characterization of intact H. Pylori. Anal. Chem. 2001, 73, 4566 573. [Pg.275]

We are developing an expert system to automate the first step of this process, the interpretation of molecular spectra and identification of substructures present in the molecule. The automatic interpretation of spectra would by itself provide a useful tool for an organic chemist who may not be an expert spectroscopist. Also, reported algorithms for the assembly of candidate structures from known substructures, such as the GENOA program. (3-6) rely on the input of accurate and specific substructures in order to function correctly and efficiently. Identification of substructures is thus a logical starting point. [Pg.351]

KaKdas Y, Chandra N (2008) PocketDepth a new depth based algorithm for identification of ligand binding sites in proteins. J Struct Biol 161 31-42... [Pg.162]

The calponin homology (CH) domain has been identified in many molecules of differing function. However, its presence usually signifies an interaction of some sort with the actin cytoskeleton via an association with F-actin. The domain was initially identified as a 100-residue motif found at the N-terminus of the smooth muscle regulatory protein calponin and, hence, was termed the CH domain (Castresana and Saraste, 1995). The refinement of algorithms for the identification of distinct protein motifs has allowed the identification of CH domains in proteins that range... [Pg.221]


See other pages where Identification Algorithm for is mentioned: [Pg.214]    [Pg.685]    [Pg.689]    [Pg.214]    [Pg.685]    [Pg.689]    [Pg.40]    [Pg.735]    [Pg.24]    [Pg.294]    [Pg.271]    [Pg.83]    [Pg.316]    [Pg.158]    [Pg.158]    [Pg.94]    [Pg.87]    [Pg.220]    [Pg.22]    [Pg.156]    [Pg.228]    [Pg.383]    [Pg.217]    [Pg.436]    [Pg.213]    [Pg.1322]    [Pg.374]    [Pg.357]    [Pg.300]   
See also in sourсe #XX -- [ Pg.137 , Pg.139 ]




SEARCH



Algorithm for

© 2024 chempedia.info