Extend bonding grammars with additional DNA computation operations

Develop extensions of bonding grammars that incorporate graph transformation rules modeling DNA computing operations other than the bonding operation, thereby enabling the simulation of additional DNA computing processes within the bonding grammar framework.

Background

The paper introduces bonding grammars as a graph grammar formalism tailored to model DNA computation, where bonding merges two hyperedges (representing complementary nucleobases) into a single terminal hyperedge (representing a base pair). It demonstrates key properties of bonding grammars, including their relationship with hyperedge replacement grammars, an embedding of regular sticker systems, and NP-completeness of the membership problem.

The author concludes by pointing to further directions: while bonding captures base-pair formation, DNA computing involves additional operations beyond bonding. Extending bonding grammars to include such operations via graph transformations would broaden the formalism’s applicability and is explicitly stated as an open problem.