A Hill-Climbing Approach for Residue Mapping in Protein Structure Alignment

  • Manish Kumar
Part of the EAI/Springer Innovations in Communication and Computing book series (EAISICC)


A sequence of amino acid comprises a protein structure, in which each amino acid is bounded by a peptide bond. Identifying similarity between different protein structures is known to be the most prominent research field in the current scenario. Residue mapping generally deals in identifying structural similarity in between bimolecular structures based on 3D structure. In this research work, we present a biologically inspired heuristic approach to handle the residue mapping problem in protein structure alignment. In the proposed scheme, we defined a fitness function, and based on the fitness scores, we try to find similar residues in two different protein structures. We have adopted evaluation scheme of biogeography-based optimization technique to investigate the feasibility of the presented approach over different iterations. To test the performances of the presented method, we have evaluated our methodology on real protein structure alignments and compared it with some of the well-known methods in the concerned area. The results which we gained after the experimental analysis clearly give the idea about the superiority of the presented method.


Residue mapping Protein structure Alignment Biogeography-based optimization 


  1. Balaji, S., Swaminathan, V., & Kannan, K. (2010). A simple algorithm for maximum clique and matching protein structures. IJCOPI, 1(2), 2–11.Google Scholar
  2. Belding, T. C. (1995). The distributed genetic algorithm revisited. In Proceedings of the sixth international conference on genetic algorithms (pp. 114–121).Google Scholar
  3. Boettcher, S., & Percus, A. G. (1999). Extremal optimization: methods derived from co-evolution. In Proceedings of the genetic and evolutionary computation conference (pp. 825–832).Google Scholar
  4. Fraser, R., & Glasgow, J. I. (2007). A demonstration of clustering in protein contact maps for alpha helix pairs. In Proceedings of the eighth international conference ICANNGA 2007 part I (pp. 758–766).Google Scholar
  5. Godzik, A., & Skolnick, J. (1994). Flexible algorithm for direct multiple alignment of protein structures and sequences. Computer Applications in the Biosciences, 10(6), 587–596.Google Scholar
  6. Hamidi, S., Naghibzadeh, M., & Sadri, J. (2013). Protein multiple sequence alignment based on secondary structure similarity. In International conference on advances in computing, communications and informatics (pp. 1224–1229).Google Scholar
  7. Hu Jingjing, Shen Xiaolan, Shao Yu, Bystroff Chris, & Zaki, M. J. (2002). Mining protein contact maps. In Second BIOKDD workshop on data mining in bioinformatics (with SIGKDD).Google Scholar
  8. Jain, B. J., & Lappe, M. (2007). Joining soft assign and dynamic programming for the contact map overlap problem. In Proceedings of the first international conference on bioinformatics research and development (pp. 410–423).Google Scholar
  9. Kupis, P., & Mandziuk, J. (2007). Evolutionary-progressive method for multiple sequence alignment. In IEEE symposium on computational intelligence and bioinformatics and computational biology (pp. 291–297).Google Scholar
  10. Lu, H., Yang, G., & Yeung, L. F. (2009). Extremal optimization for the protein structure alignment. In Proceedings of the IEEE international conference on bioinformatics and biomedicine (pp. 15–19).Google Scholar
  11. Lu, H., Yang, G., & Yeung, L. F. (2011). A similarity matrix-based hybrid algorithm for the contact map overlaps problem. Computers in Biology and Medicine, 41, 247–252.CrossRefGoogle Scholar
  12. Nakada, A., Tamura, K., & Kitakami, H. (2012). Optimal protein structure alignment using modified extremal optimization. In Proceedings of the IEEE international conference on systems, man, and cybernetics (pp. 697–702).Google Scholar
  13. Nakada, A., Tamura, K., Kitakami, H., & Takahashi, Y. (2013). Population based modified extremal optimization for contact map overlap maximization problem. In Proceedings of the IIAI international conference on advanced applied informatics (IIAI-AAI 2013) (pp. 245–250).Google Scholar
  14. Needleman, S. B., & Wunsch, C. D. (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3), 443–453.CrossRefGoogle Scholar
  15. Simon, D. (2011). A probabilistic analysis of a simplified biogeography-based optimization algorithm. Evolutionary Computation, 19(2), 167–188.CrossRefGoogle Scholar
  16. Strickland, D. M., Barnes, E., & Sokol, J. S. (2005). Optimal protein structure alignment using maximum cliques. Operations Research, 53, 389–402.MathSciNetCrossRefGoogle Scholar
  17. Tamura, K., Kitakami, H., Sakai, T., & Takahashi, Y. (2015). A new distributed modified extremal optimization for optimizing protein structure alignment. In IEEE eighth international workshop on computational intelligence and applications (IWCIA) (pp. 109–114).Google Scholar
  18. Tanese, R. (1989). Distributed genetic algorithms. In Proceedings of the third international conference on genetic algorithms (pp. 434–439).Google Scholar
  19. Yonghua, H., Bin, M., & Kaizhong, Z. (2004). SPIDER: Software for protein identification from sequence tags with de novo sequencing error. In Proceedings of computational systems bioinformatics conference (pp. 206–215).Google Scholar
  20. Zaki, M. J., Nadimpally, V., Bardhan, D., & Bystroff, C. (2005). Predicting protein folding pathways. In Data mining in bioinformatics (pp. 127–141).Google Scholar
  21. Zemali, E., & Boukra, A. (2015). Resolving the multiple sequence alignment problem using biogeography based optimization with multiple populations. Journal of Bioinformatics and Computational Biology, 13, 131–123.CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Manish Kumar
    • 1
  1. 1.Department of Computer Science and EngineeringMadanapalle Institute of Technology and Sciences (UGC Autonomous)MadanapalleIndia

Personalised recommendations