Metadata-Version: 2.1
Name: dasi
Version: 0.1
Summary: Automated DNA assembly planner for Python
Home-page: https://github.com/jvrana/dasi-dna-design
Author: Justin Vrana
Author-email: justin.vrana@gmail.com
Requires-Python: >=3.6,<4.0
Classifier: Development Status :: 4 - Beta
Classifier: Intended Audience :: Science/Research
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.6
Classifier: Programming Language :: Python :: 3.7
Classifier: Programming Language :: Python :: 3.8
Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
Provides-Extra: documentation
Provides-Extra: styling
Requires-Dist: biopython (>=1.74,<2.0)
Requires-Dist: fire (>=0.1,<0.2)
Requires-Dist: frozendict (>=1.2,<2.0)
Requires-Dist: jsonschema (>=3.1,<4.0)
Requires-Dist: loggable-jdv (>=0.1.5,<0.2.0)
Requires-Dist: matplotlib (>=3.1,<4.0)
Requires-Dist: more-itertools (>=8.0,<9.0)
Requires-Dist: msgpack (>=0.6.1,<0.7.0)
Requires-Dist: msgpack-numpy (>=0.4.4,<0.5.0)
Requires-Dist: nest_asyncio (>=1.0,<2.0)
Requires-Dist: networkx (>=2.3,<3.0)
Requires-Dist: numpy (>=1.17,<2.0)
Requires-Dist: pandas (>=0.25.1,<0.26.0)
Requires-Dist: primer3plus (>=1.0.8,<2.0.0)
Requires-Dist: pyblastbio (>=0.6.3,<0.7.0)
Requires-Dist: seaborn (>=0.9.0,<0.10.0)
Requires-Dist: sortedcontainers (>=2.1,<3.0)
Requires-Dist: sympy (>=1.4,<2.0)
Requires-Dist: tqdm (>=4.32,<5.0)
Requires-Dist: uvloop (>=0.12.2,<0.13.0)
Project-URL: Documentation, https://jvrana.github.io/dasi-dna-design
Description-Content-Type: text/markdown

# DASi DNA Design

[![PyPI version](https://badge.fury.io/py/dasi.svg)](https://badge.fury.io/py/dasi)
![Build package](https://github.com/jvrana/DASi-DNA-Design/workflows/Build%20package/badge.svg)

**DASi** is an automatic DNA cloning plan designer aimed for operating on small budgets
by focusing on material re-use.

The software converts a nucleotide sequence, or a library of sequences, to an executable
 molecular assembly plan while optimizing material cost, assembly efficiency, and assembly time.

The key design paradigm for DASi is that *no molecular biology expertise* is required to use DASi. Complete novices should be able to use the software to design and construct new genetic sequences. This also enables automated software programs to automatically design and construct new genetic sequences.

The software goals are reminiscent of j5 or Teselegen but focused on:
1. A dead-simple API usable by lab novices, experts or automated software programs.
1. Utilizing information about current laboratory inventory in its optimization
algorithm to minimize costs and turn-around time

### Status

DASi is currently under development funded by the DARPA Synergistic Discovery and Design program. DASi is currently being used to connect automatically generate DNA designs to automated biological fabrication facilities (e.g. University of Washington Biofab).

### Usage

DASi completely automates the cloning design work, finding approximately optimal solutions for cloning steps, preferentially using existing plasmids, linear DNA fragments, and primers to design semi-optimal cloning steps and designs.

The following command designs the cloning steps for a library of designs. The user only needs to specify the sequences they wish to construct and currently available primers and DNA templates as *.genbank* or *.fasta* files. DASi handles all design aspects. *No molecular biology expertise is required to use DASi.*

```bash
dasi library_design --designs mydesigns/*.gb --fragments fragments/*.gb --primers primers.fasta --templates plasmids/*.gb --cost_model cost.b --out results
```

#### Customization

DASi optimization parameters are completely customizable. The following are examples of parameters and aspects of DASi that are customizable:

* primer synthesis costs
* primer design parameters
* synthetic fragment costs
* vendor-specific synthetic fragment complexity
* sequence dependent plasmid assembly efficiencies
* optimizing over efficiency vs material costs
* etc.

### Planned Features

* Golden-gate support
* heirarchical assembly
* library support (with bayesian search to optimize shared parts)
* front-end
* connection to fabrication facility

### DASi optimization problem

Briefly, DASi approximates a solution the following optimization problem: 

```Given a set of 'goal' double-stranded sequences, a set of available single-stranded and double-strand sequences, and a set of actions that can create new sequences, find the optimal set of operations that produces the 'goal' sequences.```

Formalization of this optimization problem is coming soon.

