DocumentCode :
1286935
Title :
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem
Author :
Cavuslar, G. ; Catay, Bulent ; Apaydin, M.S.
Author_Institution :
Univ. of Wisconsin-Madison, Madison, WI, USA
Volume :
9
Issue :
6
fYear :
2012
Firstpage :
1621
Lastpage :
1628
Abstract :
Nuclear Magnetic Resonance (NMR) (Abbreviations used: NMR, Nuclear Magnetic Resonance; NOE, Nuclear Overhauser Effect; RDC, Residual Dipolar Coupling; PDB, Protein Data Bank; SBA, Structure-Based Assignments; NVR, Nuclear Vector Replacement; BIP, Binary Integer Programming; TS, Tabu Search; QAP, Quadratic Assignment Problem; ff2, the FF Domain 2 of human transcription elongation factor CA150 (RNA polymerase II C-terminal domain interacting protein); SPG, Streptococcal Protein G; hSRI, Human Set2-Rpb1 Interacting Domain; MBP, Maltose Binding Protein; EIN, Amino Terminal Domain of Enzyme I from Escherichia Coli; EM, expectation maximization) Spectroscopy is an experimental technique which exploits the magnetic properties of specific nuclei and enables the study of proteins in solution. The key bottleneck of NMR studies is to map the NMR peaks to corresponding nuclei, also known as the assignment problem. Structure-Based Assignment (SBA) is an approach to solve this computationally challenging problem by using prior information about the protein obtained from a homologous structure. NVR-BIP used the Nuclear Vector Replacement (NVR) framework to model SBA as a binary integer programming problem. In this paper, we prove that this problem is NP-hard and propose a tabu search (TS) algorithm (NVR-TS) equipped with a guided perturbation mechanism to efficiently solve it. NVR-TS uses a quadratic penalty relaxation of NVR-BIP where the violations in the Nuclear Overhauser Effect constraints are penalized in the objective function. Experimental results indicate that our algorithm finds the optimal solution on NVRBIP´s data set which consists of seven proteins with 25 templates (31 to 126 residues). Furthermore, it achieves relatively high assignment accuracies on two additional large proteins, MBP and EIN (348 and 243 residues, respectively), which NVR-BIP failed to solve. The executable and the input files are available for download at http://people.sabanciuniv.edu/catay/NVR- TS/NVR-TS.html.
Keywords :
Overhauser effect; RNA; bioinformatics; biological NMR; cellular biophysics; enzymes; integer programming; microorganisms; molecular biophysics; molecular configurations; search problems; EIN; Escherichia Coli; FF domain 2; MBP; NMR protein structure-based assignment problem; NOE; NVRBIP data set; QAP; RDC; RNA polymerase II C-terminal domain interacting protein; SPG; Tabu search approach; amino terminal domain; binary integer programming problem; enzyme I; expectation maximization spectroscopy; homologous structure; human Set2-Rpb1 interacting domain; human transcription elongation factor CA150; magnetic properties; maltose binding protein; nuclear Overhauser effect; nuclear magnetic resonance; nuclear vector replacement; protein data bank; quadratic assignment problem; residual dipolar coupling; streptococcal protein G; Accuracy; Amino acids; Bioinformatics; Linear programming; Nuclear magnetic resonance; Proteins; Protons; Automated NMR assignments; NMR structural biology; structural bioinformatics; tabu search; Algorithms; Bacterial Proteins; Computational Biology; Databases, Protein; Humans; Nuclear Magnetic Resonance, Biomolecular; Protein Conformation; Proteins; Structure-Activity Relationship;
fLanguage :
English
Journal_Title :
Computational Biology and Bioinformatics, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1545-5963
Type :
jour
DOI :
10.1109/TCBB.2012.122
Filename :
6305447
Link To Document :
بازگشت