Abstract
Given a string w over a finite alphabet ∑ and an integer K, can w be partitioned into strings of length at most K, such that there are no collisions? We refer to this question as the string partition problem and show it is NP-complete for various definitions of collision and for a number of interesting restrictions including |∑| = 2. This establishes the hardness of an important problem in contemporary synthetic biology, namely, oligo design for gene synthesis. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Condon, A., Maňuch, J., & Thachuk, C. (2012). The complexity of string partitioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7354 LNCS, pp. 159–172). https://doi.org/10.1007/978-3-642-31265-6_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
