Abstract
The design of a protein folding approximation algorithm is not straightforward even when a simplified model is used. The folding problem is a combinatorial problem, where approximation and heuristic algorithms are usually used to find near optimal folds of proteins primary structures. Approximation algorithms provide guarantees on the distance to the optimal solution. The folding approximation approach proposed here depends on two-dimensional cellular automata to fold proteins presented in a well-studied simplified model called the hydrophobic–hydrophilic model. Cellular automata are discrete computational models that rely on local rules to produce some overall global behavior. One-third and one-fourth approximation algorithms choose a subset of the hydrophobic amino acids to form H–H contacts. Those algorithms start with finding a point to fold the protein sequence into two sides where one side ignores H’s at even positions and the other side ignores H’s at odd positions. In addition, blocks or groups of amino acids fold the same way according to a predefined normal form. We intend to improve approximation algorithms by considering all hydrophobic amino acids and folding based on the local neighborhood instead of using normal forms. The CA does not assume a fixed folding point. The proposed approach guarantees one half approximation minus the H–H endpoints. This lower bound guaranteed applies to short sequences only. This is proved as the core and the folds of the protein will have two identical sides for all short sequences.
Similar content being viewed by others
References
Sarkar P (2000) A brief history of cellular automata. ACM Comput Surv 32(1):80–107
Dill KA (1985) Theory for the folding and stability of globular proteins. Biochemistry 24(6):1501–1509
Lau KF, Dill KA (1989) A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22(10):3986–3997
Dill KA, Bromberg S, Yue K, Chan HS, Ftebig KM, Yee DP, Thomas PD (1995) Principles of protein folding a perspective from simple exact models. Protein Sci 4(4):561–602
Newman A (2002) A new algorithm for protein folding in the hp model. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’02. Society for Industrial and Applied Mathematics, Philadelphia, pp 876–884
Li X, Li X, Xiao Y, Jia B (2016) Modeling mechanical restriction differences between car and heavy truck in two-lane cellular automata traffic flow model. Physica A 451(Supp C):49–62
Pandey G, Rao KR, Mohan D (2017) Modelling vehicular interactions for heterogeneous traffic flow using cellular automata with position preference. J Mod Transp 25(3):163–177
Raghavan R (1993) Cellular automata in pattern recognition. Inf Sci 70(1):145–177
Madain A, Abu Dalhoum AL, Hiary H, Ortega A, Alfonseca M (2014) Audio scrambling technique based on cellular automata. Multimed Tools Appl 71(3):1803–1822
Abu Dalhoum AL, Madain A, Hiary H (2015) Digital image scrambling based on elementary cellular automata. Multimed Tools Appl 75(24):17019–17034
Burks C, Farmer D (1984) Towards modeling dna sequences as automata. Physica D 10(1–2):157–167
de Sales JA, Martins ML, Stariolo DA (1997) Cellular automata model for gene networks. Phys Rev E 55:3262–3270
Sirakoulis G, Karafyllidis I, Mizas C, Mardiris V, Thanailakis A, Tsalides P (2003) A cellular automaton model for the study of dna sequence evolution. Comput Biol Med 33(5):439–453
Mizas C, Sirakoulis G, Mardiris V, Karafyllidis I, Glykos N, Sandaltzopoulos R (2008) Reconstruction of DNA sequences using genetic algorithms and cellular automata: towards mutation prediction? Biosystems 92(1):61–68
Mizas C, Sirakoulis GC, Mardiris V, Karafyllidis I, Glykos N, Sandaltzopoulos R (2016) DNA cellular automata. In: Adamatzky A, Martínez GJ (eds) Designing beauty: the art of cellular automata. Springer, Cham, pp 127–128
Maji P, Parua S, Das S, Chaudhuri PP (2005) Cellular automata in protein coding region identification. In: Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, pp 479–484
Takata D, Isokawa T, Matsui N, Peper F (2013) Modeling chemical reactions in protein synthesis by a Brownian cellular automaton. In: First International Symposium on Computing and Networking, pp 527–532
Elsayed WM, Elmogy M, El-Desouky B (2017) Evolutionary behavior of DNA sequences analysis using non-uniform probabilistic cellular automata model. Cincia e Tcnica Vitivincola 32:137–148
Chopra P, Bender A (2006) Evolved cellular automata for protein secondary structure prediction imitate the determinants for folding observed in nature. Silico Biol 7(7):87–93
Santos J, Villot P, Dieguez M (2013) Cellular automata for modeling protein folding using the hp model. In: IEEE Congress on Evolutionary Computation (CEC), pp 1586–1593
Santos J, Villot P, Diéguez M (2014) Emergent protein folding modeled with evolved neural cellular automata using the 3d HP model. J Comput Biol 21(11):823–845
Varela D, Santos J (2017) Protein folding modeling with neural cellular automata using the face-centered cubic model. In: Ferrández Vicente JM, Álvarez-Sánchez JR, de la Paz López F, Toledo Moreo J, Adeli H (eds) Natural and artificial computation for biomedicine and neuroscience: international work-conference on the interplay between natural and artificial computation. Springer, Cham, pp 125–134
Madain A, Abu Dalhoum AL, Sleit A (2016) Computational modeling of proteins based on cellular automata. Int J Adv Comput Sci Appl 7(7):491–498
Madain A, Abu Dalhoum AL, Sleit A (2016) Protein folding in the two-dimensional hydrophobic polar model based on cellular automata and local rules. Int J Comput Sci Netw Secur 16(9):48–54
Madain A, Abu Dalhoum AL, Sleit A (2018) Application of local rules and cellular automata in representing protein translation and enhancing protein folding approximation. Prog Artif Intell. https://doi.org/10.1007/s13748-018-0146-8
Xiao X, Shao S, Ding Y, Huang Z, Chou KC (2006) Using cellular automata images and pseudo amino acid composition to predict protein subcellular location. Amino Acids 30(1):49–54
Xiao X, Ling W (2007) Using cellular automata images to predict protein structural classes. In: The 1st International Conference on Bioinformatics and Biomedical Engineering, 2007. ICBBE 2007. pp 346–349
Xiao X, Wang P, Chou KC (2008) Predicting protein structural classes with pseudo amino acid composition: an approach using geometric moments of cellular automaton image. J Theor Biol 254(3):691–696
Kavianpour H, Vasighi M (2017) Structural classification of proteins using texture descriptors extracted from the cellular automata image. Amino Acids 49(2):261–271
Xiao X, Wang P, Chou KC (2008) GPCR-CA: a cellular automaton image approach for predicting g-protein-coupled receptor functional classes. J Comput Chem 30(9):1414–1423
Diao Y, Ma D, Wen Z, Yin J, Xiang J, Li M (2008) Using pseudo amino acid composition to predict transmembrane regions in protein: cellular automata and lempel-ziv complexity. Amino Acids 34(1):111–117
Madain A, Abu Dalhoum AL, Sleit A (2016) Potentials and challenges of building computational models of proteins based on cellular automata. Int J Comput Sci Inf Secur 14(9):1086–1091
Paterson M, Przytycka T (1996) On the complexity of string folding. Discret Appl Math 71(1):217–230
Crescenzi P, Goldman D, Papadimitriou C, Piccolboni A, Yannakakis M (1998) On the complexity of protein folding (abstract). In: Proceedings of the Second Annual International Conference on Computational Molecular Biology, RECOMB ’98. ACM, New York, pp 61–62
Berger B, Leighton T (1998) Protein folding in the hydrophobic-hydrophilic (hp) is np-complete. In: Proceedings of the Second Annual International Conference on Computational Molecular Biology, RECOMB ’98. ACM, New York, pp 30–39
Lopes HS (2008) Evolutionary algorithms for the protein folding problem: a review and current trends. In: Smolinski TG, Milanova MG, Hassanien A-E (eds) Computational intelligence in biomedicine and bioinformatics: current trends and applications. Springer, Berlin, pp 297–315
Bokovi B, Brest J (2016) Genetic algorithm with advanced mechanisms applied to the protein structure prediction in a hydrophobic-polar model and cubic lattice. Appl Soft Comput 45(Suppl C):61–70
Wang S, Wu L, Huo Y, Wu X, Wang H, Zhang Y (2016) Predict two-dimensional protein folding based on hydrophobic-polar lattice model and chaotic clonal genetic algorithm. In: Yin H, Gao Y, Li B, Zhang D, Yang M, Li Y, Klawonn F, Tallón-Ballesteros AJ (eds) Intelligent data engineering and automated learning—IDEAL 2016: 17th international conference. Springer, Yangzhou, pp 10–17
Llanes A, Vélez C, Sánchez AM, Pérez-Sánchez H, Cecilia JM (2016) Parallel ant colony optimization for the HP protein folding problem. In: Ortuño F, Rojas I (eds) Bioinformatics and biomedical engineering: 4th international conference. Springer, Cham, pp 615–626
Lopes HS, Bitello R (2007) A differential evolution approach for protein folding using a lattice model. J Comput Sci Technol 22(6):904–908
Günther F, Möbius A, Schreiber M (2017) Structure optimisation by thermal cycling for the hydrophobic-polar lattice model of protein folding. Eur Phys J Special Top 226(4):639–649
Hart WE, Istrail S (1996) Fast protein folding in the hydrophobichydrophilic model within three-eighths of optimal. J Comput Biol 3(1):53–96
Lyngs RB, Pedersen CNS (1999) Protein folding in the 2d hp model. Techreport RS-99-16, BRICS Bioinformatics Research Center, University of Aarhus
Mauri G, Pavesi G (2000) Approximation algorithms for string folding problems. In: Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, TCS ’00. Springer-Verlag, London, pp 45–58
Acknowledgements
We would like to thank Dr. Khair Eddin Sabri, Dr. Loai Alnemer, and Dr. Rawan Ghnemat for their suggestions and comments that greatly improved the content of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Madain, A., Abu Dalhoum, A.L. & Sleit, A. Computational Modeling of Proteins based on Cellular Automata: A Method of HP Folding Approximation. Protein J 37, 248–260 (2018). https://doi.org/10.1007/s10930-018-9771-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10930-018-9771-0