Abstract
Pattern discovery in protein structures is a fundamental task in computational biology, with important applications in protein structure prediction, profiling and alignment. We propose a novel approach for pattern matching and discovery in protein structures using particle swarm-based flying windows over potentially promising regions of the search space. Using a heuristic search, based on particle swarm optimization is, however, easily trapped in local optima due to the sparse nature of the problem search space. Thus, we introduce a novel fitness-based stagnation detection technique that effectively and efficiently restarts the search process to escape potential local optima. The proposed approach predicts an imminent stagnation situation using a novel way that collectively incorporates the already-calculated fitness performances of the swarm particles relative to the objective function, instead of repeatedly calculating their pairwise distances. Our approach is first applied to protein contact maps, which are the 2D compact representation of protein structures. Then, it is generalized to work on classical and advanced (shifted/rotated) benchmark optimization functions. The experimental results show that the proposed fitness-based approach not only demonstrates efficient convergence (up to 3 times faster), but also significantly outperforms the commonly used distance-based method (using Wilcoxon rank-sum test at 95 % confidence level).
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig6_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig7_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig8_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1769-3/MediaObjects/500_2015_1769_Fig9_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ahmed H, Glasgow J (2012) Identifying the building blocks of protein structures from contact maps using protein sequence and evolutionary information. Int J Adv Life Sci 4(1–2):33–43
Ahmed HR, Glasgow JI (2014a) A novel particle swarm-based approach for 3D motif matching and protein structure classification. In: Sokolova M, van Beek P (eds) The 27th Canadian AI’14. Lecture notes in artificial intelligence(LNAI), vol 8436. Springer, Switzerland, pp 1–12
Ahmed HR, Glasgow JI (2014b) Pattern discovery in protein networks reveals high-confidence prediction of novel interactions. In: Proceedings of the 26th AAAI conference on innovative applications of artificial intelligence (IAAI’14), Québec
Ahmed HR, Glasgow JI (2014c) An improved multi-start particle swarm-based algorithm for protein structure comparison. In: Genetic and evolutionary computation conference (GECCO’14), Vancouver
Aung Z, Tan KL (2006) MatAlign: precise protein structure comparison by matrix alignment. J Bioinform Comput Biol 4(6):1197–1216
Ben Ghalia M (2008) Particle swarm optimization with an improved exploration–exploitation balance. In: 51st midwest symposium on circuits and systems (MWSCAS), pp 759–762
Birzele F, Gewehr JE, Csaba G, Zimmer R (2007) Vorolign—fast structural alignment using Voronoi contacts. Bioinformatics 23:205–211
Bork P, Holm L, Sander C (1994) The immunoglobulin fold: structural classification, sequence patterns and common core. J Mol Biol 242:309–320
Brejova B, Vinar T, Li M (2003) Pattern discovery: methods and software. In: Krawetz SA, Womble DD (eds) Introduction to bioinformatics, chapter 29. Humana Press, Springer Science+Business Media, New York, pp 491–522
Brocchieri L, Karlin S (2005) Protein length in eukaryotic and prokaryotic proteomes. Nucleic Acids Res 33:3390–3400
Ciesielski V, Wijesinghe G, Innes A, John S (2006) Analysis of the superiority of parameter optimization over genetic programming for a difficult object detection problem. In: IEEE congress on evolutionary computation (CEC’06), pp 1264–1271
Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73
Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18
Evers GI, Ghalia MB (2009) Regrouping particle swarm optimization: a new global optimization algorithm with improved performance consistency across benchmarks. In: International conference on systems, man, and cybernetics, San Antonio, pp 3901–3908
Ghosh S, Das S, Kundu D, Suresh K, Abraham A (2012) Inter-particle communication and search-dynamics of lbest particle swarm optimizers: an analysis. Inf Sci 182(1):156–168
Glasgow J, Kuo T, Davies J (2006) Protein structure from contact maps: a case-based reasoning approach. Inf Syst Front Springer 8(1):29–36
Hadley G (1964) Nonlinear and dynamics programming. Addison Wesley, Reading
Holm L, Sander C (1993) Protein structure comparison by alignment of distance matrices. J Mol Biol 233:123–138
Holm L, Sander C (1996) Mapping the protein universe. Science 273:595–603
Huang T, Mohan AS (2005) A hybrid boundary condition for robust particle swarm optimization. IEEE Antennas Wirel Propag Lett 4:112–117
Hu X, Eberhart RC (2002) Adaptive particle swarm optimization: detection and response to dynamic systems. In: Proceedings of congress on evolutionary computation, pp 1666–1670
Kawabata T (2003) MATRAS: a program for protein 3D structure comparison. Nucleic Acids Res 31:3367–3369
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Australia, pp 1942–1948
Kleywegt GJ (1999) Recognition of spatial motifs in protein structures. J Mol Biol 285:1887–1897
Konstantinos EP, Michael NV (2010) Particle swarm optimization and intelligence: advances and applications. Information science reference. Hershey, Pennsylvania
Kuo T (2012) A computational approach to predicting distance maps from contact maps. PhD thesis, Queen’s University, Canada
Lee L (1999) Measures of distributional similarity. In: Proceedings of the 37th annual meeting of ACL, pp 25–32
Liang JJ, Qu BY, Suganthan PN, Hernández-Díaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Nanyang Technological University, Tech. Rep
Lu H, Chen X (2011) A new particle swarm optimization with a dynamic inertia weight for solving constrained optimization problems. Inf Technol J 10:1536–1544
May AC (1999) Towards more meaningful hierarchical classification of amino acid scoring matrices. Protein Eng 12:707–712
Meng Y (2006) A swarm intelligence based algorithm for proteomic pattern detection of ovarian cancer. In: IEEE symposium on computational intelligence and bioinformatics and computational biology (CIBCB), pp 1–7
Mitusharu H, Atsushi I, Keiichiro Y (2007) Particle swarm optimization with controlled mutation. IEEE Trans Electr Electron Eng 2(2):192–194
Mussi L, Cagnoni S (2010) Particle swarm for pattern matching in image analysis. In: Serra P, Villani M, Poli I (eds) Artificial life and evolutionary computation. World Scientific, Singapore, pp 89–98
Noa Vargas Y, Chen S (2010) Particle swarm optimization with resets—improving the balance between exploration and exploitation. In: MICAI, pp 371–381
Orengo CA, Pearl FMG, Bray JE, Todd AE, Martin A, Conte LL, Thornton JM (1999) The CATH database provides insights into protein structure/function relationships. Nucleic Acids Res 27:275– 279
Owechko Y, Medasani S (2005) Cognitive swarms for rapid detection of objects and associations in visual imagery. In: Proceedings of IEEE swarm intelligence symposium (SIS’05), pp 420–423
Poli R (2007) An analysis of publications on particle swarm optimization applications. Technical report CSM-469. Univ. of Essex, UK
Qu B-Y, Suganthan PN, Das S (2013) A distance-based locally informed particle swarm model for multimodal optimization. IEEE Trans Evol Comput 17(3):387–402
Riget J, Vesterstroem JS (2002) A diversity guided particle swarm optimiser—the ARPSO. Department of Computer Science, University of Aarhus, Tech. Rep. No. 2002–02 EVALife
Saisan P, Medasani S, Owechko Y (2005) Multi-view classifier swarms for pedestrian detection and tracking. In: The IEEE computer vision and pattern recognition (CVPR’05), p 18
Sali A, Blundell TL (1990) Definition of general topological equivalence in protein structures. A procedure involving comparison of properties and relationships through simulated annealing and dynamic programming. J Mol Biol 212:403–428
Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In: Evolutionary programming VII. LNCS, vol 1447. Springer, New York, pp 591–600
Sjahputera O, Keller JM (2005) Particle swarm over scene matching. In: Proceedings of IEEE swarm intelligence symposium, pp 108–115
Smith HO, Annau TM, Chandrasegaran S (1990) Finding sequence motifs in groups of functionally related proteins. Proc Natl Acad Sci 87:826–830
Spriggs RV, Artymiuk PJ, Willett P (2003) Searching for patterns of amino acids in 3D protein structures. J Chem Inf Comput Sci 43:412–421
Sugisaka M, Fan X (2004) An effective search method for NN-based face detection using PSO. SICE Conf 3:2742–2745
Szustakowski JD, Weng ZP (2000) Protein structure alignment using a genetic algorithm. Proteins 38:428–440
Taylor WR (1999) Protein structure comparison using iterated double dynamic programming. Protein Sci 8:654–665
Taylor WR, Orengo CA (1989) Protein structure alignment. J Mol Biol 208:1–22
Tsai D-M, Tseng Y-H, Chao S-M, Yen C-H (2006) Independent component analysis based filter design for defect detection in low-contrast textured images. In: The 18th international conference on pattern recognition (ICPR’06), pp 231–234
Valle Y, Venayagamoorthy G, Mohagheghi S, Hernandez J-C, Harley RG (2008) Particle swarm optimization: basic concepts, variants and applications in power systems. IEEE Trans Evol Comput 12(2):171–195
van den Bergh F (2002) An analysis of particle swarm optimizers. PhD thesis, University of Pretoria, South Africa
Vassura M et al (2007) Reconstruction of 3D structures from protein contact maps. In: Proceedings of 3rd international symposium on bioinformatics research and applications, vol 4463. Springer, Berlin, pp 578–589
Wallace A, Borkakoti N, Thornton J (1997) TESS: a geometric hashing algorithm for deriving 3D coordinate templates for searching structural databases: applications to enzyme active sites. Protein Sci 6:2308–2323
Walsh I, Vullo A, Pollastri G (2006) XXStout: improving the prediction of long range residue contacts. In: The 14thinternational conference on intelligence systems for molecular biology (ISMB’06), Fortaleza
Wang D-Z, Wu C-H, Ip A, Chan C-Y, Wang D-W (2008) Fast multi-template matching using a particle swarm optimization algorithm for PCB inspection. LNCS 4974:265–370
Worasucheep C (2008) A particle swarm optimization with stagnation detection and dispersion. In: Proceedings of the IEEE congress on evolutionary computation, Hong Kong, pp 424–429
Xu S, Rahmat-Samii Y (2007) Boundary conditions in particle swarm optimization revisited. IEEE Trans Antennas Propag 55(3):760–765
Xu Y, Xu D, Liang J (eds) (2007) Computational methods for protein structure and modeling. Springer, Berlin
Yang X-S (2010) Test problems in optimization. In: Engineering optimization: an introduction with metaheuristic applications. Wiley, Hoboken. http://ca.wiley.com/WileyCDA/WileyTitle/productCd-0470582464.html
Yuan X, Bystroff C (2007) Protein contact map prediction. In: Computational methods for protein structure prediction and modeling. Springer, New York, pp 255–277
Yuwono AM, Handojoseno AMA, Nguyen HT (2011a) Optimization of head movement recognition using augmented radial basis function neural network. In: Proceedings of international conference of the IEEE engineering in medicine and biology society, Boston, pp 2776–2779
Yuwono M, Su S, Moulton B (2011b) Fall detection using a Gaussian distribution of clustered knowledge, augmented radial basis neural-network, and multilayer perceptron. In: The 6th IEEE international conference on broadband and biomedical communications (IB2Com), pp 145–150
Yuwono AM, Su SW, Moulton B, Nguyen H (2012) Method for increasing the computation speed of an unsupervised learning approach for data clustering. In: Proceedings of IEEE congress on evolutionary computation, Brisbane
Zambrano-Bigiarini M, Rojas R (2013) Particle swarm pptimisation, with focus on environmental models. R Documentation for Package ‘hydroPSO’, version 0.3-0-3
Zhan ZH, Zhang J, Li Y, Shi Y (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847
Zhang H, Luo D (2006) A PSO-based method for traffic stop-sign detection. In: Proceedings of the 6th WCICA, pp 8625–8629
Acknowledgments
This work was supported by The Natural Sciences and Engineering Research Council of Canada (NSERC).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Ahmed, H.R., Glasgow, J.I. The Agile particle swarm optimizer applied to proteomic pattern matching and discovery. Soft Comput 20, 4791–4811 (2016). https://doi.org/10.1007/s00500-015-1769-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1769-3