Davidson Missouri W/Software

From 2007.igem.org

< Davidson Missouri W(Difference between revisions)
 
Line 14: Line 14:
#[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/adelman147.m Adelman's false positives with 14 edges / 7 nodes],
#[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/adelman147.m Adelman's false positives with 14 edges / 7 nodes],
#[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m Counter Program for Adelman's False Positives].
#[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpweighter.m Counter Program for Adelman's False Positives].
 +
 +
<br>
 +
<hr>
 +
<center>
 +
<[[Davidson Missouri W/Traveling Salesperson Problem | Previous Section]] | [[Davidson Missouri W/Resources and Citations | Next Section>]]
 +
</center>

Latest revision as of 18:06, 22 October 2007

Home | Background Information | Current Project: Solving the Hamiltonian Path Problem in vivo | Mathematical Modeling | Gene Splitting | Results | Traveling Salesperson Problem | Software | Resources and Citations


We have written computer software to help us with our projects.

  1. FlipLength,
  2. PureFlip,
  3. BiasWeighter,
  4. False positives for an 8 edge / 5 node graph,
  5. Counter Program for an 8 edge / 5 node graph,
  6. Adelman's false positives with 14 edges / 7 nodes,
  7. Counter Program for Adelman's False Positives.


< Previous Section | Next Section>

Retrieved from "http://2007.igem.org/wiki/index.php/Davidson_Missouri_W/Software"