A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.

D. Cho, Y. Han, T. Ng, and K. Salomaa, Outfix-guided insertion, Theoretical Computer Science, vol.701, pp.70-84, 2017.

M. Daley and I. Mcquillan, Template-guided DNA recombination, Theoretical Computer Science, vol.330, issue.2, pp.237-250, 2005.

J. Dassow, V. Mitrana, and A. Salomaa, Operations and language generating devices suggested by the genome evolution, Theoretical Computer Science, vol.270, issue.12, pp.701-738, 2002.

M. Domaratzki, Deletion along trajectories, Theoretical Computer Science, vol.320, issue.23, pp.293-313, 2004.

S. K. Enaganti, O. H. Ibarra, L. Kari, and S. Kopecki, Further remarks on DNA overlap assembly. Information and Computation, vol.253, pp.143-154, 2017.

S. K. Enaganti, L. Kari, and S. Kopecki, A formal language model of DNA polymerase enzymatic activity, Fundamenta Informaticae, vol.138, issue.1-2, pp.179-192, 2015.

P. Gasque, Y. Dean, E. Mcgreal, J. Vanbeek, and B. Morgan, Complement components of the innate immune system in health and disease in the CNS, Immunopharmacology, vol.49, issue.1, pp.171-186, 2000.

Y. Han, S. Ko, T. Ng, and K. Salomaa, State complexity of insertion. International Journal of Foundations of Computer Science, vol.27, pp.863-878, 2016.

Y. Han, S. Ko, and K. Salomaa, State complexity of deletion and bipolar deletion, Acta Informatica, vol.53, issue.1, pp.67-85, 2016.

T. Head, D. Pixton, and E. Goode, Splicing systems: Regularity and below, Proceedings of the 8th International Workshop on DNA-Based Computers, pp.262-268, 2002.

M. Ito, L. Kari, and G. Thierrin, Insertion and deletion closure of languages, Theoretical Computer Science, vol.183, issue.1, pp.3-19, 1997.

L. Kari, Insertion operations: closure properties, Bulletin of the EATCS, vol.51, pp.181-191, 1993.

L. Kari, Deletion operations: closure properties, International Journal of Computer Mathematics, vol.52, issue.1-2, pp.23-42, 1994.

L. Kari and S. Kopecki, Deciding whether a regular language is generated by a splicing system, Proceedings of the 18th International Workshop on DNA-Based Computers, pp.98-109, 2012.

L. Kari and G. Thierrin, Contextual insertions/deletions and computability. Information and Computation, vol.131, pp.47-61, 1996.

D. E. Knuth, J. H. Morris, J. , and V. R. Pratt, Fast pattern matching in strings, SIAM journal on computing, vol.6, issue.2, pp.323-350, 1977.

E. L. Post, A variant of a recursively unsolvable problem, Bulletin of the American Mathematical Society, vol.52, issue.4, pp.264-268, 1946.

J. Reikofski and B. Y. Tao, Polymerase chain reaction (PCR) techniques for sitedirected mutagenesis, Biotechnology Advances, vol.10, issue.4, pp.535-547, 1992.