Eliminating unwanted patterns with minimal interference
Zehavit Leibovich, Ilan Gronau

TL;DR
This paper introduces a formal framework and efficient algorithms for eliminating unwanted patterns in synthetic DNA design, enabling more precise control over DNA functionalities with minimal interference.
Contribution
It provides the first formal description of the pattern elimination problem and offers algorithms that optimize pattern removal while preserving DNA functionality.
Findings
Algorithms effectively eliminate unwanted patterns.
Approach integrates seamlessly with existing DNA design tools.
Enhances the power and flexibility of DNA synthesis methods.
Abstract
Artificial synthesis of DNA molecules is an essential part of the study of biological mechanisms. The design of a synthetic DNA molecule usually involves many objectives. One of the important objectives is to eliminate short sequence patterns that correspond to binding sites of restriction enzymes or transcription factors. While many design tools address this problem, no adequate formal solution exists for the pattern elimination problem. In this work, we present a formal description of the elimination problem and suggest efficient algorithms that eliminate unwanted patterns and allow optimization of other objectives with minimal interference to the desired DNA functionality. Our approach is flexible, efficient, and straightforward, and therefore can be easily incorporated in existing DNA design tools, making them considerably more powerful.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Evolutionary Algorithms and Applications · DNA and Biological Computing
