Evaluation of a (1)h-(13)c NMR spectral library

The centroidal algorithm in molecular similarity and diversity calculations on confidential datasets

Chemical structure provides exhaustive description of a compound, but it is often proprietary and thus an impediment in the exchange of information. For example, structure disclosure is often needed for the selection of most similar or dissimilar compounds. Authors propose a centroidal algorithm based on structural fragments (screens) that can be efficiently used for the similarity and diversity selections without disclosing structures from the reference set. For an increased security purposes, authors recommend that such set contains at least some tens of structures. Analysis of reverse engineering feasibility showed that the problem difficulty grows with decrease of the screen's radius. The algorithm is illustrated with concrete calculations on known steroidal, quinoline, and quinazoline drugs. We also investigate a problem of scaffold identification in combinatorial library dataset. The results show that relatively small screens of radius equal to 2 bond lengths perform well in the similarity sorting, while radius 4 screens yield better results in diversity sorting. The software implementation of the algorithm taking SDF file with a reference set generates screens of various radii which are subsequently used for the similarity and diversity sorting of external SDFs. Since the reverse engineering of the reference set molecules from their screens has the same difficulty as the RSA asymmetric encryption algorithm, generated screens can be stored openly without further encryption. This approach ensures an end user transfers only a set of structural fragments and no other data. Like other algorithms of encryption, the centroid algorithm cannot give 100% guarantee of protecting a chemical structure from dataset, but probability of initial structure identification is very small-order of 10(-40) in typical cases.

Spectral code index (SPECOIND): a general infrared spectral database search method

A new spectral code that can be used by Relational Database Management Systems (RDBMS) as an index for infrared (IR) spectra searches in Relational Database (RDB) is presented and its suitability is evaluated. Spectral codes are constructed for all spectra in the database as the spectral indexes and three query strings are created with the same theory used for the creation of the index code for the query spectrum. Some effects of parameters used to create index strings and query strings are discussed. All spectral searches are accomplished in structured query language (SQL) approach and the utilization examples of SQL have been shown. The sequential application of this procedure can reduce the original library of about 18000 spectra to a few spectra that can be used as references for subsequent detailed comparison. The software developed for the proposed system is particularly suitable for spectral search and structure interpretation.