Skip to main content

Theory and Application of Equal Length Cycle Cellular Automata (ELCCA) for Enzyme Classification

  • Conference paper
Cellular Automata (ACRI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6350))

Included in the following conference series:

  • 1782 Accesses

Abstract

A special class of n cell null boundary invertible three neighborhood CA referred to as Equal Length Cycle CA (ELCCA) is proposed in this paper to represent the features of n bit symbol strings. Necessary and sufficient conditions for generation of ELCCA has been reported. A specific set of ELCCA cycles are selected by employing the mRMR algorithm [2] popularly used for feature extraction of symbol strings. An algorithm is next developed to classify the symbol strings based on the feature set extracted. The proposed CA model has been validated for analyzing symbol string of biomolecules referred to as Enzymes. These biomolecules are classified on the basis of the catalytic reaction they participate. The symbol string classification algorithm predicts the class of any input enzyme with accuracy varying from 90.4% to 98.6%. Experimental results have been reported for 22800 enzymes with wide variation in species.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Webb, A.R.: Statistical pattern recognition, 2nd edn. John Wiley, New York (2002)

    Book  MATH  Google Scholar 

  2. Peng, H., Long, F., Ding, C.: Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(8), 1226–1238 (2005)

    Article  Google Scholar 

  3. Liew, A.W.-C., Yan, H., Yang, M.: Pattern recognition techniques for the emerging field of bioinformatics: A review Pattern Recognition 38, 2055–2073 (2005)

    Google Scholar 

  4. Toffoli, T., Margolus, N.: Cellular Automata Machines A New Environment for Modeling. MIT Press, Cambridge (1987), ISBN: 0-262-20060-0

    MATH  Google Scholar 

  5. Chaudhuri, P.P., Chowdhury, D.R., et al.: Additive Cellular Automata: Theory and Applications. John Wiley and Sons, Chichester (1997), ISBN: 0818677171, 9780818677175

    Google Scholar 

  6. Wolfram, S.: New Kind of Science. Wolfram Media Inc., Champaign ISBN- 1-57955-008-8

    Google Scholar 

  7. Maiti, N.S., Ghosh, S., Munshi, S., Pal Chaudhuri, P.: Linear Time Algorithm to Identify Invertibility of Null-Boundary Three Neighborhood Cellular Automata. To be published on Complex Systems 19(1) (2010)

    Google Scholar 

  8. Expasy Swiss-Prot Enzyme nomenclature database, http://www.expasy.ch/enzyme/

  9. UniProtKB Protein Knowledgebase by EBI, PIR and SIB, http://www.uniprot.org/uniprot/

  10. Webb, E.C.: Enzyme nomenclature 1984: recommendations of the Nomenclature Committee of the International Union of Biochemistry on the nomenclature and classification of enzyme-catalysed reactions. In: International Union of Biochemistry. Academic Press, London (1984)

    Google Scholar 

  11. Davison, A.C., Hinkley, D.V., Canty, A.J.: Bootstrap Methods and Their Application, 2nd edn. Cambridge University Press, Cambridge (1999), ISBN: 9780521574716

    Google Scholar 

  12. Harper, H.A., Martin, D.W.: Harper’s Review of Biochemistry Lange Medical Publications (1985), ISBN: 0870410385, 9780870410383

    Google Scholar 

  13. des Jardins, M., Karp, P.D., Krummenacker, M., Lee, T.J., Ouzounis, C.A.: Prediction of enzyme classification from protein sequence without the use of sequence similarity. In: Proc. Int. Conf. Intell. Syst. Mol. Biol., vol. 5, pp. 92–99 (1997)

    Google Scholar 

  14. John, G.H., Langley, P.: Estimating Continuous Distributions in Bayesian Classifier. In: Eleventh Conference on Uncertainty in Artificial Intelligence, San Mateo, pp. 338–345 (1995)

    Google Scholar 

  15. van der Walt, C.M.: Maximum Likelihood Gaussian Classifier (2007), http://www.patternrecognition.co.za

  16. King, R.D., Karwath, A., Clare, A., Dehaspe, L.: The utility of different representations of protein sequence for predicting functional class. Bioinformatics 17(5) (2001)

    Google Scholar 

  17. Henrissat, B.: A classification of glycosyl hydrolases based on amino acid sequence similarities. Biochem. J. 280(Pt. 2), 309–316 (1991)

    Article  Google Scholar 

  18. Schiff, J.L.: Cellular Automata A Discrete View of the World. Wiley & Sons, Inc., Chichester, ISBN: 047016879X

    Google Scholar 

  19. Chopard, B., Droz, M.: Cellular Automata Modeling of Physical Systems. Cambridge University Press, Cambridge (1998), ISBN: 0-521-46168-5

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, S., Bachhar, T., Maiti, N.S., Mitra, I., Pal Chaudhuri, P. (2010). Theory and Application of Equal Length Cycle Cellular Automata (ELCCA) for Enzyme Classification. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15979-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15978-7

  • Online ISBN: 978-3-642-15979-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics