Team:MoWestern Davidson/acknowledgements
From 2009.igem.org
(Difference between revisions)
(9 intermediate revisions not shown) | |||
Line 7: | Line 7: | ||
*Dr. Tim Herman (Milwaukee School of Engineering) for generously providing resources for physical modeling of our tRNAs. <br><br> | *Dr. Tim Herman (Milwaukee School of Engineering) for generously providing resources for physical modeling of our tRNAs. <br><br> | ||
- | <span style="font-size: | + | <span style="font-size:Large">'''Funding Provided By'''</span><br> |
- | *NSF UBM grants to MWSU and Davidson <br> | + | ---- |
- | *HHMI | + | |
- | *James G. Martin Genomics Program <br> | + | *NSF UBM grants to MWSU (DMS-0733955) and Davidson (DMS-0733952)<br> |
+ | *HHMI grants 52005120 and 52006292 to Davidson <br> | ||
+ | *James G. Martin Genomics Program at Davidson <br> | ||
+ | *Missouri Western Foundation<br> | ||
+ | *Missouri Western Academic and Student Affairs <br> | ||
*Davidson Research Initiative <br><br> | *Davidson Research Initiative <br><br> | ||
Line 20: | Line 24: | ||
# Dasgupta S., Papadimitriou C., and U. Vazirani. 2008. '''Algorithms.''' McGraw Hill, Boston. | # 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. | # Karp R. 1972. "Reducibility among combinatorial problems." ''Complexity of Computer Computations.'' 85-103. | ||
+ | # Sakamoto, K., Gouzu, H., Komiya, K., et al. 2000. “Molecular Computation by DNA Hairpin Formation.” ''Science.'' 288:1223-1226. | ||
+ | # Rodriguez, E. A., Lester, H. A., Dougherty, D. A. 2005. “In vivo incorporation of multiple unnatural amino acids through nonsense and frameshift suppression.” ''PNAS.'' 103:8650-8655. | ||
+ | # Zhong P., Ashar P., Malik S., Martonosi M.. 1998. "Using reconfigurable computing techniques to accelerate problems in the CAD domain; a case study with Boolean satisfiability." ''Design Automation Conference Proceedings.'' 194-199. | ||
+ | # Sakamoto K., Hayashi A., Sakamoto A. et al. 2002. "Site-specific incorporation of an unnatural amino acid into proteins in mammalian cells." ''Nucleic Acids Research.'' 30:21. 4692-4699. | ||
+ | # Nakajima Y., Kimura T., Sugata K., et al. 2005. "Multicolor luciferase assay system: one-step monitoring of multiple gene expressions with a single substrate." ''BioTechniques.'' 38:891-894. | ||
+ | # Faulhammer D., Cukras A., Lipton R., Landweber L. 2000. "Molecular computation: RNA solutions to chess problems." ''PNAS.'' 97:4. 1385-1389. | ||
+ | # Chen J., Wood, DH.. 2000. "Computation with biomolecules." ''PNAS.'' 97:4. 1328-1330. | ||
+ | # Braich R, Chelyapov N.,Johnson C, Rothermund P., Adleman, L.. 14 March 2002. "Solution of a 20-variable 3-SAT problem on a DNA computer." ''Sciencexpress.'' www.sciencexpress.org/14 March 2002. | ||
+ | |||
<br><center>[[Image:DSC03544.JPG|400px]]</center><br><br> | <br><center>[[Image:DSC03544.JPG|400px]]</center><br><br> | ||
Latest revision as of 04:03, 21 October 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 (DMS-0733955) and Davidson (DMS-0733952)
- HHMI grants 52005120 and 52006292 to Davidson
- James G. Martin Genomics Program at Davidson
- Missouri Western Foundation
- Missouri Western Academic and Student Affairs
- Davidson Research Initiative
References
- Magliery T., Anderson J., and 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.
- Anderson J., Magliery T., and P. Schultz. 2002. "Exploring the limits of codon and anticodon size." Chemistry & Biology. 9: 237-244.
- 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.
- Sakamoto, K., Gouzu, H., Komiya, K., et al. 2000. “Molecular Computation by DNA Hairpin Formation.” Science. 288:1223-1226.
- Rodriguez, E. A., Lester, H. A., Dougherty, D. A. 2005. “In vivo incorporation of multiple unnatural amino acids through nonsense and frameshift suppression.” PNAS. 103:8650-8655.
- Zhong P., Ashar P., Malik S., Martonosi M.. 1998. "Using reconfigurable computing techniques to accelerate problems in the CAD domain; a case study with Boolean satisfiability." Design Automation Conference Proceedings. 194-199.
- Sakamoto K., Hayashi A., Sakamoto A. et al. 2002. "Site-specific incorporation of an unnatural amino acid into proteins in mammalian cells." Nucleic Acids Research. 30:21. 4692-4699.
- Nakajima Y., Kimura T., Sugata K., et al. 2005. "Multicolor luciferase assay system: one-step monitoring of multiple gene expressions with a single substrate." BioTechniques. 38:891-894.
- Faulhammer D., Cukras A., Lipton R., Landweber L. 2000. "Molecular computation: RNA solutions to chess problems." PNAS. 97:4. 1385-1389.
- Chen J., Wood, DH.. 2000. "Computation with biomolecules." PNAS. 97:4. 1328-1330.
- Braich R, Chelyapov N.,Johnson C, Rothermund P., Adleman, L.. 14 March 2002. "Solution of a 20-variable 3-SAT problem on a DNA computer." Sciencexpress. www.sciencexpress.org/14 March 2002.