Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 3, May-June 2005, pp. 389-402
DOI: 10.1287/opre.1040.0189
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Strickland, D. M.
Right arrow Articles by Sokol, J. S.
Right arrow Search for Related Content

Optimal Protein Structure Alignment Using Maximum Cliques

Dawn M. Strickland, Earl Barnes, Joel S. Sokol

Department of Mathematics, Winthrop University, Rock Hill, South Carolina 29733
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332

stricklandd{at}winthrop.edu
ebarnes{at}isye.gatech.edu
jsokol{at}isye.gatech.edu

In biology, the protein structure alignment problem answers the question of how similar two proteins are. Proteins with strong physical similarities in their tertiary (folded) structure often have similar functions, so understanding physical similarity could be a key to developing protein-based medical treatments. One of the models for protein structure alignment is the maximum contact map overlap (CMO) model. The CMO model of protein structure alignment can be cast as a maximum clique problem on an appropriately defined graph. We exploit properties of these protein-based maximum clique problems to develop specialized preprocessing techniques and show how they can be used to more quickly solve contact map overlap instances to optimality.

Subject classifications: networks/graphs:applications; heuristics; programming:integer.
History: Received August 2003; revision received December 2003; accepted April 2004.




This article has been cited by other articles:


Home page
InterfacesHome page
C. N. Goulimis
ASP, The Art and Science of Practice: Appeal to NP-Completeness Considered Harmful: Does the Fact That a Problem Is NP-Complete Tell Us Anything?
Interfaces, November 1, 2007; 37(6): 584 - 586.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.