Small-World Phenomena in Chemical Library Networks: Application to Fragment-Based Drug Discovery

Towards Predictive Synthesis of Inorganic Materials Using Network Science

Accelerating materials discovery is the cornerstone of modern technological competitiveness. Yet, the inorganic synthesis of new compounds is often an important bottleneck in this quest. Well-established quantum chemistry and experimental synthesis methods combined with consolidated network science approaches might provide revolutionary knowledge to tackle this challenge. Recent pioneering studies in this direction have shown that the topological analysis of material networks hold great potential to effectively explore the synthesizability of inorganic compounds. In this Perspective we discuss the most exciting work in this area, in particular emerging new physicochemical insights and general concepts on how network science can significantly help reduce the timescales required to discover new materials and find synthetic routes for their fabrication. We also provide a perspective on outstanding problems, challenges and open questions.

Network-based Approaches in Pharmacology

In drug discovery, network-based approaches are expected to spotlight our understanding of drug action across multiple layers of information. On one hand, network pharmacology considers the drug response in the context of a cellular or phenotypic network. On the other hand, a chemical-based network is a promising alternative for characterizing the chemical space. Both can provide complementary support for the development of rational drug design and better knowledge of the mechanisms underlying the multiple actions of drugs. Recent progress in both concepts is discussed here. In addition, a network-based approach using drug-target-therapy data is introduced as an example.

Chemical space visualization: transforming multidimensional chemical spaces into similarity-based molecular networks

BACKGROUND

The concept of chemical space is of fundamental relevance for medicinal chemistry and chemical informatics. Multidimensional chemical space representations are coordinate-based. Chemical space networks (CSNs) have been introduced as a coordinate-free representation.

RESULTS

A computational approach is presented for the transformation of multidimensional chemical space into CSNs. The design of transformation CSNs (TRANS-CSNs) is based upon a similarity function that directly reflects distance relationships in original multidimensional space.

CONCLUSION

TRANS-CSNs provide an immediate visualization of coordinate-based chemical space and do not require the use of dimensionality reduction techniques. At low network density, TRANS-CSNs are readily interpretable and make it possible to evaluate structure-activity relationship information originating from multidimensional chemical space.

Impact of similarity threshold on the topology of molecular similarity networks and clustering outcomes

BACKGROUND

Complex network theory based methods and the emergence of "Big Data" have reshaped the terrain of investigating structure-activity relationships of molecules. This change gave rise to new methods which need to face an important challenge, namely: how to restructure a large molecular dataset into a network that best serves the purpose of the subsequent analyses. With special focus on network clustering, our study addresses this open question by proposing a data transformation method and a clustering framework.

RESULTS

Using the WOMBAT and PubChem MLSMR datasets we investigated the relation between varying the similarity threshold applied on the similarity matrix and the average clustering coefficient of the emerging similarity-based networks. These similarity networks were then clustered with the InfoMap algorithm. We devised a systematic method to generate so-called "pseudo-reference" clustering datasets which compensate for the lack of large-scale reference datasets. With help from the clustering framework we were able to observe the effects of varying the similarity threshold and its consequence on the average clustering coefficient and the clustering performance.

CONCLUSIONS

We observed that the average clustering coefficient versus similarity threshold function can be characterized by the presence of a peak that covers a range of similarity threshold values. This peak is preceded by a steep decline in the number of edges of the similarity network. The maximum of this peak is well aligned with the best clustering outcome. Thus, if no reference set is available, choosing the similarity threshold associated with this peak would be a near-ideal setting for the subsequent network cluster analysis. The proposed method can be used as a general approach to determine the appropriate similarity threshold to generate the similarity network of large-scale molecular datasets.

Network measures for chemical library design

In this overview, we examine recent developments in network approaches to drug design. A brief overview of networks is followed by a discussion of how chemical similarity networks and their properties address challenges in drug design. Multiple methods used to assess or enhance chemical diversity for early-stage drug discovery are discussed, as well as methods that can be used for drug repositioning and ligand polypharmacology.

Chemical space networks: a powerful new paradigm for the description of chemical space

The concept of chemical space is playing an increasingly important role in many areas of chemical research, especially medicinal chemistry and chemical biology. It is generally conceived as consisting of numerous compound clusters of varying sizes scattered throughout the space in much the same way as galaxies of stars inhabit our universe. A number of issues associated with this coordinate-based representation are discussed. Not the least of which is the continuous nature of the space, a feature not entirely compatible with the inherently discrete nature of chemical space. Cell-based representations, which are derived from coordinate-based spaces, have also been developed that facilitate a number of chemical informatic activities (e.g., diverse subset selection, filling 'diversity voids', and comparing compound collections).These representations generally suffer the 'curse of dimensionality'. In this work, networks are proposed as an attractive paradigm for representing chemical space since they circumvent many of the issues associated with coordinate- and cell-based representations, including the curse of dimensionality. In addition, their relational structure is entirely compatible with the intrinsic nature of chemical space. A description of the features of these chemical space networks is presented that emphasizes their statistical characteristics and indicates how they are related to various types of network topologies that exhibit random, scale-free, and/or 'small world' properties.

Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review

Despite considerable progress in genome- and proteome-based high-throughput screening methods and in rational drug design, the increase in approved drugs in the past decade did not match the increase of drug development costs. Network description and analysis not only give a systems-level understanding of drug action and disease complexity, but can also help to improve the efficiency of drug design. We give a comprehensive assessment of the analytical tools of network topology and dynamics. The state-of-the-art use of chemical similarity, protein structure, protein-protein interaction, signaling, genetic interaction and metabolic networks in the discovery of drug targets is summarized. We propose that network targeting follows two basic strategies. The "central hit strategy" selectively targets central nodes/edges of the flexible networks of infectious agents or cancer cells to kill them. The "network influence strategy" works against other diseases, where an efficient reconfiguration of rigid networks needs to be achieved by targeting the neighbors of central nodes/edges. It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates. We review the recent boom in network methods helping hit identification, lead selection optimizing drug efficacy, as well as minimizing side-effects and drug toxicity. Successful network-based drug development strategies are shown through the examples of infections, cancer, metabolic diseases, neurodegenerative diseases and aging. Summarizing >1200 references we suggest an optimized protocol of network-aided drug development, and provide a list of systems-level hallmarks of drug quality. Finally, we highlight network-related drug development trends helping to achieve these hallmarks by a cohesive, global approach.

Graphs and networks in chemical and biological informatics: past, present and future

Chemical and biological network analysis has recently garnered intense interest from the perspective of drug design and discovery. While graph theoretic concepts have a long history in chemistry – predating quantum mechanics – and graphical measures of chemical structures date back to the 1970s, it is only recently with the advent of public repositories of information and availability of high-throughput assays and computational resources that network analysis of large-scale chemical networks, such as protein–protein interaction networks, has become possible. Drug design and discovery are undergoing a paradigm shift, from the notion of ‘one target, one drug’ to a much more nuanced view that relies on multiple sources of information: genomic, proteomic, metabolomic and so on. This holistic view of drug design is an incredibly daunting undertaking still very much in its infancy. Here, we focus on current developments in graph- and network-centric approaches in chemical and biological informatics, with particular reference to applications in the fields of SAR modeling and drug design. Key insights from the past suggest a path forward via visualization and fusion of multiple sources of chemical network data.

Structural ensemble in computational drug screening

IMPORTANCE OF THE FIELD

Structure-based in silico drug screening is now widely used in drug development projects. Structure-based in silico drug screening is generally performed using a protein-compound docking program and docking scoring function. Many docking programs have been developed over the last 2 decades, but their prediction accuracy remains insufficient.

AREAS COVERED IN THIS REVIEW

This review highlights the recent progress of the post-processing of protein-compound complexes after docking.

WHAT THE READER WILL GAIN

These methods utilize ensembles of docking poses of compounds to improve the prediction accuracy for the ligand-docking pose and screening results. While the individual docking poses are not reliable, the free energy surface or the most probable docking pose can be estimated from the ensemble of docking poses.

TAKE HOME MESSAGE

The protein-compound docking program provides an arbitral rather than a canonical ensemble of docking poses. When the ensemble of docking poses satisfies the canonical ensemble, we can discuss how these post-docking analysis methods work and fail. Thus, improvements to the docking software will be needed in order to generate well-defined ensembles of docking poses.

SCISSORS: a linear-algebraical technique to rapidly approximate chemical similarities

Algorithms for several emerging large-scale problems in cheminformatics have as their rate-limiting step the evaluation of relatively slow chemical similarity measures, such as structural similarity or three-dimensional (3-D) shape comparison. In this article we present SCISSORS, a linear-algebraical technique (related to multidimensional scaling and kernel principal components analysis) to rapidly estimate chemical similarities for several popular measures. We demonstrate that SCISSORS faithfully reflects its source similarity measures for both Tanimoto calculation and rank ordering. After an efficient precalculation step on a database, SCISSORS affords several orders of magnitude of speedup in database screening. SCISSORS furthermore provides an asymptotic speedup for large similarity matrix construction problems, reducing the number of conventional slow similarity evaluations required from quadratic to linear scaling.