21 citations · 38 across the 10 of their papers we have counts for
10 papers
Hamiltonian Sets of Polygonal Paths in Assembly Graphs
A. Guterman, N. Jonoska, E. Kreines +2
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltoni…
Structures of Monoids Motivated by DNA Origami
Peter Alspaugh, James Garrett, Nataša Jonoska +1
We construct a class of monoids, called origami monoids, motivated by Jones monoids and by strand organization in DNA origami structures. Two types of basic building blocks of DNA…
Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute
Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska
We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjectur…
Insertions Yielding Equivalent Double Occurrence Words
Daniel A. Cruz, Margherita Maria Ferrari, Natasa Jonoska +2
A double occurrence word (DOW) is a word in which every symbol appears exactly twice; two DOWs are equivalent if one is a symbol-to-symbol image of the other. We consider the so ca…
Graph Based Analysis for Gene Segment Organization In a Scrambled Genome
Mustafa Hajij, Nataša Jonoska, Denys Kukushkin +1
DNA rearrangement processes recombine gene segments that are organized on the chromosome in a variety of ways. The segments can overlap, interleave or one may be a subsegment of an…
A Graph Isomorphism Condition and Equivalence of Reaction Systems
Daniela Genova, Hendrik Jan Hoogeboom, Nataša Jonoska
We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two…