Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Kopecki, Steffen"'
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:
http://arxiv.org/abs/2203.05451
Publikováno v:
In Theoretical Computer Science 4 January 2023 939:119-139
We provide, on an extensive dataset and using several different distances, confirmation of the hypothesis that CGR patterns are preserved along a genomic DNA sequence, and are different for DNA sequences originating from genomes of different species.
Externí odkaz:
http://arxiv.org/abs/1503.00162
This work concerns formal descriptions of DNA code properties, and builds on previous work on transducer descriptions of classic code properties and on trajectory descriptions of DNA code properties. This line of research allows us to give a property
Externí odkaz:
http://arxiv.org/abs/1503.00035
We revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the language in question. We present an efficient algorithm for solving this prob
Externí odkaz:
http://arxiv.org/abs/1406.1041
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:
http://arxiv.org/abs/1404.0967
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is already NP-
Externí odkaz:
http://arxiv.org/abs/1306.3257
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:
http://arxiv.org/abs/1302.2840
Autor:
Kari, Lila, Kopecki, Steffen
Splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987. Shortly thereafter, it was proven that the languages generated by (fi
Externí odkaz:
http://arxiv.org/abs/1112.4897
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive language and f
Externí odkaz:
http://arxiv.org/abs/1110.0760