•A new method to calculate the initial conditions and control parameters of chaotic systems. We utilize hash algorithm and plaintext information to calculate them.•The proposed scheme combined with ...the chaotic selection method of the DNA encoding rules, cyclic shift, Hamming distance, DNA addition, DNA subtraction, DNA XOR operation and other operations.•In the DNA level, we proposed a new method to operate bases within each DNA sequence and adjacent DNA sequences when we utilize DNA XOR operation.•The Hamming distance and cyclic shift function are combined to diffused the plain images in the DNA level.•This paper includes comparative evaluation. They are Ref 32-35 in our manuscript. Experimental results and security analysis show that the proposed scheme has better security.
This paper proposes a new chaotic image encryption, which is based on the coupled map lattices (CML system) and DNA diffusion sequences, and it's also a new one-time pad scheme. The initial values and control parameters of the CML system and logistics map are served as keys for one-time pad and calculated by utilizing the SHA-256 hash algorithm and the plaintext. In the pixel level, we utilize the CML system and sort function to encrypt according to the way from diffusion to scrambling; each pixel is encrypted by randomly DNA encoding, it means that a pixel consists of 4 bases in the DNA level; the Hamming distance and cyclic shift function are utilized to scramble, and the DNA encoding rules, the DNA complementary rules, the DNA operation rules and other operations are combined with the chaotic map for the diffusion process. Security analysis shows that the new algorithm has good security and can resist common attacks.
Changes in non-protein-coding regulatory DNA sequences have been proposed to play distinctive roles in adaptive evolution. We analyzed correlations between gene functions and evidence for positive ...selection in a common statistical framework across several large surveys of coding and noncoding sequences throughout the human genome. Strong correlations with both classifications in gene ontologies and measurements of gene expression indicate that neural development and function have adapted mainly through noncoding changes. In contrast, adaptation via coding changes is dominated by immunity, olfaction, and male reproduction. Genes with highly tissue-specific expression have undergone more adaptive coding changes, suggesting that pleiotropic constraints inhibit such changes in broadly expressed genes. In contrast, adaptive noncoding changes do not exhibit this pattern. Our findings underscore the probable importance of noncoding changes in the evolution of human traits, particularly cognitive traits.
A group of clearwing moths Sesiidae (Syn.: Aegeriidae) is analyzed here with special emphasis on genetics of currant clearwing moth (Synanthedon tipuliformis, CLERCK 1759). DNA sequences of the ...longest (1544 nt) available sequence of Sesiidae genes Co1 (cytochrome oxidase subunit-1 of mitochondrial DNA, mtDNA) (mtDNA; NCBI# AJ864359.1) were analyzed after In silico data mining, and dendrogram was edited to reveal molecular diversity and genetic distances among Sesiidae species. Batesian mimicry, sexual dimorphism, and genetics and genomics of Sesiidae are indicated.
The one-dimensional (2D) chaotic encryption algorithm has good encryption performance. For its properties, such as the excellent complexity, pseudo-randomness, and sensitivity to the initial value of ...the chaotic sequence. However, compared with other methods, its biggest drawback is that the key space is too small. To address these problems, in this study, the authors introduce an improved 2D logistic sine chaotic map (2D-LSMM). A novel image encryption scheme based on dynamic DNA sequences encryption and improved 2D-LSMM is presented. The logistic map is used to control the input of the sine map. And the encoding and operation rules of DNA sequences are determined by 2D-LSMM chaotic sequences. By implementing dynamic DNA sequence encryption, the encryption process becomes more complicated and harder to be attacked. Simulation experimental results and security analysis show that the authors’ encryption scheme not only achieves proper encryption but can also resist different attacks.
The classification and phylogenetic history of the Amaryllidaceae is reviewed since the dawn of molecular systematics in the 1990’s. The family is now recognized as comprising three subfamilies: ...Agapanthoideae, Allioideae, and Amaryllidoideae, of which the latter is the largest. The family likely had a Gondwanaland origin in what is now Africa. Agapanthoideae is monotypic, endemic to South Africa, and the first branch in the family tree of life; Allioidieae is sister to Amaryllidoideae. Four tribes are recognized in Allioideae: Allieae (monotypic, with nearly 1000 species of Allium across the Northern Hemisphere), Gilliesieae (5–7 genera in southern South America), Leucocoryneae (six genera mostly in southern South America), and Tulbaghieae (monotypic, with ca. 30 species endemic to South Africa). Amaryllidoideae is cosmopolitan, but mostly pantropical, consisting of 13 tribes. Centers of diversity occur in South Africa, South America and the Mediterranean region. The American clade is sister to the Eurasian clade (tribes Galantheae, Lycorideae, Narcisseae and Pancratieae) of the subfamily. The American Amaryllidoideae resolves as two monophyletic groups, 1) the hippeastroid clade (tribes Griffineae and Hippeastreae) and 2) the Andean tetraploid clade (tribes Clinantheae, Eucharideae, Eustephieae, and Hymenocallideae). Molecular analyses are reviewed for each main clade of the family, along with the resultant taxonomic changes. Directions for future studies are briefly discussed.
The paper reviews the visualisation problems of genetic sequences and of their analysis results as well as other related problems. A possible formulation of the problem based on similarity, ...complexity measure (distance) between DNA sequences is proposed. It is solved by making use of multidimensional scaling (MDS) of principal component analysis (PCA) methods.
Šiame darbe apžvelgiami genetinių sekų ir jų tyrimų rezultatų vizualizavimo uždaviniai ir su jais susijusios problemos. Pateikiamas binarinių kodų išrikiavimo ant tiesės metodas ir juo paremta „genomo parašo“ modifikacija.
DNA binding by intercalation , showing both sequence and enantiospecificity, of a ruthenium diimine complex, is reported by Christine Cardin, Andrew Kellett et al. in their Research Article ...(e202318863). The right‐handed helix seen in the crystal structure shows variable degrees of twisting, including the first intercalation by a ruthenium complex from the DNA major groove. In solution, the lambda enantiomer was found to be more stabilising with a range of DNA sequences.
Generalized Unique Reconstruction from Substrings Yehezkeally, Yonatan; Bar-Lev, Daniella; Marcovich, Sagi ...
IEEE transactions on information theory,
09/2023, Letnik:
69, Številka:
9
Journal Article
Recenzirano
Odprti dostop
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some ...subset of their substrings. While previous works considered two extreme cases in which all substrings of predefined lengths are read or substrings are read with no overlap for the single string case, this work studies two extensions of this paradigm. The first extension considers the setup in which consecutive substrings are read with some given minimum overlap. First, an upper bound is provided on the attainable rates of codes that guarantee unique reconstruction. Then, efficient constructions of codes that asymptotically meet that upper bound are presented. In the second extension, we study the setup where multiple strings are reconstructed together. Given the number of strings and their length, we first derive a lower bound on the read substrings' length ℓ that is necessary for the existence of multi-strand reconstruction codes with non-vanishing rates. We then present two constructions of such codes and show that their rates approach 1 for values of ℓ that asymptotically behave like the lower bound.
PDF
