Abstract

This paper makes two generalizations of the previously presented algorithms of the author based on the principles of information coding in molecular genetics. This is an account of the frequency characteristics of subalphabetic representations of polynucleotides and a generalization of an algorithm for processing arbitrary information presented in a quaternary code. The second generalization indicates the general significance of the proposed algorithms, which the author called molecular genetic or DNA algorithms, emphasizing their difference from the well-known genetic algorithms of the Holland type. An example of displaying the results of the operation of DNA algorithms in the frequency domain with visualization of the cluster structure is given. The example makes it possible to trace a structure that is quite common for DNA, which consists of a main cluster and several satellite clusters. Natural language texts processed by DNA algorithms in the structural and frequency domains are analyzed and compared.

中文翻译：

---

DNA聚类算法

摘要

本文根据分子遗传学中信息编码的原理对作者先前提出的算法进行了两种概括。这说明了多核苷酸的亚字母表示的频率特性以及用于处理以四级码表示的任意信息的算法的一般化。第二种概括表明了所提出算法的一般意义，作者称其为分子遗传或DNA算法，着重强调了它们与著名的Holland类型遗传算法的区别。给出了一个通过可视化显示簇结构在频域中显示DNA算法运算结果的示例。该示例可以追踪DNA十分常见的结构，它由一个主群集和几个卫星群集组成。分析和比较了由DNA算法在结构域和频域中处理的自然语言文本。