2D-Structure Drawings of Similar Molecules

  • J. D. Boissonnat
  • F. Cazals
  • J. Flötotto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)

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.

References

  1. 1.
    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.Google Scholar
  2. 2.
    Jean-Daniel Boissonnat, Fréderic Cazals, and Julia Flötotto. 2d-structure drawings of similar molecules. Technical report, INRIA Sophia Antipolis, to appear 2000.Google Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    G. di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing. Prentice Hall, 1999.Google Scholar
  6. 6.
    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.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Peter Eades and Sue Whitesides. The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sci., 169(1):23–37, 1996.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21:183–210, 1998.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    D. Brynn Hibbert. Generation and display of chemical structures by genetic algorithms. Chemometrics and Intelligent Laboratory Systems, 20:35–43, 1993.CrossRefGoogle Scholar
  11. 11.
    M. Himsolt. Gml: A portable graph file format. Technical report, Universität Passau, 1997. cf. http://www.fmi.uni-passau.de/himsolt/Graphlet/GML.
  12. 12.
    D. R. Musser and Atul Saini. STL Tutorial and Reference Guide. Addison-Wesley Publishing Company, 1995.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    Craig A. Shelley. Heuristic approach for displaying chemical structures. J. Chem. Inf. Comput. Sci., 23:61–65, 1983.CrossRefGoogle Scholar
  15. 15.
    J. van Leeuwen (Ed.). Handbook of Theoretical Computer Science, volume A. Elsevier, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • J. D. Boissonnat
    • 1
  • F. Cazals
    • 1
  • J. Flötotto
    • 1
  1. 1.Projet Prisme, INRIA Sophia-Antipolis, 2004Sophia Antipolis CedexFrance

Personalised recommendations