Analyzing the Trade-Off Between Complexity Measures, Ambiguity in Insertion System and Its Applications
Anand Mahendran, Kumar Kannan, Mohamed Hamada and 1 more
IEEE Access · 2022
doi:10.1109/access.2022.3206772 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Insertion is one of the basic operations in DNA computing. Based on this operation, an evolutionary computation model, the insertion system, was defined. For the above defined evolutionary computation model, varying levels of ambiguity and basic descriptional complexity measures were defined. In this paper, we define twelve new (descriptional) complexity measures based on the integral parts of the derivation, such as axioms, strings to be inserted, and contexts used in the insertion rules. Later, we analyze the trade-off among the (newly defined) complexity measures and the existing ambiguity levels. Finally, we examine the application of the analyzed trade-off in natural languages and modelling of bio-molecular structures.
Abstract licence: CC BY-NC-ND
References39
39 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.