Davidson Missouri W/Mathematical Modeling - Revision history

Amshoecraft at 18:45, 9 August 2007

2007-08-09T18:45:53Z

Amshoecraft at 15:13, 9 August 2007

2007-08-09T15:13:59Z

Amshoecraft at 15:09, 9 August 2007

2007-08-09T15:09:08Z

Amshoecraft at 15:08, 9 August 2007

2007-08-09T15:08:24Z

Amshoecraft at 14:42, 9 August 2007

2007-08-09T14:42:57Z

Amshoecraft: Davidson Missouri W/Probability and Statistics moved to Davidson Missouri W/Mathematical Modeling

2007-08-09T14:41:48Z

Davidson Missouri W/Probability and Statistics moved to Davidson Missouri W/Mathematical Modeling

Amshoecraft: /* True Positives / False Positives */

2007-08-09T14:23:34Z

‎True Positives / False Positives

Amshoecraft at 14:03, 9 August 2007

2007-08-09T14:03:08Z

Amshoecraft at 13:59, 9 August 2007

2007-08-09T13:59:29Z

Amshoecraft at 20:48, 8 August 2007

2007-08-08T20:48:02Z

@@ Line 34: / Line 34: @@
 = True Positives / False Positives =
-[[Image:5_node-wiki.jpg]]  Figure 1
+[[Image:5_node-wiki.jpg]]
 True positives are the Hamiltonian Path represented in the above graph with solid red arrows and below as the PCR Fragment Length where the edges after the Hamiltonian path can be arranged in any order.

@@ Line 42: / Line 42: @@
 A false positive is represented in the graph above with the solid red arrows and the dotted red arrow showing a "teleport" which causes this path to be a false positive. Teleporting occurs when an edge entering a node is followed by an edge leaving from a different node. Below you can see an extra edge that is highlighted, representing the teleport. In this example, the edge from 4 to 3 is followed by the edge from 4 to 5.
-[[Image:Falsep.jpg]]
+[[Image:Fpospic.jpg]]
 MATLAB programs used to find the false positives:

@@ Line 58: / Line 58: @@
 [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/adelman147.m 2. Adelman's false positives with 14 edges / 7 nodes]
-True Positives = 10,321,920
+true positives = 10,321,920
-False Positives = 168,006,848
+false positives = 168,006,848
 [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m 3. Counter Program for Adelman's False Positives]

@@ Line 48: / Line 48: @@
 MATLAB programs used to find the false positives:
-True Positives = 46,080
+[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpVTgraph.m 1. False positives for the 8 edge / 5 node graph shown above]
-[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpadelman.m 2. Adelman's False Positives with 14 nodes]
+true positives = 384
 True Positives = 10,321,920
@@ Line 59: / Line 62: @@
 [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m 3. Counter Program for Adelman's False Positives]
 Below are two graphs that show how quickly graphs can be complex so it makes the Hamiltonian Path harder to detect. Also, from these graphs you can tell that even though the graphs are very complex that there is still a 5% change of detecting a Hamiltonian Path or a true positive.

← Older revision		Revision as of 14:42, 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:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Davidson Missouri W/~~Probability and Statistics~~\| <span style="color:black">~~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:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] \| [[Davidson Missouri W/Mathematical Modeling\| <span style="color:black">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>

← Older revision	Revision as of 14:41, 9 August 2007
(No difference)

@@ Line 40: / Line 40: @@
 [[Image:True_positive.jpg]]
-A false positive is represented in the graph above with the solid red arrows and the dotted red arrow showing a teleport which causes this path to be a false positive. Also, below you can see with in the PCR Fragment Length there is an extra edge that is highlighted that represents the teleport.
+A false positive is represented in the graph above with the solid red arrows and the dotted red arrow showing a "teleport" which causes this path to be a false positive. Teleporting occurs when an edge entering a node is followed by an edge leaving from a different node. Below you can see an extra edge that is highlighted, representing the teleport. In this example, the edge from 4 to 3 is followed by the edge from 4 to 5.
 [[Image:Falsep.jpg]]

← Older revision		Revision as of 13:59, 9 August 2007
Line 54:		Line 54:
	[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m 3. Counter Program for Adelman's False Positives]		[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m 3. Counter Program for Adelman's False Positives]

		+	Below are two graphs that show how quickly graphs can be complex so it makes the Hamiltonian Path harder to detect. Also, from these graphs you can tell that even though the graphs are very complex that there is still a 5% change of detecting a Hamiltonian Path or a true positive.

		+	[[Image:Positivenodedg.jpg]] [[Image:Truetotalpos.jpg]]

	=Possion Model For the Number of Plasmids=		=Possion Model For the Number of Plasmids=

← Older revision		Revision as of 20:48, 8 August 2007
Line 41:		Line 41:

	A false positive is represented in the graph above with the solid red arrows and the dotted red arrow showing a teleport which causes this path to be a false positive. Also, below you can see with in the PCR Fragment Length there is an extra edge that is highlighted that represents the teleport.		A false positive is represented in the graph above with the solid red arrows and the dotted red arrow showing a teleport which causes this path to be a false positive. Also, below you can see with in the PCR Fragment Length there is an extra edge that is highlighted that represents the teleport.
		+
		+	[[Image:Falsep.jpg]]
		+
		+	[[Image:Pcrlength.jpg]]

	MATLAB programs used to find the false positives:		MATLAB programs used to find the false positives: