Question
Computing geometric properties of a union of spheres is important to many 3 applications in computational biology. The following problem is a 2-dimensional simplification of
Computing geometric properties of a union of spheres is important to many 3 applications in computational biology. The following problem is a 2-dimensional simplification of one of these problems. You are given a set P of atoms forming a protein, which for our purposes will be represented by a collection of circles in the plane, all of equal radius ra. Such a protein lives in a solution of water. We will model a molecule of water by a circle of radius rb > ra. We say that an atom a ? P is solvent-accessible if there exists a placement of a water molecule that is tangent to a, and the water molecule does not intersect any other atoms in P. In the figure below, all atoms are solvent-accessible except for three (shaded). Given a protein molecule P of n atoms, devise an O(n log n) time algorithm to determine all solventinaccessible atoms of P.
Please write the algorithm, a justification of its correctness, and a derivation of its running time. Write clear and convincing PSEUDO-CODE for your algorithm. NO CODE.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started