Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Steffen Kopecki"'
Publikováno v:
Algorithms, Vol 11, Iss 11, p 165 (2018)
The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications. Here, we revisit the problem of computing the inner edit dista
Externí odkaz:
https://doaj.org/article/28377fedee3d48e3aa1831e44380f44c
Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not be treated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3c673f65de7f256dd9622b099312b72
Publikováno v:
Natural Computing. 16:175-185
This paper investigates properties of the binary string and language operation overlap assembly which was defined by Csuhaj-Varju, Petre and Vaszil as a formal model of the linear self-assembly of DNA strands: The overlap assembly of two strings, xy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40b11a4d2be1dbf383fe925b9d95736b
https://doi.org/10.1007/s11047-015-9538-x
https://doi.org/10.1007/s11047-015-9538-x
Publikováno v:
Fundamenta Informaticae. 138:179-192
We propose and investigate a formal language operation inspired by the naturally occurring phenomenon of DNA primer extension by a DNA-template-directed DNA Polymerase enzyme. Given two DNA strings u and v, where the shorter string v called primer is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5be19f7874cb3d871d0a0469489765db
https://doi.org/10.3233/fi-2015-1206
https://doi.org/10.3233/fi-2015-1206
Publikováno v:
Acta Cybernetica. 22:259-292
The usual setting for information transmission systems assumes that all words over the source alphabet need to be encoded. The demands on encodings of messages with respect to decodability, error-detection, etc. are thus relative to the whole set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea8975bd1b60489f267662bfb8879e6f
https://doi.org/10.14232/actacyb.22.2.2015.3
https://doi.org/10.14232/actacyb.22.2.2015.3
Publikováno v:
Algorithmica
Algorithmica, 2017, 78 (1), pp.1-46. ⟨10.1007/s00453-016-0154-7⟩
Algorithmica, Springer Verlag, 2017, 78 (1), pp.1-46. ⟨10.1007/s00453-016-0154-7⟩
Algorithmica, 2017, 78 (1), pp.1-46. ⟨10.1007/s00453-016-0154-7⟩
Algorithmica, Springer Verlag, 2017, 78 (1), pp.1-46. ⟨10.1007/s00453-016-0154-7⟩
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the smallest number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c370cff12df12dead7bdfd984fdc915
https://inria.hal.science/hal-01659779
https://inria.hal.science/hal-01659779
Publikováno v:
Theoretical Computer Science. 550:79-89
We consider the decision problem of whether or not a given regular language is maximal with respect to certain combined types of code properties. In the recent past, there have been a few formal methods for defining code properties, such as the traje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94ade12351ea097b35eaf958b105fa9f
https://doi.org/10.1016/j.tcs.2014.07.015
https://doi.org/10.1016/j.tcs.2014.07.015
Publikováno v:
International Journal of Foundations of Computer Science. 25:419-439
Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bfd703001414ca0060d5cfcb536255a
https://doi.org/10.1142/s0129054114400048
https://doi.org/10.1142/s0129054114400048
Publikováno v:
Natural Computing. 15:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f5148a3708ea8ffb1e10333f27d0e3d
https://doi.org/10.1007/s11047-015-9535-0
https://doi.org/10.1007/s11047-015-9535-0
Publikováno v:
BMC Bioinformatics
Background Studies exploring the potential of Chaos Game Representations (CGR) of genomic sequences to act as “genomic signatures” (to be species- and genome-specific) showed that CGR patterns of nuclear and organellar DNA sequences of the same o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60b94d8a082065f2636629d0f7f74fe7
https://doi.org/10.1186/s12859-016-1157-8
https://doi.org/10.1186/s12859-016-1157-8