Comparison and classification of folding patterns from a database of protein structures is crucial to understand the principles of protein architecture, evolution and function. Current search methods for proteins with similar folding patterns are slow and computationally intensive. The sharp growth in the number of known protein structures poses severe challenges for methods of structural comparison. There is a need for methods that can search the database of structures accurately and rapidly.#R##N##R##N#We provide several methods to search for similar folding patterns using a concise tableau representation of proteins that encodes the relative geometry of secondary structural elements. Our first approach allows the extraction of identical and very closely-related protein folding patterns in constant-time (per hit). Next, we address the hard computational problem of extraction of maximally-similar subtableaux, when comparing two tableaux. We solve the problem using Quadratic and Linear integer programming formulations and demonstrate their power to identify subtle structural similarities, especially when protein structures significantly diverge. Finally, we describe a rapid and accurate method for comparing a query structure against a database of protein domains, TableauSearch. TableauSearch is rapid enough to search the entire structural database in seconds on a standard desktop computer. Our analysis of TableauSearch on many queries shows that the method is very accurate in identifying similarities of folding patterns, even between distantly related proteins.#R##N##R##N#Availability: A web server implementing the TableauSearch is available from http://hollywood.bx.psu.edu/TabSearch#R##N##R##N#Contact:arun@bx.psu.edu, aml25@psu.edu#R##N##R##N#Supplementary information: Supplementary Data are available at Bioinformatics online.
['Arun Siddharth Konagurthu', 'Peter J. Stuckey', 'Arthur M. Lesk']
Structural search and retrieval using a tableau representation of protein folding patterns