Figure 5 - uploaded by Dipendra Sengupta
Content may be subject to copyright.
Source publication
We analyzed DNA sequences using a new measure of entropy. The general aim was to analyze DNA sequences and find interesting sections of a genome using a new formulation of Shannon like entropy. We developed this new measure of entropy for any non-trivial graph or, more broadly, for any square matrix whose non-zero ele- ments represent probabilistic...
Contexts in source publication
Context 1
... Chromosome-21 in Figure 5. We have studied the intervals visually where en- tropy was low and found some repetitive pattern in the sequence. ...
Similar publications
An exact run in a string T is a non-empty substring of T that is a repetition of a smaller substring possibly followed by a prefix of it. Finding maximal exact runs in strings is an important problem and therefore a well-studied one in the area of stringology. For a given string T of length n, finding all maximal exact runs in the string can be don...
We previously have shown that homologs of the outer domain segment of the inverted repeat termini (IVR-OD) of the sea urchin TU transposons are conserved among multiple eucaryotic species, including humans. We report here that two cloned human DNA IVR-OD homologs, Hut2 and Hut17, consist of a series of tandem repeats of the trimer AGG/TCC, forming...
Though the utility of next-generation sequencing (NGS) technologies for forensic short tandem repeat (STR) typing has been evident for several years, commercially available assays and software solutions developed specifically to meet forensic needs have only recently become available. One of these, the ForenSeq™ DNA Signature Prep Kit (Illumina, In...
The molecular basis of Wnt-Frizzled specificity is a central question in developmental biology. Reck, a multi-domain and multi-functional glycosylphosphatidylinositol-anchored protein, specifically enhances beta-catenin signaling by Wnt7a and Wnt7b in cooperation with the 7-transmembrane protein Gpr124. Among amino acids that distinguish Wnt7a and...
Citations
... SYBR Green I (SG I) is an asymmetric cyanine dye with green excitation wavelength that often used as the reporter group in label-free methods [9]. SG I has high sensitivity, good temperature stability and good photophysical properties, it has been widely used in the determination of biomolecules (DNA, protein) and the selective detection of metal ions [10] [11]. In order to develop novel, simple and sensitive methods for further application research on DNA ligase, taking SG I as a fluorescent reporter group to construct biosensors is obviously a good choice. ...
... It can be argued also that entropy, measuring statistical randomness, is not aligned with intuitive human understanding of complexity [41]. However, the entropy based measure is computationally affordable and a number of successful applications like, e.g., the analysis of DNA sequences [42] or in molecular biology [43] have been reported. ...
A new measure for the characterization of interconnected dynamical systems coupling is proposed. The method is based on the representation of time series as weighted cross-visibility networks. The weights are introduced as the metric distance between connected nodes. The structure of the networks, depending on the coupling strength, is quantified via the entropy of the weighted adjacency matrix. The method has been tested on several coupled model systems with different individual properties. The results show that the proposed measure is able to distinguish the degree of coupling of the studied dynamical systems. The original use of the geodesic distance on Gaussian manifolds as a metric distance, which is able to take into account the noise inherently superimposed on the experimental data, provides significantly better results in the calculation of the entropy, improving the reliability of the coupling estimates. The application to the interaction between the El Niño Southern Oscillation (ENSO) and the Indian Ocean Dipole and to the influence of ENSO on influenza pandemic occurrence illustrates the potential of the method for real-life problems.
... A recent example is the computation of the Shannon entropy of adjacency matrices to discover CRISPR candidate regions as a method to transform DNA sequences into graphs [16]. A survey contrasting adjacency matrix-based (walk) entropies and other entropies (e.g., based on degree sequence) is also offered in [14]. ...
Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths and limitations of Shannon’s entropy, lossless compressibility and algorithmic complexity when used to identify aspects and properties of complex networks. We review the fragility of computable measures on the one hand and the invariant properties of algorithmic measures on the other demonstrating how current approaches to algorithmic complexity are misguided and suffer of similar limitations than traditional statistical approaches such as Shannon entropy. Finally, we review some current definitions of algorithmic complexity which are used in analyzing labelled and unlabelled graphs. This analysis opens up several new opportunities to advance beyond traditional measures.
Biological systems are extensively studied as interactions forming complex networks. Reconstructing causal knowledge from, and principles of, these networks from noisy and incomplete data is a challenge in the field of systems biology. Based on an online course hosted by the Santa Fe Institute Complexity Explorer, this book introduces the field of Algorithmic Information Dynamics, a model-driven approach to the study and manipulation of dynamical systems . It draws tools from network and systems biology as well as information theory, complexity science and dynamical systems to study natural and artificial phenomena in software space. It consists of a theoretical and methodological framework to guide an exploration and generate computable candidate models able to explain complex phenomena in particular adaptable adaptive systems, making the book valuable for graduate students and researchers in a wide number of fields in science from physics to cell biology to cognitive sciences.
A common practice in the estimation of the complexity of objects, in particular of graphs, is to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which a single object, such a graph, can be described. From descriptions that can reconstruct the same graph and are therefore essentially translations of the same description, we will see that not only is it necessary to pre-select a feature of interest where there is one when applying a computable measure such as Shannon Entropy, and to make an arbitrary selection where there is not, but that more general properties, such as the causal likeliness of a graph as a measure (opposed to randomness), can be largely misrepresented by computable measures such as Entropy and Entropy rate. We introduce recursive and non-recursive (uncomputable) graphs and graph constructions based on integer sequences, whose different lossless descriptions have disparate Entropy values, thereby enabling the study and exploration of a measure's range of applications and demonstrating the weaknesses of computable measures of complexity.
