Team:Alberta

From 2013.igem.org

(Difference between revisions)
 
(43 intermediate revisions not shown)
Line 48: Line 48:
     }
     }
     .titlebar h3, h4 {
     .titlebar h3, h4 {
-
       text-align:center;
+
       text-align:left;
     }
     }
     .sidebar {
     .sidebar {
-
       position:fixed;
+
       position: fixed;
-
       top:190px;
+
       top: 157px;
-
       float:left;
+
       float: left;
-
       z-index:3;
+
       z-index: 3;
-
       padding: 0 0px 0px 40px;
+
       padding: 10px 10px 10px 10px;
 +
      width: 230px;
     }
     }
 +
    .sidebar_block {
 +
      background-color:white;
 +
      margin:1px;
 +
      border:1px grey solid;
 +
      padding:5px 10px 5px 10px;
 +
      border-radius:5px;
 +
      box-shadow: 0px 0px 20px #444444;
 +
    }
     .main {
     .main {
       position:relative;
       position:relative;
Line 74: Line 83:
       position:fixed;
       position:fixed;
       margin-left:650px;
       margin-left:650px;
-
       margin-top:-100px;
+
       margin-top:-95px;
       width: 150px;
       width: 150px;
 +
    }
 +
    .igem-logo img {
 +
      width:210px;
     }
     }
     .igem-bar {
     .igem-bar {
Line 367: Line 379:
       box-shadow: 0px 0px 30px #000;
       box-shadow: 0px 0px 30px #000;
        
        
 +
    }
 +
    a.anchor{
 +
      display: block;
 +
      position: relative;
 +
      top: -180px;
 +
      visibility: hidden;
     }
     }
   </style>
   </style>
Line 372: Line 390:
   <body>
   <body>
     <div class="titlebar">
     <div class="titlebar">
-
<br>
+
<br/>
-
      <h3><font color="#A80000"><font size="6">The Littlest Mapmaker</font></font></h3>
+
<img src="/wiki/images/4/41/Ab_mapmen_title.png" width="600" height="95"></img><img src="/wiki/images/a/a5/2013-igem-logo.png" width="198" height="95"></img>
-
      <h4><i><font size="2">"Exploration into the world of <font color="#A80000">DNA Computing</font>"<br/>
+
 
-
        Team Alberta: University of Alberta</font></i></h4>
+
-
      <a href="http://www.ualberta.ca" class="ualberta-logo"><img src="/wiki/images/b/b3/Ualberta-logo.png" alt="University of Alberta"></img></a>
+
-
      <a href="https://2013.igem.org" class="igem-logo"><img src="/wiki/images/a/ad/IGem-logo.png" alt="iGem Main Page"></img></a>
+
     </div>
     </div>
     <div class="bin">
     <div class="bin">
       <ul class="navbar">
       <ul class="navbar">
         <li><i class="nav-icon"></i><a  href="/Team:Alberta" class="active">Home</a></li>
         <li><i class="nav-icon"></i><a  href="/Team:Alberta" class="active">Home</a></li>
-
         <li><a id="project" href="#">Project</a>
+
         <li><a id="project" href="#"">Project</a>
           <ul>
           <ul>
             <li><a href="/Team:Alberta/Background">Background</a></li>
             <li><a href="/Team:Alberta/Background">Background</a></li>
             <li><a href="/Team:Alberta/Overview">Overview</a></li>
             <li><a href="/Team:Alberta/Overview">Overview</a></li>
-
            <li><a href="/Team:Alberta/FutureDevelopment">Future Development</a></li>
 
-
          </ul>
 
-
        </li>
 
-
        <li><a id="notebook" href="#">Notebook</a>
 
-
          <ul>
 
             <li><a href="/Team:Alberta/Results">Results</a></li>
             <li><a href="/Team:Alberta/Results">Results</a></li>
             <li><a href="/Team:Alberta/Protocols">Protocols</a></li>
             <li><a href="/Team:Alberta/Protocols">Protocols</a></li>
-
             <li><a href="/Team:Alberta/Parts">BioBricks</a></li>
+
             <li><a href="/Team:Alberta/Parts">Submitted Parts</a></li>
 +
            <li><a href="/Team:Alberta/Accomplishments">Accomplishments</a></li>
           </ul>
           </ul>
         </li>
         </li>
Line 400: Line 411:
             <li><a href="/Team:Alberta/Team">Roster</a></li>
             <li><a href="/Team:Alberta/Team">Roster</a></li>
             <li><a href="https://igem.org/Team.cgi?year=2013&team_name=Alberta">Official Profile</a></li>
             <li><a href="https://igem.org/Team.cgi?year=2013&team_name=Alberta">Official Profile</a></li>
-
             <li><a href="/Team:Alberta/Attributions">Sponsors</a></li>
+
             <li><a href="/Team:Alberta/Sponsors">Sponsors</a></li>
 +
            <li><a href="/Team:Alberta/Attributions">Attributions</a></li>
           </ul>
           </ul>
         </li>
         </li>
Line 409: Line 421:
           </ul>
           </ul>
         </li>
         </li>
-
         <li><a id="safety" href="#">Safety</a>
+
         <li><a href="/Team:Alberta/MainSafety">Safety</a>
           <ul>
           <ul>
             <li><a href="/Team:Alberta/SafetyForm">Safety Form</a></li>
             <li><a href="/Team:Alberta/SafetyForm">Safety Form</a></li>
Line 416: Line 428:
           </ul>
           </ul>
         </li>
         </li>
 +
      <div class="igem-bar"><a href="https://2013.igem.org"><img src="/wiki/images/a/ad/IGem-logo.png"></img></a></div>
       </ul>
       </ul>
       <div class="sidebar">
       <div class="sidebar">
-
         <div href class="tooltip"><img src="/wiki/images/7/7d/SideChar.png"></img>  
+
         <div class="sidebar_block">
-
          <span class="saying">Welcome to the Team Alberta Wiki!
+
<br>
-
            <div id="box" style="width: 450px; padding: 5px; background-color: #FFFFFF;">
+
<img src=" /wiki/images/2/2d/Background_icon.png " align="left" width="50" height="50"></img>Curious about the possibilities of biocomputing? Need of a crash course on travelling salesman problems? Visit our <a href="https://2013.igem.org/Team:Alberta/Background">background page</a> for more information on the real-world applications of our project.
-
            <div id="template" style="text-align: left; font-weight: normal; font-size: 14px; color: #000000; padding: 5px;">
+
<br>
-
              I’ve been hard at work to frustrate as well as teach 10 students (from high school to undergraduate to recently graduated). Learn about my other roles and how I have successful <a href="/Team:Alberta/Results">results</a> for solving a computational problem!
+
<br>
-
            </div>
+
<img src="/wiki/images/thumb/b/bf/Workings_icon.png/610px-Workings_icon.png " align="left" width="50" height="50"></img>
-
            </div>
+
Want to get straight to the details of what Team Alberta has been working on this summer? Read up in the <a href="https://2013.igem.org/Team:Alberta/Overview">overview</a> and <a href="https://2013.igem.org/Team:Alberta/Results">results</a> pages to see what we've achieved.
-
          </span>
+
<br>
 +
<br>
 +
      <img src=" /wiki/images/thumb/f/f6/Peoples_icon.png/618px-Peoples_icon.png" align="left" width="50" height="50"></img>Or maybe you'd like to get to know the team itself, those who have helped us along and those we've helped in turn? See the <a href="https://2013.igem.org/Team:Alberta/Team">team roster</a>, <a href="https://2013.igem.org/Team:Alberta/Attributions">sponsors</a> and <a href="https://2013.igem.org/Team:Alberta/Outreach">outreach</a> pages to meet everyone who's participated.
         </div>
         </div>
       </div>
       </div>
Line 433: Line 448:
       </div-->
       </div-->
       <div class="block">
       <div class="block">
 +
        <h3 class="centered">
 +
          Welcome to the Team Alberta website! Our project pushes the limits of Synthetic Biology to create massively parallel, highly selective biological computers.
 +
        </h3><br />
         <img src="/wiki/images/e/e8/Mapmaker-banner.jpg"
         <img src="/wiki/images/e/e8/Mapmaker-banner.jpg"
-
           style="width:100%;"></img><br />
+
           style="width:85%;"></img>
-
        <h3 class="centered">
+
-
          Team Alberta represents the University of Alberta, from Edmonton.
+
-
          Our project, "The Littlest Mapmaker," is an attempt to create a biological
+
-
          computer capable of solving the Traveling Salesman Problem. The importance of this project may include optimization for network companies to save costs and time!
+
-
        </h3>
+
-
      </div>
+
-
      <div class="block">
+
-
      <p>
+
-
        The traveling salesman problem is a mathematical optimization problem that was
+
-
        first formally described in 1930, and has been intensively studied in the computer
+
-
        sciences as a benchmark for optimization algorithms. The problem asks:
+
-
      </p>
+
-
      <p class="centered-well">
+
-
        Given a set of cities (or other destinations), and a list of the distances
+
-
        (or the travel time, fuel consumption, et cetera) between each pair of those cities,
+
-
        what is the shortest possible route that travels to every city exactly once, and
+
-
        then returns to the origin city?
+
-
      </p>
+
-
      <p>
+
-
        In our project, we use DNA to compute solutions by converting all of the elements
+
-
        of the problem into representative sequences of DNA: cities become selectable marker
+
-
        genes (specifically, antibiotic resistance genes), paths between the cities become
+
-
        short, sticky-ended linkers (each of which is only able to ligate to two specific
+
-
        “city” strands), and the distance of a given path is represented by the concentration
+
-
        of the corresponding linker in solution. These pieces of DNA are successively ligated
+
-
        together to produce plasmids that signify “routes”, where the order in which the genes
+
-
        appear in the plasmid indicates the order in which the cities are visited.
+
-
      </p>
+
-
      <div class="thumbnails">
+
-
        <div class="thumbnail">
+
-
          <img src="/wiki/images/thumb/c/c7/Sample_product.png/300px-Sample_product.png"></img>
+
-
        </div>
+
-
        <div class="thumbnail">
+
-
          <img src="/wiki/images/thumb/4/45/Sample_route.png/650px-Sample_route.png"></img>
+
-
        </div>
+
-
      </div>
+
-
      <div class="clear"></div>
+
-
      <p>
+
-
        The resulting plasmids are transformed into a bacterial culture, so that we can select
+
-
        for only those plasmids that include every city in the list. Then, plasmid DNA is
+
-
        extracted from the surviving bacterial colonies and analyzed to determine which plasmid
+
-
        (and thus which route) occurred the most frequently. This route, the one most favoured
+
-
        by the ligation reactions, is the optimal route!
+
-
</p>
+
-
      </div>
+
-
      <div class="block">
+
-
        <div class="centered">
+
-
        <a class="twitter-timeline" href="https://twitter.com/iGEMAlberta" data-widget-id="368908364702437377">Tweets by @iGEMAlberta</a>
+
-
        <script>!function(d,s,id){var js,fjs=d.getElementsByTagName(s)[0],p=/^http:/.test(d.location)?'http':'https';if(!d.getElementById(id)){js=d.createElement(s);js.id=id;js.src=p+"://platform.twitter.com/widgets.js";fjs.parentNode.insertBefore(js,fjs);}}(document,"script","twitter-wjs");</script>
+
-
        </div>
+
       </div>
       </div>
       </div>
       </div>

Latest revision as of 03:38, 29 October 2013


Welcome to the Team Alberta website! Our project pushes the limits of Synthetic Biology to create massively parallel, highly selective biological computers.