Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm.     

SKATE: A docking program that decouples systematic sampling from scoring

SKATE is a docking prototype that decouples systematic sampling from scoring. This novel approach removes any interdependence between sampling and scoring functions to achieve better sampling and, thus, improves docking accuracy. SKATE systematically samples a ligand's conformational, rotational and translational degrees of freedom, as constrained by a receptor pocket, to find sterically allowed poses. Efficient systematic sampling is achieved by pruning the combinatorial tree using aggregate assembly, discriminant analysis, adaptive sampling, radial sampling, and clustering. Because systematic sampling is decoupled from scoring, the poses generated by SKATE can be ranked by any published, or in‐house, scoring function. To test the performance of SKATE, ligands from the Asetex/CDCC set, the Surflex set, and the Vertex set, a total of 266 complexes, were redocked to their respective receptors. The results show that SKATE was able to sample poses within 2 Å RMSD of the native structure for 98, 95, and 98% of the cases in the Astex/CDCC, Surflex, and Vertex sets, respectively. Cross‐docking accuracy of SKATE was also assessed by docking 10 ligands to thymidine kinase and 73 ligands to cyclin‐dependent kinase. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010     

Levy Constrained Search in Fock Space: An Alternative Approach to Noninteger Electron NumberSCI北大核心CSCD

By extending the Levy wavefunction constrained search to Fock Space,one can define a wavefunction constrained search for electron densities in systems having noninteger number of electrons.For pure-state v-representable densities,the results are equivalent to what one would obtain with the zero-temperature grand canonical ensemble.In other cases,the wavefunction constrained search in Fock space presents an upper bound to the grand canonical ensemble functional.One advantage of the Fock-space wavefunction constrained search functional over the zero-temperature grand-canonical ensemble constrained search functional is that certain specific excited states(i.e.,those that are not ground-statev-representable) are the stationary points of the Fock-space functional.However,a potential disadvantage of the Fock-space constrained search functional is that it is not convex.     

Local elevation: A method for improving the searching properties of molecular dynamics simulation

Summary The concept of memory has been introduced into a molecular dynamics algorithm. This was done so as to persuade a molecular system to visit new areas of conformational space rather than be confined to a small number of low-energy regions. The method is demonstrated on a simple model system and the 11-residue cyclic peptide cyclosporin A. For comparison, calculations were also performed using simulated temperature annealing and a potential energy annealing scheme. Although the method can only be applied to systems with a small number of degrees of freedom, it offers the chance to generate a multitude of different low-energy structures, where other methods only give a single one or few. This is clearly important in problems such as drug design, where one is interested in the conformational spread of a system.     

A novel approach for protein identification from complex cell proteome using modified peptide mass fingerprinting algorithm

A unique peptide based search algorithm for identification of protein mixture using PMF is proposed. The proposed search algorithm utilizes binary search and heapsort programs to generate frequency chart depicting the unique peptides corresponding to all proteins in a proteome. The use of binary search program significantly reduces the time for frequency chart preparation to ～2 s for a proteome comprising ～23 000 proteins. The algorithm was applied to a three‐protein mixture identification, host cell protein (HCP) analysis, and a simulation‐generated data set. It was found that the algorithm could identify at least one unique peptide of a protein even in the presence of fourfold higher concentration of another protein. In addition, two HCPs that are known to be difficult to remove were missed by MS/MS approach and were exclusively identified using the presented algorithm. Thus, the proposed algorithm when used along with standard proteomic approaches present avenues for enhanced protein identification efficiency, particularly for applications such as HCP analysis in biopharmaceutical research, where identification of low‐abundance proteins are generally not achieved due to dynamic range limitations between the target product and HCPs.     

Precise and global identification of phospholipid molecular species by an Orbitrap mass spectrometer and automated search engine Lipid Search

In the present research, we have established a new lipidomics approach for the comprehensive and precise identification of molecular species in a crude lipid mixture using a LTQ Orbitrap mass spectrometer (MS) and reverse-phase liquid chromatography (RPLC) combination with our newly developed lipid search engine “Lipid Search”. LTQ Orbitrap provides high mass accuracy MS spectra by Fourier-transform (FT) mass spectrometer mode and can perform rapid MSⁿ by ion trap (IT) mass spectrometer mode. In this study, the negative ion mode was selected to detect fragment ions from phospholipids, such as fatty acid anions, by MS2 or MS3. We selected the specific detection approach by neutral loss survey-dependent MS3, for the identification of molecular species of phosphatidylcholine, sphingomyelin and phosphatidylserine. Identification of molecular species was performed by using both the high mass accuracy of the mass spectrometric data obtained from FT mode and structural data obtained from fragments in IT mode. Some alkylacyl and alkenylacyl species have the same m/z value as molecular-related ions and fragment ions, thus, direct acid hydrolysis analysis was performed to identify alkylacyl and alkenylacyl species, and then the RPLC–LTQ Orbitrap method was applied. As a result, 290 species from mouse liver and 248 species from mouse brain were identified within six different classes of phospholipid, only those in manually detected and confirmed. Most of all manually detected mass peaks were also automatically detected by “Lipid Search”. Adding to differences in molecular species in different classes of phospholipids, many characteristic differences in molecular species were detected in mouse liver and brain. More variable number of saturated and monounsaturated fatty acid-containing molecular species were detected in mouse brain than liver.     

Conformational analysis of methylphenidate: comparison of molecular orbital and molecular mechanics methods

Summary Methylphenidate (MP) binds to the cocaine binding site on the dopamine transporter and inhibits reuptake of dopamine, but does not appear to have the same abuse potential as cocaine. This study, part of a comprehensive effort to identify a drug treatment for cocaine abuse, investigates the effect of choice of calculation technique and of solvent model on the conformational potential energy surface (PES) of MP and a rigid methylphenidate (RMP) analogue which exhibits the same dopamine transporter binding affinity as MP. Conformational analysis was carried out by the AM1 and AM1/SM5.4 semiempirical molecular orbital methods, a molecular mechanics method (Tripos force field with the dielectric set equal to that of vacuum or water) and the HF/6-31G* molecular orbital method in vacuum phase. Although all three methods differ somewhat in the local details of the PES, the general trends are the same for neutral and protonated MP. In vacuum phase, protonation has a distinctive effect in decreasing the regions of space available to the local conformational minima. Solvent has little effect on the PES of the neutral molecule and tends to stabilize the protonated species. The random search (RS) conformational analysis technique using the Tripos force field was found to be capable of locating the minima found by the molecular orbital methods using systematic grid search. This suggests that the RS/Tripos force field/vacuum phase protocol is a reasonable choice for locating the local minima of MP. However, the Tripos force field gave significantly larger phenyl ring rotational barriers than the molecular orbital methods for MP and RMP. For both the neutral and protonated cases, all three methods found the phenyl ring rotational barriers for the RMP conformers/invertamers (denoted as cte, tte, and cta) to be: cte, tte> MP > cta. Solvation has negligible effect on the phenyl ring rotational barrier of RMP. The B3LYP/6-31G* density functional method was used to calculate the phenyl ring rotational barrier for neutral MP and gave results very similar to those of the HF/6-31G* method.     

Batch tautomer generation with MolTPC

Besides all their conformational degrees of freedom, drug‐like molecules and natural products often also undergo tautomeric interconversions. Compared to the huge efforts made in experimental investigation of tautomerism, open and free algorithmic solutions for prototropic tautomer generation are surprisingly rare. The few freely available software packages limit their output to a subset of the possible configurational space by sometimes unwanted prior assumptions and complete neglection of ring‐chain tautomerism. Here, we describe an adjustable fully automatic tautomer enumeration approach, which is freely available and also incorporates the detection of ring‐chain variants. The algorithm is implemented in the MolTPC framework and accessible on SourceForge. © 2013 Wiley Periodicals, Inc.     

Testing an alternative search algorithm for compound identification with the ‘Wiley Registry of Tandem Mass Spectral Data,MSforID’

A tandem mass spectral database system consists of a library of reference spectra and a search program. State‐of‐the‐art search programs show a high tolerance for variability in compound‐specific fragmentation patterns produced by collision‐induced decomposition and enable sensitive and specific ‘identity search’. In this communication, performance characteristics of two search algorithms combined with the ‘Wiley Registry of Tandem Mass Spectral Data, MSforID’ (Wiley Registry MSMS, John Wiley and Sons, Hoboken, NJ, USA) were evaluated. The search algorithms tested were the MSMS search algorithm implemented in the NIST MS Search program 2.0g (NIST, Gaithersburg, MD, USA) and the MSforID algorithm (John Wiley and Sons, Hoboken, NJ, USA). Sample spectra were acquired on different instruments and, thus, covered a broad range of possible experimental conditions or were generated in silico. For each algorithm, more than 30 000 matches were performed. Statistical evaluation of the library search results revealed that principally both search algorithms can be combined with the Wiley Registry MSMS to create a reliable identification tool. It appears, however, that a higher degree of spectral similarity is necessary to obtain a correct match with the NIST MS Search program. This characteristic of the NIST MS Search program has a positive effect on specificity as it helps to avoid false positive matches (type I errors), but reduces sensitivity. Thus, particularly with sample spectra acquired on instruments differing in their setup from tandem‐in‐space type fragmentation, a comparably higher number of false negative matches (type II errors) were observed by searching the Wiley Registry MSMS. Copyright © 2013 John Wiley & Sons, Ltd.     

Efficiency of random search procedures along the silicon cluster series: Si(n) (n=5-10, 15, and 20)

The efficiency of the simplest isomeric search procedure consisting in random generation of sets of atomic coordinates followed by density functional theory geometry optimization is tested on the silicon cluster series (Si(5-10, 15, 20)). Criteria such as yield, isomer distributions and recurrences are used to clearly establish the performance of the approach with respect to increasing cluster size. The elimination of unphysical candidate structures and the use of distinct box shapes and theoretical levels are also investigated. For the smaller Si(n) (n=5-10) clusters, the generation of random coordinates within a spherical box is found to offer a reasonable alternative to more complex algorithms by allowing straightforward identification of every known low-lying local minima. The simple stochastic search of larger clusters (i.e. Si(15) and Si(20)) is however complicated by the exponentially increasing number of both low- and high-lying minima leading to rather arbitrary and non-comprehensive results.