Jernej Rus
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jernej Rus has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Dan Archdeacon
Dept. of Mathematics & Statistics University of Vermont 05405-0156 Burlington VT USA
1 shared publication- Drago Bokal1 shared publication
- Luis Goddyn
Simon Fraser University
1 shared publication - Nino Bašić
University of Primorska, Slovenia and Institute of Mathematics, Physics and Mechanics, Slovenia
1 shared publication - Tomas Boothby
Simon Fraser University, Burnaby, Canada
1 shared publication
Latest Publications
- Open Access
Parallelism of stable traces
A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk enters $v$ from $X$, it also exits to a vertex in $X$. In the past, $d$-stable traces were investigated as a mathematical model for an innovative biotechnological procedure -- self-assembling of polypeptide structures. Among other, it was proven that graphs that admit parallel $d$-stable traces are precisely Eulerian graphs with minimum degree strictly larger than $d$. In the present paper we give an alternative, purely combinatorial proof of this result.Open AccessParallelism of stable traces
A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk enters $v$ from $X$, it also exits to a vertex in $X$. In the past, $d$-stable traces were investigated as a mathematical model for an innovative biotechnological procedure -- self-assembling of polypeptide structures. Among other, it was proven that graphs that admit parallel $d$-stable traces are precisely Eulerian graphs with minimum degree strictly larger than $d$. In the present paper we give an alternative, purely combinatorial proof of this result. - 16 November 2016
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 75 (1) , 109-127
Antiparallel d-stable traces and a stronger version of ore problem
In 2013 a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in Gradišar et al. (Nat Chem Bio 9:362–366, 2013 ). It was since observed that a polyhedron P can be realized by interlocking pairs of polypeptide chains if its corresponding graph G(P) admits a strong trace. It was since also demonstrated that a similar strategy can also be expanded to self-assembly of designed DNA (Kočar, Nat commun 7:1–8, 2016 ). In this direction, in the present paper we characterize graphs which admit closed walk which traverses every edge exactly once in each direction and for every vertex v, there is no subset N of its neighbors, with \(1 \le |N| \le d\), such that every time the walk enters v from N, it also exits to a vertex in N. This extends Thomassen’s characterization (Thomassen, J Combin Theory Ser B 50:198–207, 1990 ) for the case \(d = 1\).- 16 November 2016
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 75 (1) , 109-127
Antiparallel d-stable traces and a stronger version of ore problem
In 2013 a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in Gradišar et al. (Nat Chem Bio 9:362–366, 2013 ). It was since observed that a polyhedron P can be realized by interlocking pairs of polypeptide chains if its corresponding graph G(P) admits a strong trace. It was since also demonstrated that a similar strategy can also be expanded to self-assembly of designed DNA (Kočar, Nat commun 7:1–8, 2016 ). In this direction, in the present paper we characterize graphs which admit closed walk which traverses every edge exactly once in each direction and for every vertex v, there is no subset N of its neighbors, with \(1 \le |N| \le d\), such that every time the walk enters v from N, it also exits to a vertex in N. This extends Thomassen’s characterization (Thomassen, J Combin Theory Ser B 50:198–207, 1990 ) for the case \(d = 1\).- Open Access
$E$-restricted double traces
For a graph $G$ and $E \subseteq E(G)$, $E$-restricted strong trace is a closed walk which traverses every edge from $E$ once in each direction and every other edge twice in the same direction. In addition, every time a strong trace come to a vertex $v$ from $N \subseteq N(v)$ it continues to $u \notin N$, for $1 \leq |N| < d(v)$. We characterize graphs admitting $E$-restricted strong traces and explain how this result can be used as an upgrade of mathematical model for self-assembling nanostructure design first presented by Gradi\v{s}ar et al. in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chemical Biology 9 (2013) 362--366].Open Access$E$-restricted double traces
For a graph $G$ and $E \subseteq E(G)$, $E$-restricted strong trace is a closed walk which traverses every edge from $E$ once in each direction and every other edge twice in the same direction. In addition, every time a strong trace come to a vertex $v$ from $N \subseteq N(v)$ it continues to $u \notin N$, for $1 \leq |N| < d(v)$. We characterize graphs admitting $E$-restricted strong traces and explain how this result can be used as an upgrade of mathematical model for self-assembling nanostructure design first presented by Gradi\v{s}ar et al. in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chemical Biology 9 (2013) 362--366]. - Open Access
An algebraic approach to enumerating non-equivalent double traces in graphs
Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the underlying graphs of these polyhedra. Double traces are walks that traverse every edge of the graph twice, usually with some additional conditions on traversal direction and vertex neighborhood coverage. Given that double trace properties are intimately related to theefficiency of polypeptide polyhedron construction, enumerating all different possible double traces and analyzing their properties is an important step in the construction. In the paper, we study the automorphism group of double traces and present an algebraic approach to this problem, yielding a branch-and-bound algorithm.
Open AccessAn algebraic approach to enumerating non-equivalent double traces in graphs
Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the underlying graphs of these polyhedra. Double traces are walks that traverse every edge of the graph twice, usually with some additional conditions on traversal direction and vertex neighborhood coverage. Given that double trace properties are intimately related to theefficiency of polypeptide polyhedron construction, enumerating all different possible double traces and analyzing their properties is an important step in the construction. In the paper, we study the automorphism group of double traces and present an algebraic approach to this problem, yielding a branch-and-bound algorithm.