On the Parallelization of the SProt Measure and the TM-score Algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10124110" target="_blank" >RIV/00216208:11320/13:10124110 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-30191-9_18" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-30191-9_18</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-36949-0_27" target="_blank" >10.1007/978-3-642-36949-0_27</a>

Result language
angličtina
Original language name
On the Parallelization of the SProt Measure and the TM-score Algorithm
Original language description
Similarity measures for the protein structures are quite complex and require significant computational time. We propose a parallel approach to this problem to fully exploit the computational power of current CPU architectures. This paper summarizes experience and insights acquired from the parallel implementation of the SProt similarity method, its database access method, and also the wellknown TM-score algorithm. The implementation scales almost inearly with the number of CPUs and achieves 21.4x speedup on a 24-core system. The implementation is currently employed in the web application http://siret.cz/p3s.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F11%2F0968" target="_blank" >GAP202/11/0968: Large-scale Nonmetric Similarity Search in Complex Domains</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)