Parallel seed-based approach to multiple protein structure similarities detection
Finding similarities between protein structures is a crucial task in molecular biology. Most of the existing tools require proteins to be aligned in order-preserving way and only find single alignments even when multiple similar regions exist. We propose a new seed-based approach that discovers multiple pairs of similar regions. Its computational complexity is polynomial and it comes with a quality guarantee—the returned alignments have both root mean squared deviations (coordinate-based as well as internal-distances based) lower than a given threshold, if such exist. We do not require the alignments to be order preserving (i.e., we consider nonsequential alignments), which makes our algorithm suitable for detecting similar domains when comparing multidomain proteins as well as to detect structural repetitions within a single protein. Because the search space for nonsequential alignments is much larger than for sequential ones, the computational burden is addressed by extensive use of parallel computing techniques: a coarse-grain level parallelism making use of available CPU cores for computation and a fine-grain level parallelism exploiting bit-level concurrency as well as vector instructions.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 1201429
- Journal Information:
- Scientific Programming, Vol. 2015, Issue 20; ISSN 1058-9244
- Publisher:
- HindawiCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
StralSV: assessment of sequence variability within similar 3D structures and application to polio RNA-dependent RNA polymerase