Abstract
Recently a new interest towards the design of efficient algorithms for testing whether a language X is a code, has arisen from (wet) DNA Computing. Indeed, in this context, the final computation is a concatenation of DNA strands (words) that must satisfy some restrictions (DNA properties) to prevent them from interacting in undesirable ways. Efficient algorithms (and implementations) have been designed when X is a finite set. In this paper we provide an algorithm (and a Java implementation) for testing whether an infinite but regular set of words is a code that avoids some unwanted cross hybridizations. The algorithm runs in O(n 2), where n is the sum of the numbers of states and transitions in a finite state automaton recognizing X.
Partially supported by the FARB Project “Automi e Linguaggi Formali: aspetti emergenti e fondazionali” (University of Salerno, 2009-2011), and by the FARB Project “Aspetti emergenti e fondazionali nella teoria degli automi e dei linguaggi formali” (University of Salerno, 2010-2012).
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
Béal, M.P., Perrin, D.: Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356(1-2), 6–13 (2006)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, Encyclopedia od Mathematics and its Applications, vol. 129. Cambridge University Press (2009)
Colcombet, T.: Forms of determinism for automata. In: STACS 2012. pp. 1–23 (2012) (invited talk)
D’Auria, L., Zizza, R.: A note on the McCloskey’s algorithm for deciding whether a regular language is a code. In: ICTCS 2010, Camerino, Italy (2010)
Head, T., Weber, A.: Deciding code related properties by means of finite transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II, pp. 260–272. Springer (1993)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)
Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theor. Comput. Sci. 290(3), 1557–1579 (2003)
Jonoska, N., Mahalingam, K.: Languages of DNA Based Code Words. In: Chen, J., Reif, J.H. (eds.) DNA 9. LNCS, vol. 2943, pp. 61–73. Springer, Heidelberg (2004)
Kephart, D.E., LeFevre, J.: CODEGEN: The generation and testing of DNA code words. In: IEEE Congress on Evolutionary Computation (2004)
McCloskey, R.: An O(n 2) time algorithm for deciding whether a regular language is a code. Journal of Computing and Information 2(10), 79–89 (1996), updated version downloaded http://www.cs.uofs.edu/~mccloske/publications/code_alg_header_mar2011.pdf
Oprocha, P.: Fast solutions for DNA code words test. Schedae Informaticae 15 (2006)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, new computing paradigms. Springer (1996)
Sardinas, A.A., Patterson, G.W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Convention Record (Pt. 8), 104–108 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cianciulli, M., Zaccagnino, R., Zizza, R. (2012). An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Theory and Practice of Natural Computing. TPNC 2012. Lecture Notes in Computer Science, vol 7505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33860-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33860-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33859-5
Online ISBN: 978-3-642-33860-1
eBook Packages: Computer ScienceComputer Science (R0)