Population-based Modified Extremal Optimization for Contact Map Overlap Maximization Problem

The three-dimensional structures of proteins provide biogenic functions for biological activities. Proteins that have similar three-dimensional structures usually have similar biological functions. Therefore, many researchers focus on the techniques for comparing the three-dimensional structures of proteins. Many of these techniques for comparing protein structures are based on protein structure alignment, which is one of the most effective methods for extracting similar strutures. The Contact Map Overlap (CMO) maximization problem (for short, the CMO problem) is formulated as a combinatorial optimization for finding the optimal structure alignments. In this paper, we propose a novel bio-inspired heuristic using Population-based Modified Extremal Optimization (PMEO) for the CMO problem. The proposed heuristic has two features. First, the proposed heuristic uses PMEO. There are multiple individuals in a population which repeat alternation of generations. Second, to improve the search efficiency, individuals copy a sub-structure of an individual with good sub-structures at each alternation of generations.

[1]  Keiichi Tamura,et al.  Modified EO-based evolutionary algorithm for reducing crossovers of reconciliation graph , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).

[2]  Wei Xie,et al.  A Reduction-Based Exact Algorithm for the Contact Map Overlap Problem , 2007, J. Comput. Biol..

[3]  Lam Fat Yeung,et al.  Extremal Optimization for the Protein Structure Alignment , 2009, 2009 IEEE International Conference on Bioinformatics and Biomedicine.

[4]  Stefan Boettcher,et al.  Extremal Optimization: Methods derived from Co-Evolution , 1999, GECCO.

[5]  Lam Fat Yeung,et al.  A similarity matrix-based hybrid algorithm for the contact map overlaps problem , 2011, Comput. Biol. Medicine.

[6]  R. Carr,et al.  Branch-and-Cut Algorithms for Independent Set Problems: Integrality Gap and An Application to Protein Structure Alignment , 2000 .

[7]  S. Balaji,et al.  A Simple Algorithm for Maximum Clique and Matching Protein Structures , 2010, Int. J. Comb. Optim. Probl. Informatics.

[8]  Robert D. Carr,et al.  1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap , 2004, J. Comput. Biol..

[9]  Christos H. Papadimitriou,et al.  Algorithmic aspects of protein structure similarity , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Giuseppe Lancia,et al.  Protein Structure Comparison: Algorithms and Applications , 2003, Mathematical Methods for Protein Structure Analysis and Design.

[11]  Alberto Caprara,et al.  Structural alignment of large—size proteins via lagrangian relaxation , 2002, RECOMB '02.

[12]  C. Branden,et al.  Introduction to protein structure , 1991 .

[13]  Yasuma Mori,et al.  Reducing Crossovers in Reconciliation Graphs with Extremal Optimization , 2007 .

[14]  Keiichi Tamura,et al.  Optimal protein structure alignment using modified extremal optimization , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[15]  Joel Sokol,et al.  Optimal Protein Structure Alignment Using Maximum Cliques , 2005, Oper. Res..

[16]  Adam Godzik,et al.  Flexible algorithm for direct multiple alignment of protein structures and sequences , 1994, Comput. Appl. Biosci..

[17]  Robert D. Carr,et al.  101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem , 2001, RECOMB.

[18]  Michael Lappe,et al.  Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem , 2007, BIRD.