| Primitivity of Atom Watson-Crick Fibonacci Words. | 0 | 0.34 | 2022 |
| Involutive Fibonacci Words. | 0 | 0.34 | 2021 |
| Descriptional Complexity Of Semi-Simple Splicing Systems | 0 | 0.34 | 2021 |
| Conjugate word blending: formal model and experimental implementation by XPCR | 0 | 0.34 | 2021 |
| Building bridges - Honoring Natasa Jonoska on the occasion of her 60th birthday Preface | 0 | 0.34 | 2021 |
| MLDSP-GUI: An alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis. | 0 | 0.34 | 2020 |
| Descriptional Complexity of Semi-Simple Splicing Systems | 0 | 0.34 | 2020 |
| State Complexity Of Overlap Assembly | 0 | 0.34 | 2020 |
| State Complexity of Simple Splicing. | 0 | 0.34 | 2019 |
| Simplifying the role of signals in tile self-assembly | 0 | 0.34 | 2019 |
| State Complexity of Pseudocatenation. | 0 | 0.34 | 2019 |
| Disjunctivity and other properties of sets of pseudo-bordered words. | 1 | 0.41 | 2017 |
| Smart Tile Self-Assembly and Replication. | 0 | 0.34 | 2017 |
| Further remarks on DNA overlap assembly. | 0 | 0.34 | 2017 |
| Additive methods for genomic signatures. | 1 | 0.35 | 2016 |
| An investigation into inter- and intragenomic variations of graphic genomic signatures | 6 | 0.76 | 2015 |
| Methods for Relativizing Properties of Codes. | 0 | 0.34 | 2015 |
| TCS in the 21st century. | 0 | 0.34 | 2015 |
| Generating the Pseudo-Powers of a Word. | 0 | 0.34 | 2014 |
| Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, London, ON, Canada, July 14-18, 2014, Proceedings | 0 | 0.34 | 2014 |
| Pseudo-Identities and Bordered Words. | 1 | 0.36 | 2014 |
| 3-color Bounded Patterned Self-assembly. | 1 | 0.51 | 2013 |
| State complexity of star of union and square of union on k regular languages | 2 | 0.37 | 2013 |
| Negative Glues and Non-determinism in Nanocomputations by Self-assembly. | 0 | 0.34 | 2013 |
| State complexity of combined operations with two basic operations | 15 | 0.75 | 2012 |
| Relativized codes | 0 | 0.34 | 2012 |
| State Complexity Of Two Combined Operations: Catenation-Star And Catenation-Reversal | 9 | 0.51 | 2012 |
| Iterated hairpin completions of non-crossing words | 4 | 0.41 | 2012 |
| State complexity of star and square of union of k regular languages | 0 | 0.34 | 2012 |
| State complexity of union and intersection of star on k regular languages | 3 | 0.40 | 2012 |
| An extension of the Lyndon--Schützenberger result to pseudoperiodic words | 7 | 0.63 | 2011 |
| On the Regularity of Iterated Hairpin Completion of a Single Word | 2 | 0.39 | 2011 |
| Schema For Parallel Insertion And Deletion: Revisited | 2 | 0.41 | 2011 |
| Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). | 0 | 0.34 | 2011 |
| State Complexity Of Two Combined Operations: Catenation-Union And Catenation-Intersection | 10 | 0.62 | 2011 |
| Orthogonal Shuffle On Trajectories | 0 | 0.34 | 2011 |
| K-Comma Codes and Their Generalizations | 9 | 0.61 | 2011 |
| Properties Of Pseudo-Primitive Words And Their Applications | 4 | 0.51 | 2010 |
| Triangular Self-Assembly | 0 | 0.34 | 2010 |
| State Complexity Of Catenation Combined With Star And Reversal | 5 | 0.44 | 2010 |
| Scalable, time-responsive, digital, energy-efficient molecular circuits using DNA strand displacement | 10 | 0.81 | 2010 |
| Polyominoes simulating arbitrary-neighborhood zippers and tilings | 0 | 0.34 | 2010 |
| Schema for parallel insertion and deletion | 5 | 0.58 | 2010 |
| State complexity of catenation combined with union and intersection | 4 | 0.40 | 2010 |
| The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly | 18 | 1.20 | 2009 |
| On the descriptional complexity of Watson-Crick automata | 9 | 0.84 | 2009 |
| Twin-roots of words and their properties | 2 | 0.52 | 2009 |
| On pseudoknot-bordered words and their properties | 7 | 0.68 | 2009 |
| Geometrical tile design for complex neighborhoods. | 2 | 0.42 | 2009 |
| On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes | 1 | 0.41 | 2009 |
