"
Team:MoWestern Davidson/acknowledgements
From 2009.igem.org
(Difference between revisions)
| Line 13: | Line 13: | ||
'''References''' | '''References''' | ||
| - | + | # Magliery T., Anderson J., P. Schultz. 2001. "Expanding the genetic code: Selection of efficient suppressors of four-base codons and indentification of "shifty" four-base codons with a library approach in ''Escherichia coli''." ''J. Mol. Biol.'' 307:755-769. <br> | |
| - | + | # | |
| - | + | # Dasgupta S., Papadimitriou C., and U. Vazirani. 2008. '''Algorithms.''' McGraw Hill, Boston. | |
| - | + | # Karp R. 1972. "Reducibility among combinatorial problems." ''Complexity of Computer Computations.'' 85-103. | |
<br><center>[[Image:DSC03544.JPG|400px]]</center><br><br> | <br><center>[[Image:DSC03544.JPG|400px]]</center><br><br> | ||
Revision as of 14:23, 5 August 2009
Acknowledgements
- Dr. J. Christopher Anderson (UC Berkeley) for his guidance with the construction of suppressor tRNAs.
- Dr. Tim Herman (Milwaukee School of Engineering) for generously providing resources for physical modeling of our tRNAs.
Funding Provided By:
- NSF UBM grants to MWSU and Davidson
- HHMI grant to Davidson
- James G. Martin Genomics Program
- Davidson Research Initiative
References
- Magliery T., Anderson J., P. Schultz. 2001. "Expanding the genetic code: Selection of efficient suppressors of four-base codons and indentification of "shifty" four-base codons with a library approach in Escherichia coli." J. Mol. Biol. 307:755-769.
- Dasgupta S., Papadimitriou C., and U. Vazirani. 2008. Algorithms. McGraw Hill, Boston.
- Karp R. 1972. "Reducibility among combinatorial problems." Complexity of Computer Computations. 85-103.
