Davidson: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{Davidson_Top}} | {{Davidson_Top}} | ||
<font | My most recent students conduct research in field of synthetic biology. I have a few related student projects underway as part of our NSF-funded grant Synthetic Biology Research for Undergraduate (SyBR-U). We meet weekly to discuss the interactions between math and biology during our BioMath Connections video conference with collaborators at Missouri Western State University. | ||
For the [[Davidson_Missouri_W |iGEM2007 team]], 6 students worked at Davidson College (Oyinade Adefuye {NCCU student}, [[Will DeLoache |Will DeLoache]], [[Jim Dickson |Jim Dickson]], [[Andrew Martens |Andrew Martens]], Amber Shoecraft {JCSU student}, and [[Mike Waters |Mike Waters]]) worked in collaboration with students at Missouri Western State University to design and build a bacterial computer that could solve the Hamiltonian Path Problem: given a directed graph (see below), is it possible to visit every node exactly once when starting and stopping at particular nodes? | |||
<html> | |||
<div align="center"> | |||
<p align="center"><font size="4"><a href="#" onMouseOut="MM_swapImgRestore()" onMouseOver="MM_swapImage('Image10','','http://www.bio.davidson.edu/people/macampbell/students/HPP2.jpg',1)"><img src="http://www.bio.davidson.edu/people/macampbell/students/HPP1.jpg" name="Image10" width="455" height="404" border="0"></a></font></p> | |||
</html> | |||
Revision as of 12:20, 28 November 2007
|
My most recent students conduct research in field of synthetic biology. I have a few related student projects underway as part of our NSF-funded grant Synthetic Biology Research for Undergraduate (SyBR-U). We meet weekly to discuss the interactions between math and biology during our BioMath Connections video conference with collaborators at Missouri Western State University. For the iGEM2007 team, 6 students worked at Davidson College (Oyinade Adefuye {NCCU student}, Will DeLoache, Jim Dickson, Andrew Martens, Amber Shoecraft {JCSU student}, and Mike Waters) worked in collaboration with students at Missouri Western State University to design and build a bacterial computer that could solve the Hamiltonian Path Problem: given a directed graph (see below), is it possible to visit every node exactly once when starting and stopping at particular nodes? <html> <div align="center"> <p align="center"><font size="4"><a href="#" onMouseOut="MM_swapImgRestore()" onMouseOver="MM_swapImage('Image10','','http://www.bio.davidson.edu/people/macampbell/students/HPP2.jpg',1)"><img src="http://www.bio.davidson.edu/people/macampbell/students/HPP1.jpg" name="Image10" width="455" height="404" border="0"></a></font></p>
</html> |
