Abstract
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-free languages and polynomial-time decidable for regular languages. The maximality of this property also turns out to be decidable for regular languages and polynomial-time decidable for an important case of the Hamming similarity. Then we consider various construction methods for Hamming bond-free languages, including the recently introduced method of templates, and obtain a complete structural characterization of all maximal Hamming bond-free languages. This result is applicable to the θ-k-code property introduced by Jonoska and Mahalingam.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andronescu, M., Dees, D., Slaybaugh, L., Zhao, Y., Condon, A., Cohen, B., Skiena, S.: Algorithms for testing that sets of DNA words concatenate without secondary structure. In: [7], pp. 182–195.
Arita, M., Kobayashi, S.: DNA sequence design using templates. New Generation Computing 20, 263–277 (2002)
Baum, E.: DNA sequences useful for computation. In: Pre-proceed. 2nd DIMACS Workshop on DNA-based computers, pp. 122–127 (1996)
Chen, J., Reif, J.H. (eds.): DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)
Condon, A.E., Corn, R.M., Marathe, A.: On combinatorial DNA word design. Journal of Computational Biology 8(3), 201–220 (2001)
Feldkamp, U., Saghafi, S., Rauhe, H.: DNASequenceGenerator - A program for the construction of DNA sequences. In: [11], pp. 179–189
Hagiya, M., Ohuchi, A. (eds.): DNA 2002. LNCS, vol. 2568. Springer, Heidelberg (2003)
Head, T.: Relativised code concepts and multi-tube DNA dictionaries. In: Calude, C.S., Păun, G. (eds.) Finite Versus Infinite: Contributions to an Eternal Dilemma, pp. 175–186. Springer, Heidelberg (2000)
Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. In: [11], pp. 107–118
Jonoska, N., Mahalingam, K.: Languages of DNA based code words. In: [4], pp. 58–68
Jonoska, N., Seeman, N.C. (eds.): DNA 2001. LNCS, vol. 2340. Springer, Heidelberg (2002)
Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 511–607. Springer, Heidelberg (1997)
Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376–393. Springer, Heidelberg (2002)
Kari, L., Konstantinidis, S.: Language equations, maximality and error detection. Journal of Computer and System Sciences (to appear)
Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages. Acta Informatica 40, 119–157 (2003)
Kari, L., Konstantinidis, S., Sosík, P.: On properties of bond-free DNA languages. Tech. report 609, Dept. Computer Science, Univ. Western Ontario, Canada (2003)
Kari, L., Konstantinidis, S., Sosík, P.: Bond-free languages: formalizations, maximality and construction methods. Tech. report 2004-01, Dept. Mathematics and Computing Science, Saint Mary’s University, Halifax, Canada (2004), Electronic form available at, http://www.stmarys.ca/academic/science/compsci/
Mauri, G., Ferretti, C.: Word Design for Molecular Computing: A Survey. In: [4], pp. 37–46
Reif, J.H., LaBean, T.H., Pirrung, M., Rana, V.S., Guo, B., Kingsford, C., Wickham, G.S.: Experimental construction of very large scale DNA databases with associative search capability. In: [11], pp. 231–247.
Tanaka, F., Nakatsugawa, M., Yamamoto, M., Shiba, T., Ohuchi, A.: Developing support system for sequence design in DNA computing. In: [11], pp. 129–137.
Tulpan, D.C., Hoos, H.H., Condon, A.E.: Stochastic Local Search Algorithms for DNA Word Design. In: [7], pp. 229–241.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kari, L., Konstantinidis, S., Sosík, P. (2005). Bond-Free Languages: Formalizations, Maximality and Construction Methods. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_15
Download citation
DOI: https://doi.org/10.1007/11493785_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)