Theoretical and computational properties of transpositions

DOI10.1007/s11047-010-9207-zzbMath1217.68126OpenAlexW1993457606WikidataQ62046601 ScholiaQ62046601MaRDI QIDQ553917

James M. McQuillan, Mark Daley, Ian McQuillan, Kalpana Mahalingam

Publication date: 28 July 2011

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9207-z

zbMATH Keywords

bioinformaticsmathematical modellingtranspositionstransposable elementsformal language theory

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Genetics and epigenetics (92D10)

Related Items (1)

Insertion operations on deterministic reversal-bounded counter machines

Cites Work

• On the weight of universal insertion grammars
• Characterizations of recursively enumerable languages by means of insertion grammars
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical and computational properties of transpositions