Stabbing balls and simplifying proteins
by Ovidiu Daescu, Jun Luo
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 5, No. 1, 2009

Abstract: We address the problem of stabbing a sequence of indexed balls B = {B₁,B₂, . . . , B_n} in R³, where B_i (1 ≤ i ≤ n) has centre p_i and radius ε_i; a solution is an increasing integer sequence i₁, . . . , i_m such that i₁ = 1, i_m = n and for i_j ≤ k ≤ i_j+1 the line segment Pi_j Pi_j+1 stabs the ball B_k; the goal is to minimise m. The problem finds applications in simplification of molecule chains for visualisation, matching and efficient searching in molecule and protein databases. We implemented the algorithm and created a web server where one can input a pdb file and get the simplified protein chains. We did experiments on thousands of proteins from the PDB Bank to estimate the simplification ratio achieved.

Online publication date: Wed, 07-Jan-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com