ID: q-bio/0607039

Mathematic principles underlying genetic structures

July 23, 2006

View on ArXiv

Similar papers 5

An algebraic hypothesis about the primeval genetic code

May 8, 2008

86% Match
Robersy Sanchez, Ricardo Grau
Genomics
Quantitative Methods

A plausible architecture of an ancient genetic code is derived from an extended base triplet vector space over the Galois field of the extended base alphabet {D, G, A, U, C}, where the letter D represents one or more hypothetical bases with unspecific pairing. We hypothesized that the high degeneration of a primeval genetic code with five bases and the gradual origin and improvements of a primitive DNA repair system could make possible the transition from the ancient to the m...

Find SimilarView on arXiv

Did Sequence Dependent Geometry Influence the Evolution of the Genetic Code?

March 1, 2020

86% Match
Alex Kasman, Brenton LeMesurier
Other Quantitative Biology
Information Theory
Information Theory

The genetic code is the function from the set of codons to the set of amino acids by which a DNA sequence encodes proteins. Since the codons also influence the shape of the DNA molecule itself, the same sequence that encodes a protein also has a separate geometric interpretation. A question then arises: How well-duplexed are these two "codes"? In other words, in choosing a genetic sequence to encode a particular protein, how much freedom does one still have to vary the geomet...

Find SimilarView on arXiv

A word recurrence based algorithm to extract genomic dictionaries

September 22, 2020

86% Match
Vincenzo Bonnici, Giuditta Franco, Vincenzo Manca
Genomics
Information Theory
Information Theory

Genomes may be analyzed from an information viewpoint as very long strings, containing functional elements of variable length, which have been assembled by evolution. In this work an innovative information theory based algorithm is proposed, to extract significant (relatively small) dictionaries of genomic words. Namely, conceptual analyses are here combined with empirical studies, to open up a methodology for the extraction of variable length dictionaries from genomic sequen...

Find SimilarView on arXiv

DNA energy constraints shape biological evolutionary trajectories

May 2, 2019

86% Match
Piero Fariselli, Cristian Taccioli, ... , Maritan Amos
Biomolecules
Genomics

Most living systems rely on double-stranded DNA (dsDNA) to store their genetic information and perpetuate themselves. This biological information has been considered the main target of evolution. However, here we show that symmetries and patterns in the dsDNA sequence can emerge from the physical peculiarities of the dsDNA molecule itself and the maximum entropy principle alone, rather than from biological or environmental evolutionary pressure. The randomness justifies the h...

Find SimilarView on arXiv

Information transmission in genetic regulatory networks: a review

January 21, 2011

86% Match
Aleksandra M Walczak, Gašper Tkačik
Biological Physics
Molecular Networks

Genetic regulatory networks enable cells to respond to the changes in internal and external conditions by dynamically coordinating their gene expression profiles. Our ability to make quantitative measurements in these biochemical circuits has deepened our understanding of what kinds of computations genetic regulatory networks can perform and with what reliability. These advances have motivated researchers to look for connections between the architecture and function of geneti...

Find SimilarView on arXiv

Information Theory of Genomes

December 19, 2006

86% Match
Dmitri V. Parkhomchuk
Genomics
Populations and Evolution

Relation of genome sizes to organisms complexity is still described rather equivocally. Neither the number of genes (G-value), nor the total amount of DNA (C-value) correlates consistently with phenotype complexity. Using information theory considerations we developed a model that allows a quantative estimate for the amount of functional information in a genomic sequence. This model easily answers the long-standing question of why GC content is increased in functional regions...

Find SimilarView on arXiv

Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

January 30, 2012

86% Match
Ming-Yang Kao, Henry C. M. Leung, ... , Zhang Yong
Data Structures and Algorith...
Computational Engineering, F...
Information Theory
Information Theory

Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints...

Find SimilarView on arXiv

Statistical Approach to Gene Evolution

February 14, 2001

86% Match
Sujay Chattopadhyay, William A. Kanner, Jayprokas Chakrabarti
Biological Physics
Data Analysis, Statistics an...

The evolution in coding DNA sequences brings new flexibility and freedom to the codon words, even as the underlying nucleotides get significantly ordered. These curious contra-rules of gene organisation are observed from the distribution of words and the second moments of the nucleotide letters. These statistical data give us the physics behind the classification of bacteria.

Find SimilarView on arXiv

Information Analysis of DNA Sequences

October 15, 2010

86% Match
Riyazuddin Mohammed
Computational Engineering, F...
Information Theory
Information Theory

The problem of differentiating the informational content of coding (exons) and non-coding (introns) regions of a DNA sequence is one of the central problems of genomics. The introns are estimated to be nearly 95% of the DNA and since they do not seem to participate in the process of transcription of amino-acids, they have been termed "junk DNA." Although it is believed that the non-coding regions in genomes have no role in cell growth and evolution, demonstration that these r...

Find SimilarView on arXiv

Codes for DNA Sequence Profiles

February 2, 2015

86% Match
Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic
Information Theory
Combinatorics
Information Theory

We consider the problem of storing and retrieving information from synthetic DNA media. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on their collection of substrings observed through a noisy channel. This problem of reconstructing sequences from traces was first investigated in the noiseless setting under the name of "Markov type" analysis. Here, we explain the connection between the reconstruction problem ...

Find SimilarView on arXiv