| An investigation into inter-and intragenomic variations of graphic genomic signatures R Karamichalis, L Kari, S Konstantinidis, S Kopecki BMC bioinformatics 16, 1-22, 2015 | 40 | 2015 |
| Additive methods for genomic signatures R Karamichalis, L Kari, S Konstantinidis, S Kopecki, S Solis-Reyes BMC bioinformatics 17, 1-18, 2016 | 32 | 2016 |
| On iterated hairpin completion S Kopecki Theoretical Computer Science 412 (29), 3629-3638, 2011 | 32 | 2011 |
| On the overlap assembly of strings and languages SK Enaganti, OH Ibarra, L Kari, S Kopecki Natural Computing 16, 175-185, 2017 | 20 | 2017 |
| On the hairpin completion of regular languages V Diekert, S Kopecki, V Mitrana International Colloquium on Theoretical Aspects of Computing, 170-184, 2009 | 18 | 2009 |
| Binary pattern tile set synthesis is NP-hard L Kari, S Kopecki, PÉ Meunier, MJ Patitz, S Seki Algorithmica 78 (1), 1-46, 2017 | 16 | 2017 |
| Deciding whether a regular language is generated by a splicing system L Kari, S Kopecki International Workshop on DNA-Based Computers, 98-109, 2012 | 13 | 2012 |
| A formal language model of DNA polymerase enzymatic activity SK Enaganti, L Kari, S Kopecki Fundamenta Informaticae 138 (1-2), 179-192, 2015 | 12 | 2015 |
| Complexity results and the growths of hairpin completions of regular languages V Diekert, S Kopecki International Conference on Implementation and Application of Automata, 105-114, 2010 | 11 | 2010 |
| Further remarks on DNA overlap assembly SK Enaganti, OH Ibarra, L Kari, S Kopecki Information and Computation 253, 143-154, 2017 | 9 | 2017 |
| Iterated hairpin completions of non-crossing words L Kari, S Kopecki, S Seki International Conference on Current Trends in Theory and Practice of …, 2012 | 9 | 2012 |
| Deciding whether a regular language is generated by a splicing system L Kari, S Kopecki Journal of Computer and System Sciences 84, 263-287, 2017 | 7 | 2017 |
| 3-color bounded patterned self-assembly L Kari, S Kopecki, S Seki Natural computing 14 (2), 279-292, 2015 | 7 | 2015 |
| On the maximality of languages with combined types of code properties L Kari, S Konstantinidis, S Kopecki Theoretical Computer Science 550, 79-89, 2014 | 6 | 2014 |
| Deciding regularity of hairpin completions of regular languages in polynomial time V Diekert, S Kopecki, V Mitrana Information and Computation 217, 12-30, 2012 | 6 | 2012 |
| It is NL-complete to decide whether a hairpin completion of regular languages is regular V Diekert, S Kopecki International Journal of Foundations of Computer Science 22 (08), 1813-1828, 2011 | 6 | 2011 |
| An efficient algorithm for computing the edit distance of a regular language via input-altering transducers L Kari, S Konstantinidis, S Kopecki, M Yang arXiv preprint arXiv:1406.1041, 2014 | 5 | 2014 |
| On the regularity of iterated hairpin completion of a single word L Kari, S Seki, S Kopecki Fundamenta Informaticae 110 (1-4), 201-215, 2011 | 4 | 2011 |
| Transducer descriptions of DNA code properties and undecidability of antimorphic problems L Kari, S Konstantinidis, S Kopecki Information and Computation 259, 237-258, 2018 | 3 | 2018 |
| Formal language theory of hairpin formations S Kopecki Stuttgart, Universität Stuttgart, Diss., 2011, 2011 | 3 | 2011 |
Stavros KonstantinidisSaint Mary's University, Halifax, CanadaVerified email at smu.ca