Answers are grounded in this paper and cite their sources.
DNAQL is a query language for databases implemented as DNA molecules in solution, with well-known DNA wetlab procedures as operators. DNAQL focusses on faithful implementability in DNA, and, as a result, does not include powerful, but difficult to implement, features like nonterminating/recursive hybridization needed for general computation (i.e., Turing-completeness). In this article, we show that DNAQL is relationally complete, i.e., the full relational algebra can be performed by DNAQL programs.
No takes yet. Share an insight, caveat, or question.
A 2025 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: