Abstract
The second chapter concentrates on establishing Cellular Automata (CA) representation of biomolecules. Current life form has evolved around three biomolecules DNA, RNA and Protein. DNA/RNA strands display a sugar–phosphate backbone to which nucleotide bases are bonded. Simple CA rules have been designed to represent the information content of the molecular structure of nucleic acid and the base triplets are referred to as codons. Proteins are the workhorse of living cells. Its building blocks are amino acids. A codon gets translated to an amino acid molecule. All the amino acids have a common backbone, which is interconnected to form a protein chain. In this background, simple CA rules designed for codons are employed for modelling amino acid backbone. Further, the side chain of an amino acid is also digitally coded with an 8-bit string used as the initial input for CA cells designed for backbone. Design of CA rules for micromolecules of life is referred to as bottom-up first principle informatics modelling. The evolution of CA designed with such rules generates certain model parameters. These parameters are mapped to the features extracted out of wet lab experimental results on these biomolecules. The top-down validation of the CA model is undertaken in the subsequent three chapters.
“I believe that new mathematical schemata, new systems of axioms, certainly new systems of mathematical structures will be suggested by the study of the living world”.
—Stanislaw Ulam
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
https://books.google.com › Computers › Programming › Algorithms
Harvey, I., Bossomaier, T.: Time out of joint: attractors in asynchronous random boolean networks. In: Proceedings of the Fourth European Conference on Artificial Life. MIT Press, Cambridge (1997)
Kanada, Y.: Asynchronous 1D cellular automata and the effects of fluctuation and randomness. In: Proceedings of the fourth Conference on artificial life (A-Life IV). MIT Press. 1994
Orponen, P.: Computing with truly asynchronous threshold logic networks. Theoret. Comput. Sci. 174(1–2), 123–136 (1997)
Haralick, R.M., Shanmugam, K.:. Textural features for image classification. IEEE Trans. Syst. Man Cybern. 6(1973), 610–621
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Pal Chaudhuri, P., Ghosh, S., Dutta, A., Pal Choudhury, S. (2018). Design of Cellular Automata Rules for Biomolecules. In: A New Kind of Computational Biology. Springer, Singapore. https://doi.org/10.1007/978-981-13-1639-5_2
Download citation
DOI: https://doi.org/10.1007/978-981-13-1639-5_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1638-8
Online ISBN: 978-981-13-1639-5
eBook Packages: Computer ScienceComputer Science (R0)