Team:UCSD Software

From 2014.igem.org

Revision as of 03:05, 18 October 2014 by Jenhantao (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


Tutorial

Explore our Code

Launch!

SBiDer: Synthetic Biocircuit Developer

Abstract

Genetic circuits are often difficult to engineer, requiring months to design, build, and test each individual genetic device involved in the circuit. SBiDer, a web tool developed by the UCSD Software iGEM team, will leverage existing devices to construct a database with consideration for the function of each device interpreted as boolean logic. The data can be queried by the user through SBiDer's visual interface to explore circuit designs. Users can search for existing circuits that can be used to assemble a complex circuit. The displayed circuit's literature reference, characterization data, and images of included devices can be viewed through the built-in table. We also provide a standalone modelling Python package that can be used to model circuits given by our online webtool. SBiDer's web of information can be expanded through user-generated additions to the database to improve the efficiency of the application and the accuracy of the models.

Project Description

Problem Statement

Synthetic genetic circuits created by synthetic biologists have yielded exciting applications such as biofuels production and cancer killing bacteria. These circuits are often difficult to engineer, requiring months to design, build, and test each individual genetic device involved in the circuit. Although there are many genetic devices that have been built, re-using these devices often requires a time-consuming review of the literature. The UCSD Software iGEM team will address this challenge by creating a web-tool that leverages existing genetic devices to create complex genetic circuits. We will accomplish this by:

  1. building a comprehensive database that captures the behavior, composition, and interactions of existing genetic devices in the literature
  2. constructing and visualizing the network of all synthetic genetic circuits that can interact with one another
  3. devising algorithms to search this network for the set of genetic devices that can be used to construct a complex genetic circuit.
  4. Perform some basic validation via kinetic modelling.

Aim 1 - Building a Database

We will mine the scientific literature for existing genetic devices and then construct a database that captures device characteristics such as:

  1. composition of devices
  2. function
  3. characterization data
  4. literature reference
We will design our database by rigorously constructing an entity relationship diagram and then normalizing these relationships to construct tables for a relational database.

Aim 2 - Constructing Network of Interacting Devices

We will connect known genetic devices together via device input and outputs to create a network of devices that can interact. We define a genetic device as a DNA construct transformed into cells that can cause expression of some protein in response to stimuli (or input). We will develop a web interface to facilitate access to the complex network that we have constructed. Our Web interface makes extensive use of Cytoscape, an open source bioinformatics software package for metabolic network visualization and simulation. In addition, the interface will generate SBOL Visual Images, a standard language that is easily understood by synthetic biologists all over the world. Users can also update our database with additional devices through this interface. Using the Cynetshare framework, users can share their circuit designs

Aim 3 - Searching the Network

This interface will allow researchers to query our database network for a circuit design expressed as logical operators such as “AND”, “OR”, and “NOR”, and retrieve the subnetwork of genetic devices that satisfies the circuit design. To Perform our search we modified several traditional graph search algorithms to traverse this graph, including but not limited to Prim’s algorithm (minimum spanning tree), Dijkstra’s algorithm and a breadth-first search. Results are visualized graphically in our web interface.