Abstract
Motivated by certain coding techniques for reliable DNA computing, we consider the problem of characterizing nontrivial languages D that are maximal with the property that D * is contained in the subword closure of a given set S of words of some fixed length k. This closure is simply the set of all words whose subwords of length k must be in S. We provide a deep structural characterization of these languages D, which leads to polynomial time algorithms for computing such languages.
Similar content being viewed by others
Notes
In this case, ℓ should be such that D 1(ℓ) is of cardinality at least 1024 + 28 = 1280, which is the sum of the number of rows and the number of possible 8-bit colours.
References
Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021–1024
Arita M, Kobayashi S (2002) DNA sequence design using templates. New Gener Comput 20:263–277
Campeanu C, Konstantinidis S (2008) State complexity of the subword closure operation with applications to DNA coding. Int J Found Comput Sci 19(5):1099–1112
Chen J, Reif J (eds) (2004) 9th International workshop on DNA based computers, DNA9, Madison, USA, 1–3 June 2003, revised papers. Lecture notes in computer science, vol 2943. Springer, Berlin
Crochemore M, Hancart C (1997) Automata for matching patterns. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol 1. Springer, Berlin, pp 399–462
Cui B (2007) Encoding methods for DNA languages defined via the subword closure operation. MSc Thesis, Department of Mathematics and Computing Science, Saint Mary’s University, Canada
Cui B, Konstantinidis S (2008) DNA coding using the subword closure operation. In: Garzon and Yan, pp 284–289.
Dasgupta S, Papadimitriou CH, Vazirani UV (2006) Algorithms. McGraw-Hill, Boston
Ferretti C, Mauri G, Zandron C (eds) (2005) 10th International workshop on DNA computing, DNA 10, Milan, Italy, 7–10 June 2004, revised selected papers. Lecture notes in computer science, vol 3384. Springer, Berlin
Feldkamp U, Saghafi S, Rauhe H (2002) DNASequenceGenerator—a program for the construction of DNA sequences. In: Jonoska and Seeman, pp 179–189
Garzon MH, Yan H (eds) (2008) 13th International meeting on DNA computing, DNA13, Memphis, USA, 4–8 June 2007, revised selected papers. Lecture notes in computer science, vol 4848. Springer, Berlin
Jonoska N, Mahalingam K (2004) Languages of DNA based code words. In: Proceedings of the 9th international meeting on DNA based computers. In: Chen and Reif, pp 58–68
Jonoska N, Seeman NC (eds) (2002) 7th International workshop on DNA based computers, DNA7, Tampa, USA, 10–13 June 2001, revised papers. Lecture notes in computer science, vol 2340. Springer, Berlin
Kari L, Konstantinidis S, Sosík P (2005) Bond-free languages: formalizations, maximality and construction methods. In: Ferretti et al, pp 169–181
Kari L, Seki S (2011) Schema for parallel insertion and deletion: revisited. Int J Found Comp Sci 22(7):1655–1668
Mahalingam K (2004) Involution codes: with application to DNA strand design. PhD Thesis, Department of Mathematics, University of South Florida, Florida, USA
Mauri G, Ferretti C (2004) Word design for molecular computing: a survey. In: Chen and Reif, pp 37–46
Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vol I. Springer, Berlin
Sakarovitch J (2009) Elements of automata theory. Cambridge University Press, Berlin
Yu S (1997) Regular languages. In: Rozenberg and Salomaa, pp 41–110
Zhang DY (2011) Towards domain-based sequence design for DNA strand displacement reactions. In: 16th International meeting on DNA computing and molecular programming. Lecture notes in computer science, vol 6518. Springer, Berlin, pp 162–175
Acknowledgments
This study was supported by NSERC.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Konstantinidis, S., Santean, N. Computing maximal Kleene closures that are embeddable in a given subword-closed language. Nat Comput 12, 211–222 (2013). https://doi.org/10.1007/s11047-013-9364-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-013-9364-y