On Complexity of Protein Structure Alignment Problem under Distance Constraint

2012 ◽  
Vol 9 (2) ◽  
pp. 511-516 ◽  
Author(s):  
Aleksandar Poleksic
Keyword(s):  
Protein Structure ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Distance Constraint ◽  
Alignment Problem

scholarly journals On the Difference in Quality between Current Heuristic and Optimal Solutions to the Protein Structure Alignment Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Mauricio Arriagada ◽  
Aleksandar Poleksic
Keyword(s):  
Protein Structure ◽  
Heuristic Algorithms ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Optimal Solutions ◽  
Timely Manner ◽  
Matching Problem ◽  
Structural Match ◽  
Alignment Problem ◽  
The Difference

The importance of pairwise protein structural comparison in biomedical research is fueling the search for algorithms capable of finding more accurate structural match of two input proteins in a timely manner. In recent years, we have witnessed rapid advances in the development of methods for approximate and optimal solutions to the protein structure matching problem. Albeit slow, these methods can be extremely useful in assessing the accuracy of more efficient, heuristic algorithms. We utilize a recently developed approximation algorithm for protein structure matching to demonstrate that a deep search of the protein superposition space leads to increased alignment accuracy with respect to many well-established measures of alignment quality. The results of our study suggest that a large and important part of the protein superposition space remains unexplored by current techniques for protein structure alignment.

PROTEIN STRUCTURE ALIGNMENT AND FAST SIMILARITY SEARCH USING LOCAL SHAPE SIGNATURES

2004 ◽  
Vol 02 (01) ◽  
pp. 215-239 ◽  
Author(s):  
TOLGA CAN ◽  
YUAN-FANG WANG
Keyword(s):  
Protein Structure ◽  
Protein Structures ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Specific Information ◽  
Alignment Algorithm ◽  
Screening Process ◽  
Domain Specific ◽  
Local Sequence ◽  
Shape Signatures

We present a new method for conducting protein structure similarity searches, which improves on the efficiency of some existing techniques. Our method is grounded in the theory of differential geometry on 3D space curve matching. We generate shape signatures for proteins that are invariant, localized, robust, compact, and biologically meaningful. The invariancy of the shape signatures allows us to improve similarity searching efficiency by adopting a hierarchical coarse-to-fine strategy. We index the shape signatures using an efficient hashing-based technique. With the help of this technique we screen out unlikely candidates and perform detailed pairwise alignments only for a small number of candidates that survive the screening process. Contrary to other hashing based techniques, our technique employs domain specific information (not just geometric information) in constructing the hash key, and hence, is more tuned to the domain of biology. Furthermore, the invariancy, localization, and compactness of the shape signatures allow us to utilize a well-known local sequence alignment algorithm for aligning two protein structures. One measure of the efficacy of the proposed technique is that we were able to perform structure alignment queries 36 times faster (on the average) than a well-known method while keeping the quality of the query results at an approximately similar level.

scholarly journals Implementation of a Parallel Protein Structure Alignment Service on Cloud

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Che-Lun Hung ◽  
Yaw-Ling Lin
Keyword(s):  
Protein Structure ◽  
Programming Model ◽  
Protein Structures ◽  
Structure Alignment ◽  
Evolutionary Relationships ◽  
Protein Structure Alignment ◽  
Alignment Algorithm ◽  
Cloud Platform ◽  
Computational Performance ◽  
Refinement Algorithm

Protein structure alignment has become an important strategy by which to identify evolutionary relationships between protein sequences. Several alignment tools are currently available for online comparison of protein structures. In this paper, we propose a parallel protein structure alignment service based on the Hadoop distribution framework. This service includes a protein structure alignment algorithm, a refinement algorithm, and a MapReduce programming model. The refinement algorithm refines the result of alignment. To process vast numbers of protein structures in parallel, the alignment and refinement algorithms are implemented using MapReduce. We analyzed and compared the structure alignments produced by different methods using a dataset randomly selected from the PDB database. The experimental results verify that the proposed algorithm refines the resulting alignments more accurately than existing algorithms. Meanwhile, the computational performance of the proposed service is proportional to the number of processors used in our cloud platform.

Sign in / Sign up

Export Citation Format

Share Document