Abstract
The protein folding problem is one of the most challenging problems in current biochemistry and is an important problem in bioinformatics. All current mathematical models of the problem are affected by intrinsic computational limits. The previous research offers few approaches that make use of multi-agent systems to resolve this problem. In this paper we present an agent-based framework for protein structure prediction, composed by autonomous agents which collaborate in order to find a solution using Distributed Constraint Programming (DisCSP/DisCOP). Each amino acid of an input protein is viewed as an autonomous agent that communicates with others by transmitting messages.
In this article was analysed the NetLogo environment with the purpose of building a general model of implementation and simulation for the protein structure prediction. Starting from the proposed implementation model with lattice models based on distributed constraints, in this article we present a multi-agent systems which can be used for the implementation and simulation of the protein structure prediction, that can run on a single computer or on a cluster computing environment. The version of the tool presented herein allows studying and exploring complex problems belonging principally to structural biology, such as protein folding.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181, 223–230 (1973)
Backofen, R., Will, S., Bornberg-Bauer, E.: Application of constraint programming techniques for structure prediction of lattice proteins with extended alphabets. Bioinformatics 15, 234–242 (1999)
Backofen, R.: The protein structure prediction problem: A constraint optimization approach using a new lower bound. Constraints 6(2-3), 223–255 (2001)
Berger, B., Leighton, T.: Protein folding in HP model is NP-complete. Journal of Computational Biology 5, 27–40 (1998)
Bortolussi, L., Dovier, A., Fogolari, F.: Agent-based protein structure prediction. Agent-based protein structure prediction. Multiagent and Grid Systems 3(2), 183–197 (2007)
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: Asynchronous Backtracking without Adding Links: A New Member in the ABT Family. Artificial Intelligence 161, 7–24 (2005)
Czibula, G., Bocicor, M.I., Czibula, I.G.: Solving the Protein Folding Problem Using a Distributed Q-Learning Approach. International Journal of Computer 5(3), 404–413 (2011)
Dill, K., Lau, K.: A lattice statistical mechanics model of the conformational sequence spaces of proteins. Macromolecules 22, 3986–3997 (1989)
Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M., Yee, D.P., Thomas, P.D., Chan, H.S.: Principles of protein folding - a perspective from simple exact models. Protein Science 4(4), 561–602 (1995)
Hart, W., Newman, A.: Protein Structure Prediction with Lattice Models. In: Handbook of Computational Molecular Biology. Chapman & Hall CRC Computer and Information Science Series, pp. 30-1–30-24 (2006)
Hoque, T.M., Chetty, M., Sattar, A.: Extended HP Model for Protein Structure Prediction. Journal of Computational Biology 16(1), 85–103 (2009)
Meisels, A.: Distributed Search by Constrained Agents: algorithms, performance, communication, pp. 105–120. Springer, London (2008)
Modi, P., Shen, W.-M., Tambe, M., Yokoo, M.: ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161(1-2), 149–180 (2005)
Muscalagiu, I., Iordan, A., Osaci, M., Panoiu, M.: Modelling and simulation of the protein folding problem in DisCSP-Netlogo. AWERProcedia Information Technology and Computer Science 2, 137–144 (2012)
Muscalagiu, I., Popa, H.E., Vidal, J.: Clustered Computing with NetLogo for the evaluation of asynchronous search techniques. In: 12th International Conference on Intelligent Software Methodologies, Tools and Techniques, Budapest, Hungary (2013)
Perez, P.P.G., Beltran, H.I., Rojo-Dominguez, A.: Multi-agent systems applied in the modelling and simulation of biological problems: A case study in protein folding, pp. 128–138. World Academy of Science, Engineering and Technology (2009)
Petcu, A.: A Class of Algorithms for Distributed Constraint Optimization. PhD. Thesis No. 3942, Swiss Federal Institute of Technology (EPFL), Lausanne (2007)
Skolnick, J., Kolinski, A.: Reduced models of proteins and their applications. Polymer 45, 511–524 (2004)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5), 673–685 (1998)
Wilensky, U.: NetLogo itself: NetLogo. Center for Connected Learning and Computer-Based Modelling. Northwestern University, Evanston (1999), http://ccl.northwestern.edu/netlogo/
Vidal, J.: Fundamentals of Multiagent Systems with NetLogo Examples (2009), http://multiagent.com/2010/02/multiagent-systems-textbook.html
Muscalagiu, I.: MAS NetLogo Models, http://discsp-netlogo.fih.upt.ro/
InfraGRID Cluster, http://hpc.uvt.ro/infrastructure/infragrid/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muscalagiu, I., Popa, H.E., Panoiu, M., Negru, V. (2013). Multi-agent Systems Applied in the Modelling and Simulation of the Protein Folding Problem Using Distributed Constraints. In: Klusch, M., Thimm, M., Paprzycki, M. (eds) Multiagent System Technologies. MATES 2013. Lecture Notes in Computer Science(), vol 8076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40776-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-40776-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40775-8
Online ISBN: 978-3-642-40776-5
eBook Packages: Computer ScienceComputer Science (R0)