Follow
Steffen Kopecki
Steffen Kopecki
Google Germany
Verified email at google.com
Title
Cited by
Cited by
Year
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
372015
On iterated hairpin completion
S Kopecki
Theoretical Computer Science 412 (29), 3629-3638, 2011
312011
Additive methods for genomic signatures
R Karamichalis, L Kari, S Konstantinidis, S Kopecki, S Solis-Reyes
BMC bioinformatics 17, 1-18, 2016
282016
On the overlap assembly of strings and languages
SK Enaganti, OH Ibarra, L Kari, S Kopecki
Natural Computing 16, 175-185, 2017
182017
On the hairpin completion of regular languages
V Diekert, S Kopecki, V Mitrana
International Colloquium on Theoretical Aspects of Computing, 170-184, 2009
172009
Binary pattern tile set synthesis is NP-hard
L Kari, S Kopecki, PÉ Meunier, MJ Patitz, S Seki
Algorithmica 78 (1), 1-46, 2017
152017
Deciding whether a regular language is generated by a splicing system
L Kari, S Kopecki
International Workshop on DNA-Based Computers, 98-109, 2012
132012
A formal language model of DNA polymerase enzymatic activity
SK Enaganti, L Kari, S Kopecki
Fundamenta Informaticae 138 (1-2), 179-192, 2015
122015
Further remarks on DNA overlap assembly
SK Enaganti, OH Ibarra, L Kari, S Kopecki
Information and Computation 253, 143-154, 2017
92017
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
92010
Iterated hairpin completions of non-crossing words
L Kari, S Kopecki, S Seki
International Conference on Current Trends in Theory and Practice of …, 2012
82012
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
72017
3-color bounded patterned self-assembly
L Kari, S Kopecki, S Seki
Natural computing 14 (2), 279-292, 2015
72015
On the maximality of languages with combined types of code properties
L Kari, S Konstantinidis, S Kopecki
Theoretical Computer Science 550, 79-89, 2014
62014
Deciding regularity of hairpin completions of regular languages in polynomial time
V Diekert, S Kopecki, V Mitrana
Information and Computation 217, 12-30, 2012
62012
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
52014
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
52011
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
L Kari, S Konstantinidis, S Kopecki
Information and Computation 259, 237-258, 2018
32018
Formal language theory of hairpin formations
S Kopecki
32011
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
32011
The system can't perform the operation now. Try again later.
Articles 1–20