Double occurrence words play an important part in genetics in describing epigenetic genome rearrangements. A useful geometric representation for double occurrence words is provided by the so-called assembly graphs. The paper investigates properties of the incidence matrices that correspond to the assembly graphs. An explicit matrix characterization of the simple assembly graphs of a given structure and a series of constructions, using these graphs and important for genetic investigations, are provided.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Angeleska, N. Jonoska, and M. Saito, “DNA recombinations through assembly graphs,” Discr. Appl. Math., 157, 3020–3037 (2009).
A. Angeleska, N. Jonoska, M. Saito, and L. F. Landweber, “RNA-guided DNA assembly,” J. Theor. Biology, 248 (4), 706–720 (2007).
R. Arredondo, “Properties of graphs used to model DNA recombination,” Grad. Theses Diss. (2014). https://scholarcommons.usf.edu/etd/4979
R. Arredondo, “Reductions on double occurrence words,” arXiv:1311.3543.
J. Burns, E. Dolzhenko, N. Jonoska, T. Muche, and M. Saito, “Four-regular graphs with rigid vertices associated to DNA recombination,” Discr. Appl. Math., 161, 1378–1394 (2013).
A. Ehrenfeucht, T. Harju, I. Petre, D. M. Prescott, and G. Rozenberg, Computing in Living Cell, Springer (2005).
A. Ehrenfeucht, T. Harju, and G. Rozenberg, “Gene assembly through cyclic graph decomposition,” Theor. Comp. Sci., 281, 325–349 (2002).
L. Kari and L. F. Landweber, “Computational power of gene rearrangement,” in: DNA Based Computers (E. Winfree, D. K. Gifford eds.), AMS (1999), pp. 207–216.
M. Nowacki, V. Vijayan, Y. Zhou, K. Schotanus, T. G. Doak, and L. F. Landweber, “RNA-mediated epigenetic programming of a genome-rearrangement pathway,” Nature, 451, 153–159 (2008).
D. M. Prescott, A. Ehrenfeucht, and G. Rozenberg, “Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates,” J. Theor. Biology, 222, 323–330 (2003).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 482, 2019, pp. 45–72.
The work of the first two authors was supported by the Russian Science Foundation (project No. 17-11-01124).
Translated by N. V. Ostroukhova.
Rights and permissions
About this article
Cite this article
Guterman, A.E., Kreines, E.M. & Ostroukhova, N.V. Double Occurrence Words: Their Graphs and Matrices. J Math Sci 249, 139–157 (2020). https://doi.org/10.1007/s10958-020-04928-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-020-04928-5