Plan a DNA library assembly using a heuristic for maximizing DNA reuse

This webpage provides a simple frontend to the binary concatenation assembly planning algorithm described in:

J. Blakes, O. Raz, U. Feige, J. Bacardit, P. Widera, T. Ben-Yehezkel, E. Shapiro, N. Krasnogor
"A heuristic for maximizing DNA reuse in synthetic DNA library assembly"
ACS Synthetic Biology, 2014

For the Python implementation (LGPLv3) of the algorithm and the parts library, download the supplementary materials.

Library targets

One target per line. Each target should contains whitespace separated part names (case-sensitive) or DNA fragments.

Example 1, Example 2

Assembly plan