39 citations · 116 across the 19 of their papers we have counts for
3 papers · 1 filter
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…
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…