Team:Alberta

From 2013.igem.org

(Difference between revisions)
Line 433: Line 433:
       </div-->
       </div-->
       <div class="block">
       <div class="block">
 +
        <h3 class="centered">
 +
          Welcome to the Team Alberta website!
 +
Our project, The Littlest MapMaker, is all about creating biological computers; training E. coli to solve tough mathematical puzzles, like the travelling salesman problem.
 +
        </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:100%;"></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>
       <div class="block">
       <div class="block">
-
       <p>
+
       <ul>
-
         The traveling salesman problem is a mathematical optimization problem that was
+
         <li>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.</li>
-
         first formally described in 1930, and has been intensively studied in the computer
+
         <li>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.</li>
-
        sciences as a benchmark for optimization algorithms. The problem asks:  
+
         <li>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.</li>
-
      </p>
+
       </ul>
-
      <p class="centered-well">
+
       <!--div class="thumbnails">
-
        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">
         <div class="thumbnail">
           <img src="/wiki/images/thumb/c/c7/Sample_product.png/300px-Sample_product.png"></img>
           <img src="/wiki/images/thumb/c/c7/Sample_product.png/300px-Sample_product.png"></img>
Line 478: Line 461:
         (and thus which route) occurred the most frequently. This route, the one most favoured  
         (and thus which route) occurred the most frequently. This route, the one most favoured  
         by the ligation reactions, is the optimal route!
         by the ligation reactions, is the optimal route!
-
</p>
+
</p-->
       </div>
       </div>
       <div class="block">
       <div class="block">

Revision as of 01:42, 28 September 2013


The Littlest Mapmaker

"Exploration into the world of DNA Computing"
Team Alberta: University of Alberta

Welcome to the Team Alberta Wiki!
I’ve been hard at work to frustrate as well as teach 8 students (from high school to undergraduate to recently graduated). Learn about my other roles and how I have successful results for solving a computational problem!

Welcome to the Team Alberta website! Our project, The Littlest MapMaker, is all about creating biological computers; training E. coli to solve tough mathematical puzzles, like the travelling salesman problem.


  • Curious about the possibilities of biocomputing? Need of a crash course on travelling salesman problems? Visit our background page for more information on the real-world applications of our project.
  • Want to get straight to the details of what Team Alberta has been working on this summer? Read up in the overview and results pages to see what we've achieved.
  • 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 team roster, sponsors and outreach pages to meet everyone who's participated.

Retrieved from "http://2013.igem.org/Team:Alberta"