Abstract
We investigate here the computational efficiency of gene rearrangement found in ciliates (unicellular organisms). We show how the so-called guided recombination systems, which model this gene rearrangement, can be used as problem solvers. Specifically, these systems can uniformly solve SAT with time complexity O(n ˙ m) for a Boolean formula of m clauses over n variables.
Get full access to this article
View all access options for this article.