24 papers · ranked by Valyu relevance
Artem S Novozhilov, Yuri I Wolf, Eugene V Koonin
Background The standard genetic code table has a distinctly non-random structure, with similar amino acids often encoded by codons series that differ by a single nucleotide substitution, typically, in the third or the first position of the codon. It has been repeatedly argued that this structure of the code results…
Mahmood Saghaei
Background Typically, randomization software should allow users to exert control over the different aspects of randomization including block design, provision of unique identifiers and control over the format and type of program output. While some of these characteristics have been addressed by available software, none…
Michael Yarus
Minimally-evolved codes are constructed with randomly chosen Standard Genetic Code (SGC) triplets, and completed with completely random triplet assignments. Such “genetic codes” have not evolved, but retain SGC qualities. Retained qualities are inescapable, part of the logic of code evolution. For example, sensitivity…
Vaignana Spoorthy Ella
This paper investigates the use of different transformations for improving the randomness of sequences. In particular, convolutional codes are used for increasing the size of a given sequence and then a random mapping function is used for further randomization. We have shown how such a method can convert highly…
Xu Yang, Xiaolong Shi, Langwen Lai, Congzhou Chen + 2 more
'Ming Deng'] DNA has become a popular choice for next-generation storage media due to its high storage density and stability. As the storage medium of life’s information, DNA has significant storage capacity and low-cost, low-power replication and transcription capabilities. However, utilizing long double-stranded DNA…
Balaji Kumar, Supreet Saini
Many theories have been proposed attempting to explain the origin of the genetic code. While strong reasons remain to believe that the genetic code evolved as a frozen accident, at least for the first few amino acids, other theories remain viable. In this work, we test the optimality of the standard genetic code…
Michael Yarus
A near-universal Standard Genetic Code (SGC) implies a single origin for Earthly life. To study this unique event, I compute paths to the SGC, comparing different plausible histories. Notably, SGC-like coding emerges from traditional evolutionary mechanisms, and a superior path can be identified. To objectively measure…
M. Andrecut
We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings are pseudo-random using three approaches based on: Fourier transform, entropy…
Ali Abdolrahimi Zarnagh, Ali Motazedifard
Generating reliable random and pseudo-random sequences is important in many electronic and signal processing systems, such as secure communications, radar, spread-spectrum methods, and autonomous platforms. Although true and quantum random number generators provide stronger unpredictability, classical pseudo-random…
Jia Lu, Ryan Tsoi, Nan Luo, Yuanchi Ha + 8 more
'Minjun Kwak' 'Yasa Baig' 'Nicole Moiseyev' 'Shari Tian' 'Alison Zhang' 'Neil Zhenqiang Gong' 'Lingchong You'] Title: Summary Dynamical systems often generate distinct outputs according to different initial conditions, and one can infer the corresponding input configuration given an output. This property captures the…
Jia Lu, Ryan Tsoi, Nan Luo, Yuanchi Ha + 8 more
Dynamical systems often generate distinct outputs according to different initial conditions, and one can infer the corresponding input configuration given an output. This property captures the essence of information encoding and decoding. Here, we demonstrate the use of self-organized patterns, combined with machine…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Henning Otto Brinkhaus, Kohulan Rajan, Achim Zielesny, Christoph Steinbeck
The development of deep learning-based optical chemical structure recognition (OCSR) systems has led to a need for datasets of chemical structure depictions. The diversity of the features in the training data is an important factor for the generation of deep learning systems that generalise well and are not overfit to…
Seda Arslan Tuncer, Turgay Kaya
It is possible to generate personally identifiable random numbers to be used in some particular applications, such as authentication and key generation. This study presents the true random number generation from bioelectrical signals like EEG, EMG, and EOG and physical signals, such as blood volume pulse, GSR (Galvanic…
Víctor Manuel Silva García, Rolando Flores-Carapia, Carlos Rentería-Márquez, B. Luna-Benoso + 1 more
'Carlos Rentería-Márquez' 'B. Luna-Benoso' 'Cesar Antonio Jiménez Vázquez'] This work proposes a different procedure to encrypt images of 256 grey levels and colour, using the symmetric system Advanced Encryption Standard with a variable permutation in the first round, after the x-or operation. Variable permutation…
Somdip Dey, Asoke Nath, Shalabh Agarwal
—Now, security and authenticity of data is a big challenge. To solve this problem, we propose an innovative method to authenticate the digital documents. In this paper, we propose a new method, where the marks obtained by a candidate will also be encoded in QR CodeTM in encrypted form, so that if an intruder tries to…
Michael Yarus
Standard Genetic Code (SGC) evolution is quantitatively modeled in computed ‘worlds’ containing up to 2000 independent coding ‘environments’. Environments can host multiple codes that may fuse or divide, with division yielding identical descendants. Code division may be selected - sophisticated gene products could be…
Penghao Wang, Ziniu Mu, Lijun Sun, Shuqing Si + 1 more
DNA is a natural storage medium with the advantages of high storage density and long service life compared with traditional media. DNA storage can meet the current storage requirements for massive data. Owing to the limitations of the DNA storage technology, the data need to be converted into short DNA sequences for…
Authors not listed
This paper presents a simplified model of iterative compound optimization in drug/agrochemical discovery. Compounds are represented as binary strings, with project evolution simulated through random bit changes. The model reproduces key statistical features of real projects, including activity distributions and…
Da Qiu, Tingting Zhang, Jingyi Liu, Song Liu + 2 more
'Amelia Carolina Sparavigna'] This study proposes an innovative image encryption algorithm based on the DNAS_box and hyperchaos. The algorithm dynamically constructs a DNAS_box using 2-bit deoxyribonucleic acid (DNA) coding and 4-bit DNA-like coding, enabling seamless conversion between these two coding schemes. The…
Scott Purdy
Hierarchical Temporal Memory (HTM) is a biologically inspired machine intelligence technology that mimics the architecture and processes of the neocortex. In this white paper we describe how to encode data as Sparse Distributed Representations (SDRs) for use in HTM systems. We explain several existing encoders, which…
Stephan Rafler
A code is presented for fast, easy and efficient communication over channels that allow only two signal types: a single sound (e.g. a knock), or no sound (i.e. silence). This is a true binary code while Morse code is a ternary code and does not work in such situations. Thus the presented code is more universal than…
Elena Zamaraeva, Christopher M. Collins, Dmytro Antypov, Vladimir V. Gusev + 6 more
Crystal Structure Prediction (CSP) is a fundamental computational problem in materials science. Basin-hopping is a prominent CSP method that combines global Monte Carlo sampling to search over candidate trial structures with local energy minimisation of these candidates. The sampling uses a stochastic policy to…
Brianna Greenstein, Danielle Elsey, Geoffrey Hutchison
Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this work, we examine the general effects of a number of hyperparameters, such as population…