39 citations · 116 across the 19 of their papers we have counts for
20 papers
Descriptional Complexity of Semi-Simple Splicing Systems
Lila Kari, Timothy Ng
Splicing systems are generative mechanisms introduced by Tom Head in 1987 to model the biological process of DNA recombination. The computational engine of a splicing system is the…
State Complexity of Overlap Assembly
Janusz Brzozowski, Lila Kari, Bai Li +1
The \emph{state complexity} of a regular language is the number of states in a minimal deterministic finite automaton (DFA) accepting . The state complexity of a reg…
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…
Mapping the Space of Genomic Signatures
Lila Kari, Kathleen A. Hill, Abu S. Sayem +4
We propose a computational method to measure and visualize interrelationships among any number of DNA sequences allowing, for example, the examination of hundreds or thousands of c…