Site-directed insertion: decision problems, maximality and minimality

DOI10.1007/978-3-319-94631-3_5MaRDI QIDQ777987zbMATH OpenOpenAlexFDO

Authors Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith

Publication date 30 June 2020

Full work available at URL https://arxiv.org/abs/1804.11017

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories we show that one variable equations involving site-directed insertion and regular constants can be solved. We consider also maximal and minimal variants of the site-directed insertion operation.

Recommendations

• Site-directed insertion: language equations and decision problems
• Site-directed deletion
• Outfix-guided insertion
• Outfix-guided insertion (extended abstract)
• Insertion languages

Cited in

(7)

• Outfix-guided insertion (extended abstract)
• Optimizing Restriction Site Placement for Synthetic Genomes
• Site-directed deletion
• Site-directed insertion: language equations and decision problems
• Operation insertion on the conjugacy and commutativity of words
• Outfix-guided insertion
• Theoretical and implementational aspects of the formal language server (LaSer)

This page was built for publication: Site-directed insertion: decision problems, maximality and minimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777987)