Davidson Missouri W/Solving the HPP in vivo - Revision history

Amshoecraft at 15:17, 9 August 2007

2007-08-09T15:17:34Z

Synthetic Students at 16:15, 25 July 2007

2007-07-25T16:15:29Z

Synthetic Students: move TSP info to other page

2007-07-25T16:10:29Z

move TSP info to other page

Synthetic Students: /* How We Solve it */

2007-07-11T19:48:53Z

‎How We Solve it

Synthetic Students at 19:40, 11 July 2007

2007-07-11T19:40:53Z

Synthetic Students: Solving the HPP in vivo moved to Davidson Missouri W/Solving the HPP in vivo

2007-07-11T19:34:07Z

Solving the HPP in vivo moved to Davidson Missouri W/Solving the HPP in vivo

Synthetic Students at 19:28, 11 July 2007

2007-07-11T19:28:57Z

Synthetic Students at 18:19, 9 July 2007

2007-07-09T18:19:04Z

Synthetic Students at 18:13, 9 July 2007

2007-07-09T18:13:40Z

WikiSysop: /* What is it? */

2007-07-08T00:10:05Z

‎What is it?

← Older revision		Revision as of 15:17, 9 August 2007
Line 1:		Line 1:
−	<center>[[Davidson Missouri W\| <span style="color:red">Home</span>]] \| [[Davidson Missouri W/Background Information\| <span style="color:red">Background Information</span>]] \| [[Davidson Missouri W/Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Davidson Missouri W/~~Probability and Statistics~~\| <span style="color:red">~~Probability and Statistics~~</span>]] \| [[Davidson Missouri W/Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Davidson Missouri W/Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Davidson Missouri W/Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Davidson Missouri W/Backwards promotion and read-through transcription\| <span style="color:red">Backwards Promotion and Read-Through Transcription</span>]] \| [[Davidson Missouri W/Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>	+	<center>[[Davidson Missouri W\| <span style="color:red">Home</span>]] \| [[Davidson Missouri W/Background Information\| <span style="color:red">Background Information</span>]] \| [[Davidson Missouri W/Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Davidson Missouri W/Mathematical Modeling\| <span style="color:red">Mathematical Modeling</span>]] \| [[Davidson Missouri W/Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Davidson Missouri W/Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Davidson Missouri W/Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Davidson Missouri W/Backwards promotion and read-through transcription\| <span style="color:red">Backwards Promotion and Read-Through Transcription</span>]] \| [[Davidson Missouri W/Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>

	<hr>		<hr>

@@ Line 3: / Line 3: @@
 <hr>
-Using the same flipping mechanism, we are trying to develop a bacterial computer which solves a new type of mathematical problem, the ''Hamiltonian Path'' problem
+Using the Hin/''HixC'' flipping mechanism, we are developing a bacterial computer which solves a specific mathematical problem, the ''Hamiltonian Path'' problem.
 =The Hamiltonian Path Problem=

← Older revision		Revision as of 16:10, 25 July 2007
Line 17:		Line 17:
	==Developing Nodes==		==Developing Nodes==
	We represent the graph's nodes with reporter genes. In order to allow for flipping, we must insert ''HixC'' sites within the coding regions of our reporter genes. We call this process [[Gene splitting\|''gene splitting'']]. If our reporter gene tolerates a ''HixC'' insertion then we can use it as a node on our graph.		We represent the graph's nodes with reporter genes. In order to allow for flipping, we must insert ''HixC'' sites within the coding regions of our reporter genes. We call this process [[Gene splitting\|''gene splitting'']]. If our reporter gene tolerates a ''HixC'' insertion then we can use it as a node on our graph.
−
−	~~=The Traveling Salesman Problem=~~
−	~~Although our current project is to develop a bacterial computer that solves Hamiltonian path problems, in the future we would like to tackle the Traveling Salesman problem using similar methods.~~
−
−	~~==What is it?==~~
−	~~Given a directed graph where each edge has a cost associated with it, what is the cheapest, or shortest, path to take such that you end at your starting point and visit every node exactly once?~~
−
−	~~==How We Solve it==~~
−	The addition of spacers in between nodes allows us to tackle this problem with the same flipping mechanism that we employ in our Hamiltonian path computer. Please visit [[Davidson Missouri W/Traveling_Salesperson_Problem\|this page]] for more information.

← Older revision		Revision as of 19:48, 11 July 2007
Line 25:		Line 25:

	==How We Solve it==		==How We Solve it==
−	The addition of spacers in between nodes allows us to tackle this problem with the same flipping mechanism that we employ in our Hamiltonian path computer. Please visit [[Traveling_Salesperson_Problem\|this page]] for more information.	+	The addition of spacers in between nodes allows us to tackle this problem with the same flipping mechanism that we employ in our Hamiltonian path computer. Please visit [[Davidson Missouri W/Traveling_Salesperson_Problem\|this page]] for more information.

← Older revision		Revision as of 19:40, 11 July 2007
Line 1:		Line 1:
−	<center>[[Davidson/Missouri W\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards ~~promotion~~ and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>	+	<center>[[Davidson Missouri W\| <span style="color:red">Home</span>]] \| [[Davidson Missouri W/Background Information\| <span style="color:red">Background Information</span>]] \| [[Davidson Missouri W/Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Davidson Missouri W/Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Davidson Missouri W/Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Davidson Missouri W/Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Davidson Missouri W/Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Davidson Missouri W/Backwards promotion and read-through transcription\| <span style="color:red">Backwards Promotion and Read-Through Transcription</span>]] \| [[Davidson Missouri W/Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>

	<hr>		<hr>

← Older revision	Revision as of 19:34, 11 July 2007
(No difference)

← Older revision		Revision as of 19:28, 11 July 2007
Line 1:		Line 1:
−	<center>[[Davidson/Missouri ~~Western iGEM 2007~~\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards promotion and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>	+	<center>[[Davidson/Missouri W\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards promotion and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>

	<hr>		<hr>

← Older revision		Revision as of 18:19, 9 July 2007
Line 1:		Line 1:
−	<center>[[Davidson/Missouri Western iGEM 2007\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:~~red~~">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards promotion and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>	+	<center>[[Davidson/Missouri Western iGEM 2007\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:black">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards promotion and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>

	<hr>		<hr>

← Older revision		Revision as of 18:13, 9 July 2007
Line 1:		Line 1:
		+	<center>[[Davidson/Missouri Western iGEM 2007\| <span style="color:red">Home</span>]] \| [[Background Information\| <span style="color:red">Background Information</span>]] \| [[Solving the HPP in vivo\| <span style="color:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Probability and Statistics\| <span style="color:red">Probability and Statistics</span>]] \| [[Gene splitting\| <span style="color:red"> Gene Splitting </span>]] \| [[Controlling Expression\| <span style="color:red"> Controlling Expression </span>]] \| [[Traveling Salesperson Problem\| <span style="color:red">Traveling Salesperson Problem</span> ]] \| [[Backwards promotion and read-through transcription\| <span style="color:red">Backwards promotion and Read-Through Transcription</span>]] \| [[Resources and Citations\|<span style="color:red">Resources and Citations</span>]]</center>
		+
		+	<hr>
		+
	Using the same flipping mechanism, we are trying to develop a bacterial computer which solves a new type of mathematical problem, the ''Hamiltonian Path'' problem		Using the same flipping mechanism, we are trying to develop a bacterial computer which solves a new type of mathematical problem, the ''Hamiltonian Path'' problem

@@ Line 18: / Line 18: @@
 ==What is it?==
-Given a directed graph where each edge has a cost associated with it, what is the cheapest, or shortest, path to take such that you arrive at your starting point and visit every node exactly once?
+Given a directed graph where each edge has a cost associated with it, what is the cheapest, or shortest, path to take such that you end at your starting point and visit every node exactly once?
 ==How We Solve it==
 The addition of spacers in between nodes allows us to tackle this problem with the same flipping mechanism that we employ in our Hamiltonian path computer.  Please visit [[Traveling_Salesperson_Problem|this page]] for more information.