Abstract
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an index-based search that produces a list of proteins that are good candidates for similarity, and a dynamic programming algorithm that aligns the target protein with each candidate protein. Both components use the same geometric properties of secondary structure elements of proteins. Thus, an important issue arises when porting the application to the Grid, i.e. the tradeoff between data transfer and data recomputation. Our restructured application avoids recomputation by re-using the data as much as possible, once they are accessed. The algorithmic changes to PROuST allow to reduce the number of data accesses to storage elements and consequently the execution time. This paper also discusses data replication policies on a Grid environment to optimize the data transfer time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
