Graph grammars with string-regulated rewriting

dc.contributor.authorLobo, Daniel
dc.contributor.authorVico, Francisco J.
dc.contributor.authorDassow, Jürgen
dc.date.accessioned2025-07-09T17:54:22Z
dc.date.issued2011-10-07
dc.description.abstractMulticellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression, we propose and analyse graph grammars with string-regulated rewriting. In these grammatical systems a genome sequence is represented by a regulatory string, a graph corresponds to an organism, and a set of graph grammar rules represents different forms of implementing cell division. Accordingly, a graph derivation by the graph grammar resembles the developmental process of an organism. We give examples of the concept and compare its generative power to the power of the traditional context-free graph grammars. We demonstrate that the power of expression increases when genetic regulation is included in the model, as compared to non-regulated grammars. Additionally, we propose a hierarchy of string-regulated graph grammars, arranged by expressive power. These results highlight the key role that the transmission of regulatory information during development has in the emergence of biological diversity.
dc.description.sponsorshipThe authors are grateful to the anonymous reviewers for valuable comments and suggestions. D.L. was supported in part by a research stay fellowship at Otto-von-Guericke-Universität Magdeburg from the Spanish Ministerio de Educación.
dc.description.urihttps://www.sciencedirect.com/science/article/pii/S0304397511005925
dc.format.extent11 pages
dc.genrejournal articles
dc.identifierdoi:10.13016/m29mgd-crrg
dc.identifier.citationLobo, Daniel, Francisco J. Vico, and Jürgen Dassow. “Graph Grammars with String-Regulated Rewriting.” Theoretical Computer Science 412, no. 43 (October 7, 2011): 6101–11. https://doi.org/10.1016/j.tcs.2011.07.004.
dc.identifier.urihttps://doi.org/10.1016/j.tcs.2011.07.004
dc.identifier.urihttp://hdl.handle.net/11603/39135
dc.language.isoen_US
dc.publisherElsevier
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Biological Sciences Department
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.subjectGenetic regulation
dc.subjectRegulated rewriting
dc.subjectGraph grammars
dc.subjectDevelopment
dc.subjectExpressive power
dc.titleGraph grammars with string-regulated rewriting
dc.typeText
dcterms.creatorhttps://orcid.org/0000-0003-4666-6118

Files