"
Team:UNIPV-Pavia/Project
From 2008.igem.org
| Line 19: | Line 19: | ||
== '''Overall project''' == | == '''Overall project''' == | ||
| - | + | We are trying to mimic Multiplexer (Mux) and Demultiplexer (Demux) logic functions in E. coli. | |
| + | <br> | ||
| + | In the following paragraphs project details will be described from both digital electronic and genetic points of view. | ||
| + | == '''Electronic Implementation''' == | ||
| + | <br> | ||
| + | === What kind of components are Mux and Demux? === | ||
| + | <br> | ||
| + | === What kind of signals do we process? === | ||
| + | In this project we consider Boolean logic signals, thus every input/output value can assume only the values of 0 and 1. A function that processes Boolean values is called logic function. | ||
| + | <br> | ||
| + | Mux and Demux can be considered by now as black boxes which implement a logic function that can process input signals to output signals. In the following documentation we will see what is inside this black boxes. | ||
| + | <br> | ||
| + | === How can we formalize Mux and Demux logic behavior? === | ||
| + | Logic functions can be formalized writing a truth table; a truth table is a mathematical table in which every row represents a combination of input values and its respective output values. The table has to be filled with every input combination. | ||
| + | <br> | ||
| + | Here you can see Mux and Demux truth tables: | ||
| + | <br> | ||
| + | === Building a logic circuit from a truth table === | ||
| + | Our goal in this section is to project two logic gates networks which behave like Mux and Demux truth tables in E. coli. A very useful tool to transform a truth table into a logic network is Karnaugh map. | ||
| + | <br> | ||
| + | It is possible to read about Karnaugh maps at: | ||
| + | Following Karnaugh maps method, we can write these two maps and these two logic networks for Mux and Demux: | ||
| + | <br> | ||
| - | + | == '''Genetic Implementation''' == | |
| - | + | ||
| - | == | + | |
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
=== The Experiments === | === The Experiments === | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
== Results == | == Results == | ||
Revision as of 14:08, 8 June 2008
 Home
|  The Team
|  The Project
|  Biological Safety
|  Parts Submitted to the Registry
|
|---|---|---|---|---|
 Dry Lab
|  Wet Lab
|  Modeling
|  Protocols
|  Activity Notebook
|
Contents |
Overall project
We are trying to mimic Multiplexer (Mux) and Demultiplexer (Demux) logic functions in E. coli.
In the following paragraphs project details will be described from both digital electronic and genetic points of view.
Electronic Implementation
What kind of components are Mux and Demux?
What kind of signals do we process?
In this project we consider Boolean logic signals, thus every input/output value can assume only the values of 0 and 1. A function that processes Boolean values is called logic function.
Mux and Demux can be considered by now as black boxes which implement a logic function that can process input signals to output signals. In the following documentation we will see what is inside this black boxes.
How can we formalize Mux and Demux logic behavior?
Logic functions can be formalized writing a truth table; a truth table is a mathematical table in which every row represents a combination of input values and its respective output values. The table has to be filled with every input combination.
Here you can see Mux and Demux truth tables:
Building a logic circuit from a truth table
Our goal in this section is to project two logic gates networks which behave like Mux and Demux truth tables in E. coli. A very useful tool to transform a truth table into a logic network is Karnaugh map.
It is possible to read about Karnaugh maps at:
Following Karnaugh maps method, we can write these two maps and these two logic networks for Mux and Demux:
