Abstract
In DNA processing and RNA editing, gene insertion and deletion are considered as the basic operations. Based on the above evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper we study about ambiguity and complexity measures of these systems. First, we define the various levels of ambiguity (i = 0,1,2,3,4,5) for insertion-deletion systems. Next, we show that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) ∈ {(5,4), (4,2), (3,1), (3,2), (2,1),(0,1)}. Further, We prove an important result that the ambiguity problem of insertion-deletion system is undecidable. Finally, we define three new complexity measures TLength − Con, TLength − Ins, TLength − Del for insertion-deletion systems and analyze the trade-off between the newly defined ambiguity levels and complexity measures.
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
Takaharai., A., Yokomori, T.: On the computational power of insertion-deletion systems. In: Natural Computing, vol. 2, pp. 321–336. Kluwer Academic Publishers (2003)
Calude, C.S., Paŭn, G.: Computing with cells and atoms. An introduction to Quantum, DNA and Membrane Computing. Taylor and Francis, London (2001)
Searls, D.B.: The computational linguistics of biological sequences. In: Hunter, L.(ed.) Artificial Intelligence and Molecular Biology, pp. 47–120. AAAI Press (1993)
Galiukschov, B.S.: Semicontextual grammars. Mat. Logical. Mat. Ling., Talinin University, 38–50 (1981) (in Russian)
Georgescu, G.: The Syntactic Complexity of Internal Contextual Grammars and Languages. In: Martin-Vide, C. (ed.) II Intern. Conf. Mathematical Linguistics, Amsterdam, pp. 17–28 (1997)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, New Computing Paradigms. Springer (1998)
Păun, G.: Contextual Grammars. The Publ. House of the Romanian Academy of Sciences, Bucuresti (1982)
Păun, G.: Marcus Contextual Grammars. Kluwer Academic Publishers (1997)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (2006)
Ilie, L.: On Ambiguity in Internal Contextual Languages. In: Martin-Vide, C. (ed.) II Intern. Conf. Mathematical Linguistics, Tarragona, 1996, pp. 29–45. John Benjamins, Amsterdam (1997)
Lakshmanan, K.: A note on Ambiguity of Internal Contextual Grammars. Theoretical Computer Science, 436–441 (2006)
Lakshmanan, K., Anand, M., Krithivasan, K.: On the Trade-off Between Ambiguity and Measures in Internal Contextual Grammars. In: Cămpeanu, C., Pighizinni, G., (eds.) DCFS 2008, Charlottetown, Canada, pp. 216–223 (2008)
Kari, L., Păun, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Proc. of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318–333 (1997)
Kari, L.: On insertion/deletion in formal languages. Ph.D Thesis, University of Turku (1991)
Marcus, S.: Contextual Grammars. Rev. Roum. Pures. Appl. (1969)
Martin-Vide, C., Miguel-Verges, J., Păun, G., Salomaa, A.: Attempting to Define the Ambiguity in Internal Contextual Languages. In: Martin-Vide, C. (ed.) II Intern. Conf. Mathematical Linguistics, Tarragona 1996, pp. 59–81. John Benjamins, Amsterdam (1997)
Setubal, Meidanis: Introduction to Computational Molecular Biology. PWS Publishing Company (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Krithivasan, K., Kuppusamy, L., Mahendran, A., M., K. (2012). On the Ambiguity and Complexity Measures of Insertion-Deletion Systems. In: Suzuki, J., Nakano, T. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32615-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-32615-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32614-1
Online ISBN: 978-3-642-32615-8
eBook Packages: Computer ScienceComputer Science (R0)