Boolean algebraic structures of the genetic code: possibilities of applications

Authors:
Ricardo Grau;Maria Del C. Chavez;Robersy Sanchez;Eberto Morgado;Gladys Casas;Isis Bonet
Affiliations:
Center of Studies on Informatics, Central University of Las Villas, Santa Clara, Cuba;Center of Studies on Informatics, Central University of Las Villas, Santa Clara, Cuba;Research Institute of Tropical Roots, Tuber Crops and Banana, Biotechnology Group, Santo Domingo, Cuba;Center of Studies on Informatics, Central University of Las Villas, Santa Clara, Cuba;Center of Studies on Informatics, Central University of Las Villas, Santa Clara, Cuba;Center of Studies on Informatics, Central University of Las Villas, Santa Clara, Cuba
Venue:
KDECB'06 Proceedings of the 1st international conference on Knowledge discovery and emergent complexity in bioinformatics
Year:
2006

Citing 4
Cited 0

Planning to learn about protein structure

Artificial intelligence and molecular biology
Multiple graph matching with Bayesian inference

Pattern Recognition Letters - special issue on pattern recognition in practice V
Expert Systems and Probabiistic Network Models

Expert Systems and Probabiistic Network Models
SpliceMachine: predicting splice sites from high-dimensional local context representations

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Authors had reported before two dual Boolean algebras to understand the underlying logic of the genetic code structure. In such Boolean structures, deductions have physico-chemical meaning. We summarize here that these algebraic structures can help us to describe the gene evolution process. Particularly in the experimental confrontation, it was found that most of the mutations of several proteins correspond to deductions in these algebras and they have a small Hamming distance related to their respective wild type. Two applications of the corresponding codification system in bioinformatics problems are also shown. The first one is the classification of mutations in a protein. The other one is related with the problem of detecting donors and acceptors in DNA sequences. Besides, pure mathematical models, Statistical techniques (Decision Trees) and Artificial Intelligence techniques (Bayesian Networks) were used in order to show how to accomplish them to solve these knowledge-discovery practical problems.