Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity

  • Eran Eyal
  • Dan Halperin
Conference paper

DOI: 10.1007/11557067_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3692)
Cite this paper as:
Eyal E., Halperin D. (2005) Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. In: Casadio R., Myers G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science, vol 3692. Springer, Berlin, Heidelberg

Abstract

We present recent developments in efficiently maintaining the boundary and surface area of protein molecules as they undergo conformational changes. As the method that we devised keeps a highly accurate representation of the outer boundary surface and of the voids in the molecule, it can be useful in various applications, in particular in Monte Carlo Simulation. The current work continues and extends our previous work [10] and implements an efficient method for recalculating the surface area under conformational (and hence topological) changes based on techniques for efficient dynamic maintenance of graph connectivity. This method greatly improves the running time of our algorithm on most inputs, as we demonstrate in the experiments reported here.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Eran Eyal
    • 1
  • Dan Halperin
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityIsrael

Personalised recommendations