Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

German conference on bioinformatics 2009 P-157, 201-210 (2009).

Gesellschaft für Informatik, Bonn

Copyright © Gesellschaft für Informatik, Bonn


Automated Bond order assignment as an optimization problem

A. K. Dehof , A. Rurainski , H. -P. Lenhof and A. Hildebrandt


Numerous applications in Computational Biology process molecular structures and hence require not only reliable atomic cordinates, but also correct bond order information. Regrettably, this information is not always provided in molecular databases like the Cambridge Structural Database or the Protein Data Bank. Very different strategies have been applied to derive bond order information, most of them relying on the correctness of the atom coordinates. We extended a different ansatz proposed by Wang et al. that assigns heuristic molecular penalty scores solely based on connectivity information and tries to heuristically approximate its optimum. In this work, we present two efficient and exact solvers for the problem replacing the heuristic approximation scheme of the original approach: an ILP formulation and an A* approach. Both are integrated into the upcoming version of the Biochemical Algorithms Library BALL and have been successfully validated on the MMFF94 validation suite.

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-251-2

Last changed 04.10.2013 18:29:30