Chemical Substructure Search Research Articles

Open-Source Approach to GPU-Accelerated Substructure Search.

Chemical substructure search is a critical task in medicinal chemistry and small-molecule drug discovery, enabling the retrieval of molecules from databases based on specific chemical features. While systems exist for this purpose, the challenge of efficient and swift searching persists, particularly as data storage migrates to the cloud, introducing new complexities. This study provides a comprehensive analysis of chemical substructure searches, showcasing the benefits of graphics processing unit-accelerated fingerprint screening. The research highlights strategies for optimizing performance, making significant advancements in substructure searching, a pivotal aspect of drug discovery and molecular research. The accessible and scalable nature of the proposed approach makes it a valuable resource for scientists aiming to enhance their substructure search capabilities.

Trends in Medicinal Chemistry: KNIME Workflows, QSAR Models, LLMs and Chemical Search Strategies

Through a lens encompassing KNIME workflows, QSAR models, LLMs, and chemical substructure search strategies, the article navigates the essential considerations driving innovation and progress in industrial cheminformatics for medicinal chemistry and drug discovery.

Ligandbook: an online repository for small and drug-like molecule force field parameters

SummaryLigandbook is a public database and archive for force field parameters of small and drug-like molecules. It is a repository for parameter sets that are part of published work but are not easily available to the community otherwise. Parameter sets can be downloaded and immediately used in molecular dynamics simulations. The sets of parameters are versioned with full histories and carry unique identifiers to facilitate reproducible research. Text-based search on rich metadata and chemical substructure search allow precise identification of desired compounds or functional groups. Ligandbook enables the rapid set up of reproducible molecular dynamics simulations of ligands and protein-ligand complexes.Availability and ImplementationLigandbook is available online at https://ligandbook.org and supports all modern browsers. Parameters can be searched and downloaded without registration, including access through a programmatic RESTful API. Deposition of files requires free user registration. Ligandbook is implemented in the PHP Symfony2 framework with TCL scripts using the CACTVS toolkit.Supplementary information Supplementary data are available at Bioinformatics online.

Chemical Structure Similarity Search for Ligand-based Virtual Screening: Methods and Computational Resources.

For many years the assumption that "Chemical compounds with similar structures may have similar activities" has been a foundation for lead identification. The similarity can be computed based upon topological, steric, electronic, and/or physical properties. The chemical structure similarity search differs from the chemical substructure search in that the former requires assessment of the properties of each compound and thus no filter can be applied for skipping structures before they are assessed to accelerate the computation. The latter can be accelerated by pre-screening compounds and omitting those that miss one (or more) specified fragments from the query. Moreover, three-dimensional similarity search requires superimposing many conformation pairs for each compound in the library. This makes 3-D similarity search algorithms time-consuming, and in general requires high performance computing (HPC) resources. This review will summarize recent progress in the techniques for HPC-supported two and three-dimensional chemical structure similarity search algorithms, and their applications in ligand-based virtual screening.

HMDB 3.0—The Human Metabolome Database in 2013

The Human Metabolome Database (HMDB) (www.hmdb.ca) is a resource dedicated to providing scientists with the most current and comprehensive coverage of the human metabolome. Since its first release in 2007, the HMDB has been used to facilitate research for nearly 1000 published studies in metabolomics, clinical biochemistry and systems biology. The most recent release of HMDB (version 3.0) has been significantly expanded and enhanced over the 2009 release (version 2.0). In particular, the number of annotated metabolite entries has grown from 6500 to more than 40 000 (a 600% increase). This enormous expansion is a result of the inclusion of both ‘detected’ metabolites (those with measured concentrations or experimental confirmation of their existence) and ‘expected’ metabolites (those for which biochemical pathways are known or human intake/exposure is frequent but the compound has yet to be detected in the body). The latest release also has greatly increased the number of metabolites with biofluid or tissue concentration data, the number of compounds with reference spectra and the number of data fields per entry. In addition to this expansion in data quantity, new database visualization tools and new data content have been added or enhanced. These include better spectral viewing tools, more powerful chemical substructure searches, an improved chemical taxonomy and better, more interactive pathway maps. This article describes these enhancements to the HMDB, which was previously featured in the 2009 NAR Database Issue. (Note to referees, HMDB 3.0 will go live on 18 September 2012.).

SIMCOMP/SUBCOMP: chemical structure search servers for network analyses

One of the greatest challenges in bioinformatics is to shed light on the relationship between genomic and chemical significances of metabolic pathways. Here, we demonstrate two types of chemical structure search servers: SIMCOMP (http://www.genome.jp/tools/simcomp/) for the chemical similarity search and SUBCOMP (http://www.genome.jp/tools/subcomp/) for the chemical substructure search, where both servers provide links to the KEGG PATHWAY and BRITE databases. The SIMCOMP is a graph-based method for searching the maximal common subgraph isomorphism by finding the maximal cliques in the association graph. In contrast, the SUBCOMP is an extended method for solving the subgraph isomorphism problem. The obtained links to PATHWAY or BRITE databases can be used to interpret as the biological meanings of chemical structures from the viewpoint of the various biological functions including metabolic networks.

Chemical Substructure Search in SQL

We present a novel technique for a fast chemical substructure search on a relational database by use of a standard SQL query. The symmetry of a query graph is analyzed to give additional constraints. Our method is based on breadth-first search (BFS) algorithms implementation using Relational Database Management Systems (RDBMS). In addition to the chemical search we apply our technique to the field of intermolecular interactions which involves nonplanar graphs and describe how to achieve linear time performance along with the suggestion on how to sufficiently reduce the linear coefficient. From the algorithms theory perspective these results mean that subgraph isomorphism is a polynomial time problem, hence equal problems have the same complexity. The application to subgraph isomorphism in chemical search is available at http://www.ebi.ac.uk/msd-srv/chemsearch and http://www.ebi.ac.uk/msd-srv/msdmotif/chem . The application to the network of molecule interactions is available at http://www.ebi.ac.uk/msd-srv/msdmotif .

HMDB: a knowledgebase for the human metabolome

The Human Metabolome Database (HMDB, http://www.hmdb.ca) is a richly annotated resource that is designed to address the broad needs of biochemists, clinical chemists, physicians, medical geneticists, nutritionists and members of the metabolomics community. Since its first release in 2007, the HMDB has been used to facilitate the research for nearly 100 published studies in metabolomics, clinical biochemistry and systems biology. The most recent release of HMDB (version 2.0) has been significantly expanded and enhanced over the previous release (version 1.0). In particular, the number of fully annotated metabolite entries has grown from 2180 to more than 6800 (a 300% increase), while the number of metabolites with biofluid or tissue concentration data has grown by a factor of five (from 883 to 4413). Similarly, the number of purified compounds with reference to NMR, LC-MS and GC-MS spectra has more than doubled (from 380 to more than 790 compounds). In addition to this significant expansion in database size, many new database searching tools and new data content has been added or enhanced. These include better algorithms for spectral searching and matching, more powerful chemical substructure searches, faster text searching software, as well as dedicated pathway searching tools and customized, clickable metabolic maps. Changes to the user-interface have also been implemented to accommodate future expansion and to make database navigation much easier. These improvements should make the HMDB much more useful to a much wider community of users.

Validation of metabolic pathway databases based on chemical substructure search

Metabolic pathway databases such as KEGG contain information on thousands of biochemical reactions drawn from the biomedical literature. Ensuring consistency of such large metabolic pathways is essential to their proper use. In this paper, we present a new method to determine consistency of an important class of biochemical reactions. Our method exploits the knowledge of the atomic rearrangement pattern in biochemical reactions, to reduce the automatic atom mapping problem to a series of chemical substructure searches between the substrate and the product of a biochemical reaction. As an illustrative application, we describe the exhaustive validation of a substantial portion from the latest release of the KEGG LIGAND database.

Ligand Depot: a data warehouse for ligands bound to macromolecules

Ligand Depot is an integrated data resource for finding information about small molecules bound to proteins and nucleic acids. The initial release (version 1.0, November, 2003) focuses on providing chemical and structural information for small molecules found as part of the structures deposited in the Protein Data Bank. Ligand Depot accepts keyword-based queries and also provides a graphical interface for performing chemical substructure searches. A wide variety of web resources that contain information on small molecules may also be accessed through Ligand Depot. Ligand Depot is available at http://ligand-depot.rutgers.edu/. Version 1.0 supports multiple operating systems including Windows, Unix, Linux and the Macintosh operating system. The current drawing tool works in Internet Explorer, Netscape and Mozilla on Windows, Unix and Linux.

BRENDA, the enzyme database: updates and major new developments.

BRENDA (BRaunschweig ENzyme DAtabase) represents a comprehensive collection of enzyme and metabolic information, based on primary literature. The database contains data from at least 83,000 different enzymes from 9800 different organisms, classified in approximately 4200 EC numbers. BRENDA includes biochemical and molecular information on classification and nomenclature, reaction and specificity, functional parameters, occurrence, enzyme structure, application, engineering, stability, disease, isolation and preparation, links and literature references. The data are extracted and evaluated from approximately 46,000 references, which are linked to PubMed as long as the reference is cited in PubMed. In the past year BRENDA has undergone major changes including a large increase in updating speed with >50% of all data updated in 2002 or in the first half of 2003, the development of a new EC-tree browser, a taxonomy-tree browser, a chemical substructure search engine for ligand structure, the development of controlled vocabulary, an ontology for some information fields and a thesaurus for ligand names. The database is accessible free of charge to the academic community at http://www.brenda. uni-koeln.de.

Computer storage and retrieval of generic chemical structures in patents. 7. Parallel simulation of a relaxation algorithm for chemical substructure search

Computer storage and retrieval of generic chemical structures in patents. 7. Parallel simulation of a relaxation algorithm for chemical substructure search

Rapid subgraph search using parallelism.

A new parallel processing algorithm is reported for subgraph matching. Parallelism is achieved for the first time within the process of node-by-node matching of two individual graphs. A SIMULA program is described for simulating this parallel subgraph search algorithm. Simulation results from a series of chemical substructure search problems show an average utilization of 84% on a 25-processor machine and up to a 24-fold speed enhancement over a single processor. Potential applications include starting material selections for synthesis as well as general substructure search problems.

Private files—a critical assessment

This paper discusses—from a European point of view—the likely arguments in favour of, and in opposition to, the use of private file services currently offered by online information-retrieval vendors and computer companies. After reviewing the nature of private file applications and users, the autho r deals at some length with the question of costs—for storage and connect time, and for telecommunication. Costs are compared for a standard case, based on one month's library usage of a private file on four different hosts: Data Star, IRS-ESA, Lockheed Dialog, and Questel. After then discussing the factor of usage level in cost determination, and some criteria for deciding whether or not to enter upon a private file arrangement, the author describes in particular the chemical substructure search systems of CAS and Questel (DARC) in terms of their private file offerings, and then considers the question of data confidentiality. There follows an account of the steps which one should take before implementing a private file in regard to record structure and format, as well as file loading and updating, and of the considerations involved in deciding whether or not to make use of a private file service.

Sampling Consideration in the Selection of Fragment Screens for Chemical Substructure Search Systems

Sampling Consideration in the Selection of Fragment Screens for Chemical Substructure Search Systems

Distribution of Fragment Representations in a Chemical Substructure Search Screening System

ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTDistribution of Fragment Representations in a Chemical Substructure Search Screening SystemGeorge W. Adamson, Verity A. Clinch, Susan E. Creasey, and Michael F. LynchCite this: J. Chem. Doc. 1974, 14, 2, 72–74Publication Date (Print):May 1, 1974Publication History Published online1 May 2002Published inissue 1 May 1974https://doi.org/10.1021/c160053a006RIGHTS & PERMISSIONSArticle Views34Altmetric-Citations3LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InReddit PDF (339 KB) Get e-Alerts

Conversion of the IUPAC notation into a form for computer processing

Computer operations with an extensive file of compounds ciphered in the IUPAC notation, involving chemical substructure searches, cipher fragmentation, and the development of atom connectivity tables, have pointed to the desirability of a form of the notation which is more suitable for direct computer processing than is the form as written according to the rules. A computer program has been written to produce such a version by elimination of upper and lower case symbols, introduction of certain hitherto unused characters, and minor re-arrangements in the order of character citation.