Computational Efficiency of Intermolecular Gene Assembly

  • Authors:

  • Tseren-Onolt Ishdorj;Remco Loos;Ion Petre

  • Affiliations:

  • (Correspd.) Comp. Biomodelling Labor., Dep. of Information Technologies Åbo Akademi University, Turku 20520, Finland. E-mail: tishdorj@abo.fi;Research Group on Mathematical Linguistics, Rovira i Virgili University Plaça Imperial Tàrraco 1, 43005 Tarragona, Spain. E-mail: remcogerard.loos@urv.cat;Comp. Biomodelling Labor., Dep. of Information Technologies Åbo Akademi University, Turku 20520, Finland. E-mail: ipetre@abo.fi

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.