Advertisement
Published in:
2010 | OriginalPaper | Chapter
Theory and Application of Equal Length Cycle Cellular Automata (ELCCA) for Enzyme Classification
Authors : Soumyabrata Ghosh, Tirthankar Bachhar, Nirmalya S. Maiti, Indrajit Mitra, P. Pal Chaudhuri
Published in: Cellular Automata
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.