Abstract
A common strategy in drug design and pharmacophore identification consists of evaluating large sets of molecular structures by comparing their 2D structure drawings. To simplify the chemists’ task, the drawings should reveal similarities and differences between drugs. Given a family of molecules all containing a common template, we present an algorithm to compute standardised 2D structure drawings. The molecules being represented as a graph, we compute a structure called supertree in which all molecules can be embedded. Using the correspondences between atoms provided by the supertree, we are able to coordinate the drawings performed by a breadth-first traversal of the molecular graphs. Both parts of the problem are NP-hard. We propose algorithms of heuristic nature.
A poster version of this work has been presented at JOBIM 2000 -Jounées Ouvertes Biologie Informatique Mathématique, France, Mai 2000.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Tatsuya Akutsu and MagnĂşs M. HalldĂłrsson. On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science, to appear 2000.
Jean-Daniel Boissonnat, Fréderic Cazals, and Julia Flötotto. 2d-structure drawings of similar molecules. Technical report, INRIA Sophia Antipolis, to appear 2000.
Raymond E. Carhart. A model-based approach to the teletype printing of chemical structures. Journal of Chemical Information and Computer Sciences, 16:82–88, 1976.
F. Cazals. Effective nearest neighbours searching on the hyper-cube, with applications to molecular clustering. In 14th ACM Symposium on Computational Geometry, pages 222–230, 1998.
G. di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing. Prentice Hall, 1999.
J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86–124, 1989.
Peter Eades and Sue Whitesides. The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sci., 169(1):23–37, 1996.
R. J. Feldmann, S. R. Heller, E. Hyde, and W. T. Wipke (Ed.). Computer Representation and Manipulation of Chemical Information, pages 55–60. Wiley, New York, 1974.
A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21:183–210, 1998.
D. Brynn Hibbert. Generation and display of chemical structures by genetic algorithms. Chemometrics and Intelligent Laboratory Systems, 20:35–43, 1993.
M. Himsolt. Gml: A portable graph file format. Technical report, Universität Passau, 1997. cf. http://www.fmi.uni-passau.de/himsolt/Graphlet/GML.
D. R. Musser and Atul Saini. STL Tutorial and Reference Guide. Addison-Wesley Publishing Company, 1995.
V. Nicholson, C.-C. Tsai, M. Johnson, and M. Naim. A subgraph isomorphism theorem for molecular graphs. In Graph theory and topology in chemistry, Collect. Pap. Int. Conf., volume 51 of Stud. Phys. Theor. Chem., pages 226–230, Athens/GA, 1987.
Craig A. Shelley. Heuristic approach for displaying chemical structures. J. Chem. Inf. Comput. Sci., 23:61–65, 1983.
J. van Leeuwen (Ed.). Handbook of Theoretical Computer Science, volume A. Elsevier, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boissonnat, J.D., Cazals, F., Flötotto, J. (2001). 2D-Structure Drawings of Similar Molecules. In: Marks, J. (eds) Graph Drawing. GD 2000. Lecture Notes in Computer Science, vol 1984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44541-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-44541-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41554-1
Online ISBN: 978-3-540-44541-8
eBook Packages: Springer Book Archive