PARALLELS BETWEEN GLUCONEOGENESIS AND SYNCHRONOUS MACHINES
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 1
Abstract
Biological diversity particularly at molecular level is astounding and can be used for rational manipulation of biological organisms. To analyze molecular diversity in its full scope computational models of biological organisms and biochemical pathways are indispensable. Engineering Sciences can be of great help in construction of these models. The central feature of modern engineering has been system level design. The differences between biological systems and engineering systems are notable, particularly at the molecular and device level. However, convergent evolution is thought to yield remarkable similarities at higher levels of organization. Here we compare an electrical engineering system with a biological system. We take the example of synchronous machines and gluconeogenesis. A biochemical system like gluconeogenesis is not just an assembly of enzymes. In addition to the list which catalogs the individual components, it is essential to understand how individual components dynamically interact during such operation. In such an attempt the concept of computational complexity is applied to both gluconeogenesis and synchronous machines The Church-Turing hypothesis is used as the basis to construct models of gluconeogenesis and synchronous machines . It is shown that both synchronous machines and gluconeogenesis accept context sensitive languages and models of computation of both the systems are universal. Thus we conclude that for construction of computational models of biochemical diversity in biological organisms, engineering systems can provide important clues.
Authors and Affiliations
Monendra Grover
Keywords
Related Articles
- EP ID EP129460
- DOI -
- Views 105
- Downloads 0
A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES
Generation and prioritization of test cases is one of the major issue in software testing.Maximum number of faults are identified through test cases only. Clients confidence can be gained through software testing. This p...
COMPARISON OF MULTICAST ROUTING PROTOCOLS IN AD-HOC WIRELESS NETWORKS
The majority of applications are in the areas where rapid deployment and dynamic reconfiguration are necessary and a wire line network is not available. These include military battlefields, emergency search and rescue si...
DISTRIBUTED DATA MINING AND MINING MULTI-AGENT DATA
The problem of distributed data mining isvery important in network problems. Ina distributed environment (such as a sensor or IP network), one has distributed probes placed at strategic locations within the network. The...
A Knowledge Based Approach for Recognizing Textual Entailment for Natural Language Inference using Data Mining
Recognizing Textual Entailment (RTE) is a relatively new roblem necessary for Natural Language Understanding (NLU) and Automated Knowledge Discovery. Natural Language Inference has dealt with approaches like the bag of...
COMPONENT-BASED HETEROGENEOUS SOFTWARE RCHITECTURE RELIABILITY (COHAR) MODELING
In this paper, we propose an analytical model for mponent-based heterogeneous software architecture reliability and a method to find the solution for finding the optimal eliability of the overall software system accor...