Davidson Missouri W/Software
From 2007.igem.org
(Difference between revisions)
(false positives) |
|||
| Line 6: | Line 6: | ||
* [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: [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]. | + | * 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]. | ||
Revision as of 20:08, 10 October 2007
We have written computer software to help us with our projects.
- Oligo Cuts Optimization Program (Lance Harden, iGEM 2006)
- Gene Splitter (source)
- Matlab programs:
- FlipLength,
- PureFlip,
- BiasWeighter,
- False positives for an 8 edge / 5 node graph,
- Counter Program for an 8 edge / 5 node graph,
- Adelman's false positives with 14 edges / 7 nodes,
- Counter Program for Adelman's False Positives.
