Abstract
Chemical similarity is a fundamental concept in cheminformatics and is used in various tasks, such as predicting biological activities or analyzing molecular datasets. A natural approach to quantifying the similarity of chemical compounds is based on the substructures they share. This chapter focuses on graph-based methods for comparing molecules, particularly algorithms for identifying the maximum common subgraph of two molecular graphs. We discuss the basic graph-theoretical formalizations and summarize the related computational problems, their theoretical complexity and the prevailing algorithmic techniques for their solution as well as corresponding applications.
Original language | English |
---|---|
Title of host publication | Encyclopedia of Bioinformatics and Computational Biology (Second Edition) |
Publisher | Elsevier |
Volume | 3 |
Edition | 2 |
ISBN (Print) | 978-0-323-95503-4 |
DOIs | |
Publication status | Published - 2025 |
Austrian Fields of Science 2012
- 102004 Bioinformatics