Davidson Missouri W/Software
From 2007.igem.org
< Davidson Missouri W(Difference between revisions)
Wideloache (Talk | contribs) |
Wideloache (Talk | contribs) |
||
| (7 intermediate revisions not shown) | |||
| 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/Mathematical Modeling| <span style="color:red">Mathematical Modeling</span>]] | [[Davidson Missouri W/Gene splitting| <span style="color:red"> Gene Splitting </span>]] | [[Davidson Missouri W/ | + | <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:red">Mathematical Modeling</span>]] | [[Davidson Missouri W/Gene splitting| <span style="color:red"> Gene Splitting </span>]] | [[Davidson Missouri W/Results| <span style="color:red">Results</span>]] | [[Davidson Missouri W/Traveling Salesperson Problem| <span style="color:red">Traveling Salesperson Problem</span> ]] | [[Davidson Missouri W/Software|<span style="color:black">Software</span>]] | [[Davidson Missouri W/Resources and Citations|<span style="color:red">Resources and Citations</span>]]</center> |
| - | + | ||
| + | <hr> | ||
| + | <br> | ||
We have written computer software to help us with our projects. | We have written computer software to help us with our projects. | ||
* [http://gcat.davidson.edu/IGEM06/oligo.html Oligo Cuts Optimization Program (Lance Harden, iGEM 2006)] | * [http://gcat.davidson.edu/IGEM06/oligo.html Oligo Cuts Optimization Program (Lance Harden, iGEM 2006)] | ||
* [[Davidson Missouri W/Web tool| Gene Splitter]] ([http://gcat.davidson.edu/iGEM07/genesplitting_source.txt source]) | * [[Davidson Missouri W/Web tool| Gene Splitter]] ([http://gcat.davidson.edu/iGEM07/genesplitting_source.txt source]) | ||
| - | * Matlab programs | + | * Matlab programs: |
| + | #[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fliplength.m FlipLength], | ||
| + | #[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/pureflip.m PureFlip], | ||
| + | #[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/biasweighter.m BiasWeighter], | ||
| + | #[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpVTgraph.m False positives for an 8 edge / 5 node graph], | ||
| + | #[http://gcat.davidson.edu/iGEM07/For_Missouri_Western/davidson85Iweighter.m Counter Program for an 8 edge / 5 node graph], | ||
| + | #[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]. | ||
| + | |||
| + | <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
We have written computer software to help us with our projects.
- [http://gcat.davidson.edu/IGEM06/oligo.html Oligo Cuts Optimization Program (Lance Harden, iGEM 2006)]
- Gene Splitter ([http://gcat.davidson.edu/iGEM07/genesplitting_source.txt source])
- Matlab programs:
- [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fliplength.m FlipLength],
- [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/pureflip.m PureFlip],
- [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/biasweighter.m BiasWeighter],
- [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/fpVTgraph.m False positives for an 8 edge / 5 node graph],
- [http://gcat.davidson.edu/iGEM07/For_Missouri_Western/davidson85Iweighter.m Counter Program for an 8 edge / 5 node graph],
- [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].
