1. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 740–748. Hersonissos, Greece (2001)
2. Czeizler, E., Popa, A.: Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. In: Stefanovic, D., Turberfield, A. (eds.) DNA Computing and Molecular Programming. LNCS, vol. 7433, pp. 58–72. Springer, Heidelberg (2012)
3. Doty, D., Fleming, H., Hader, D., Patitz, M.J., Vaughan, L.A.: Accelerating self-assembly of crisscross slat systems. In: 29th International Conference on DNA Computing and Molecular Programming (DNA 29). Leibniz International Proceedings in Informatics (LIPIcs), vol. 276, pp. 7:1–7:23. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl (2023)
4. Drake, P., Patitz, M.J., Summers, S.M., Tracy, T.: Self-assembly of patterns in the abstract tile assembly model. Tech. Rep. arXiv preprint arXiv:2402.16284 (2024)
5. Drake, P., Patitz, M.J., Tracy, T.: Pattern self-assembly software (2024). http://self-assembly.net/wiki/index.php/Pattern_Self-Assembly