6 citations · 9 across the 11 of their papers we have counts for
12 papers
An investigation into inter- and intragenomic variations of graphic genomic signatures
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis +1
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 diff…
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
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 D…
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers
Lila Kari, Stavros Konstantinidis, Steffen Kopecki +1
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 languag…
Binary pattern tile set synthesis is NP-hard
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier +2
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 -PATS problem…
3-color Bounded Patterned Self-assembly
Lila Kari, Steffen Kopecki, Shinnosuke Seki
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-com…
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly
Lila Kari, Steffen Kopecki, Amirhossein Simjour
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-…