Tableau-based Protein Substructure Search Using Quadratic Programming
Overview
Authors
Affiliations
Background: Searching for proteins that contain similar substructures is an important task in structural biology. The exact solution of most formulations of this problem, including a recently published method based on tableaux, is too slow for practical use in scanning a large database.
Results: We developed an improved method for detecting substructural similarities in proteins using tableaux. Tableaux are compared efficiently by solving the quadratic program (QP) corresponding to the quadratic integer program (QIP) formulation of the extraction of maximally-similar tableaux. We compare the accuracy of the method in classifying protein folds with some existing techniques.
Conclusion: We find that including constraints based on the separation of secondary structure elements increases the accuracy of protein structure search using maximally-similar subtableau extraction, to a level where it has comparable or superior accuracy to existing techniques. We demonstrate that our implementation is able to search a structural database in a matter of hours on a standard PC.
Gutierrez F, Rodriguez-Valenzuela F, Ibarra I, Devos D, Melo F BMC Bioinformatics. 2016; 17:20.
PMID: 26732380 PMC: 4702403. DOI: 10.1186/s12859-015-0866-8.
Multiple graph regularized protein domain ranking.
Jing-Yan Wang J, Bensmail H, Gao X BMC Bioinformatics. 2012; 13:307.
PMID: 23157331 PMC: 3583823. DOI: 10.1186/1471-2105-13-307.
BetaSearch: a new method for querying β-residue motifs.
Ho H, Gange G, Kuiper M, Ramamohanarao K BMC Res Notes. 2012; 5:391.
PMID: 22839199 PMC: 3532365. DOI: 10.1186/1756-0500-5-391.
Wang J, Gao X, Wang Q, Li Y BMC Bioinformatics. 2012; 13 Suppl 7:S2.
PMID: 22594999 PMC: 3348016. DOI: 10.1186/1471-2105-13-S7-S2.
Shirvanyants D, Alexandrova A, Dokholyan N Bioinformatics. 2011; 27(9):1327-9.
PMID: 21460026 PMC: 3138080. DOI: 10.1093/bioinformatics/btr129.