Skip to main content
SpringerLink
Log in

Outfix-Guided Insertion

(Extended Abstract)

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9840))

Included in the following conference series:

  • 546 Accesses

Abstract

Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We use the term “non-overlapping” to make the distinction clear to outfix-guided insertion which will be the main topic of this paper.

References

  1. Bertram, J.S.: The molecular biology of cancer. Mol. Asp. Med. 21(6), 167–223 (2000)

    Article  MathSciNet  Google Scholar 

  2. Csuhaj-Varju, E., Petre, I., Vaszil, G.: Self-assembly of strings and languages. Theoret. Comput. Sci. 374, 74–81 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Daley, M., Kari, L., Gloor, G., Siromoney, R.: Circular contextual insertions/deletions with applications to biomolecular computation. In: String Processing and Information Retrieval Symposium, pp. 47–54 (1999)

    Google Scholar 

  4. Enaganti, S., Ibarra, O., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. (2016). dx.doi.org/10.1007/s11047-015-9538-x

  5. Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: Further remarks on DNA overlap assembly, manuscript (2016)

    Google Scholar 

  6. Enaganti, S.K., Kari, L., Kopecki, S.: A formal language model of dna polymerase enzymatic activity. Fundam. Inform. 138, 179–192 (2015)

    MathSciNet  MATH  Google Scholar 

  7. Flavell, R., Sabo, D., Bandle, E., Weissmann, C.: Site-directed mutagenesis: effect of an extracistronic mutation on the in vitro propagation of bacteriophage qbeta RNA. Proc. Natl. Acad. Sci. 72(1), 367–371 (1975)

    Article  Google Scholar 

  8. Galiukschov, B.: Semicontextual grammars (in Russian). Mat. Log. Mat. Lingvistika 38–50 (1981)

    Google Scholar 

  9. Ginsburg, S., Greibach, S.: Deterministic context free languages. Inf. Control 9, 620–648 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  10. Haussler, D.: Insertion languages. Inf. Sci. 31, 77–89 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hemsley, A., Arnheim, N., Toney, M.D., Cortopassi, G., Galas, D.J.: A simple method for site-directed mutagenesis using the polymerase chain reaction. Nucleic Acids Res. 17(16), 6545–6551 (1989)

    Article  Google Scholar 

  12. Kari, L.: On insertion and deletion in formal languages. Ph.D. thesis, University of Turku (1991)

    Google Scholar 

  13. Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. Comput. 131(1), 47–61 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10, 835–852 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lee, J., Shin, M.K., Ryu, D.K., Kim, S., Ryu, W.S.: Insertion and deletion mutagenesis by overlap extension PCR. In: Braman, J. (ed.) In Vitro Mutagenesis Protocols, 3rd edn, pp. 137–146. Humana Press, New York (2010)

    Chapter  Google Scholar 

  16. Liu, H., Naismith, J.H.: An efficient one-step site-directed deletion, insertion, single and multiple-site plasmid mutagenesis protocol. BMC Biotechnol. 8(1), 91–101 (2008)

    Article  Google Scholar 

  17. Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theoret. Comput. Sci. 330(2), 339–348 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Păun, G., Pérez-Jiménez, M.J., Yokomori, T.: Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems. Int. J. Found. Comput. Sci. 19(4), 859–871 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pǎun, G.: On semicontextual grammars. Bull. Math. Soc. Sci. Math. Rouman. 28, 63–68 (1984)

    MathSciNet  MATH  Google Scholar 

  20. Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

  21. Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. Nat. Comput. 2, 321–336 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  22. Yu, S.: Regular languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Acknowledgments

Cho and Han were supported by the Basic Science Research Program through NRF funded by MEST (2015R1D1A1A01060097), the Yonsei University Future-leading Research Initiative of 2015 and the International Cooperation Program managed by NRF of Korea (2014K2A1A2048512). Ng and Salomaa were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.

Author information

Authors and Affiliations

  1. Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul, 120-749, Republic of Korea

    Da-Jung Cho & Yo-Sub Han

  2. School of Computing, Queen’s University, Kingston, ON, K7L 2N8, Canada

    Timothy Ng & Kai Salomaa

Authors
  1. Da-Jung Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Timothy Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kai Salomaa .

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal , Montreal, Québec, Canada

    Srečko Brlek

  2. Dept Mathematiques, Univ du Quebec Montreal Dept Mathematiques, Montreal, Québec, Canada

    Christophe Reutenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cho, DJ., Han, YS., Ng, T., Salomaa, K. (2016). Outfix-Guided Insertion. In: Brlek, S., Reutenauer, C. (eds) Developments in Language Theory. DLT 2016. Lecture Notes in Computer Science(), vol 9840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53132-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-53132-7_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-53131-0

  • Online ISBN: 978-3-662-53132-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation