Cheminformatics Basics#
What is Cheminformatics?#
Cheminformatics is a cross between Computer Science and Chemistry – the process of storing and retrieving information about chemical compounds.
Information Systems are concerned with storing, retrieving, and searching information, and with storing relationships between bits of data. For example:
Operation |
Classical Information System |
Chemical Information System |
||
---|---|---|---|---|
Store |
Name = ‘Jimmy Carter’ |
Stores text, numbers, dates, … |
Stores chemical compounds and information about them |
|
Retrieve |
Find record #13282 |
Retrieves ‘Jimmy Carter’ |
Find CC(=O)C4CC3C2CC(C)C1=C(C)… C(=O)CC(O)C1C2CCC3(C)C4 |
Retrieves: |
Search |
Find Presidents named ‘Bush’ |
George Bush and George W. Bush |
Find molecules containing |
Retrieves: |
Relationship |
Year Carter was elected |
Answer: Elected in 1976 |
What’s the logP(o/w) of |
Answer: logP(o/W) = 2.62 |
How is Cheminformatics Different?#
There are four key problems a cheminformatics system solves:
Store a Molecule
Computer scientists usually use the valence model of chemistry to represent compounds. The next section Representing Molecules, discusses this at length.
Find exact molecule
If you ask, “Is Abraham Lincoln in the database?” it’s not hard to find the answer. But, given a specific molecule, is it in the database? What do we know about it? This may seem seem simple at first glance, but it’s not, as we’ll see when we discuss tautomers, stereochemistry, metals, and other “flaws” in the valence model of chemistry.
Substructure search
If you ask, “Is anyone named Lincoln in the database?” you usually expect to find the former President and a number of others - this is called a search rather than a lookup. For a chemical informatics system, we have a substructure search: Find all molecules containing a partial molecule (the “substructure”) drawn by the user. The substructure is usually a functional group, “scaffold”, or core structure representing a class of molecules. This too is a hard problem, much harder than most text searches, for reasons that go to the very root of mathematics and the theory of computability.
Similarity search
Some databases can find similar-sounding or misspelled words, such as “Find Lincon” or “find Cincinati”, which respectively might find Abraham Lincoln and Cincinnati. Many chemical information systems can find molecules similar to a given molecule, ranked by similarity. There are several ways to measure molecular similarity, discussed further in the section on Molecular Similarity.