Year: 2025
Type: article
Abstract: 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.
DOI: 10.1145/3779650
Authors: Robert Brijder, Joris Gillis, Jan Van den Bussche
Institutions: Eindhoven University of Technology, Hasselt University
Language: English
Topic: DNA and Biological Computing
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: hybrid
OpenAlex ID: W7114889853