Computing Bond Types in Molecule Graphs

In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this information is essential for various applications in chemistry, we consider the problem of recovering bond type information using a scoring function for the possible valences of each atom—the Bond Type Assignment problem. We prove the NPhardness of Bond Type Assignment and give an exact fixed-parameter algorithm for the problem where bond types are computed via dynamic programming on a tree decomposition of the molecule graph. We evaluate our algorithm on a set of real molecule graphs and find that it works fast and accurately.

• Type: Conference
• Year: 2009
• Where: COCOON
• Authors: Sebastian Böcker, Quang Bao Anh Bui, Patrick Seeber, Anke Truß
• Keywords: Bond Type Assignment, Bond Types, COCOON 2009, Combinatorics, Omit Bond Multiplicities