اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEncoding DNA sequences by integer chaos game representation
64
0
0.0
(
0
)
تأليف
Changchuan Yin
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
DNA sequences are fundamental for encoding genetic information. The genetic information may not only be understood by symbolic sequences but also from the hidden signals inside the sequences. The symbolic sequences need to be transformed into numerical sequences so the hidden signals can be revealed by signal processing techniques. All current transformation methods encode DNA sequences into numerical values of the same length. These representations have limitations in the applications of genomic signal compression, encryption, and steganography. We propose an integer chaos game representation (iCGR) of DNA sequences and a lossless encoding method DNA sequences by the iCGR. In the iCGR method, a DNA sequence is represented by the iterated function of the nucleotides and their positions in the sequence. Then the DNA sequence can be uniquely encoded and recovered using three integers from iCGR. One integer is the sequence length and the other two integers represent the accumulated distributions of nucleotides in the sequence. The integer encoding scheme can compress a DNA sequence by 2 bits per nucleotide. The integer representation of DNA sequences provides a prospective tool for sequence compression, encryption, and steganography. The Python programs in this study are freely available to the public at https://github.com/cyinbox/iCGR
قيم البحث
اقرأ أيضاً
Alignment-free sequence analysis approaches provide important alternatives over multiple sequence alignment (MSA) in biological sequence analysis because alignment-free approaches have low computation complexity and are not dependent on high level of
sequence identity, however, most of the existing alignment-free methods do not employ true full information content of sequences and thus can not accurately reveal similarities and differences among DNA sequences. We present a novel alignment-free computational method for sequence analysis based on Ramanujan-Fourier transform (RFT), in which complete information of DNA sequences is retained. We represent DNA sequences as four binary indicator sequences and apply RFT on the indicator sequences to convert them into frequency domain. The Euclidean distance of the complete RFT coefficients of DNA sequences are used as similarity measure. To address the different lengths in Euclidean space of RFT coefficients, we pad zeros to short DNA binary sequences so that the binary sequences equal the longest length in the comparison sequence data. Thus, the DNA sequences are compared in the same dimensional frequency space without information loss. We demonstrate the usefulness of the proposed method by presenting experimental results on hierarchical clustering of genes and genomes. The proposed method opens a new channel to biological sequence analysis, classification, and structural module identification.
Despite the common usage of a canonical, data-independent, hemodynamic response function (HRF), it is known that the shape of the HRF varies across brain regions and subjects. This suggests that a data-driven estimation of this function could lead to
more statistical power when modeling BOLD fMRI data. However, unconstrained estimation of the HRF can yield highly unstable results when the number of free parameters is large. We develop a method for the joint estimation of activation and HRF using a rank constraint causing the estimated HRF to be equal across events/conditions, yet permitting it to be different across voxels. Model estimation leads to an optimization problem that we propose to solve with an efficient quasi-Newton method exploiting fast gradient computations. This model, called GLM with Rank-1 constraint (R1-GLM), can be extended to the setting of GLM with separate designs which has been shown to improve decoding accuracy in brain activity decoding experiments. We compare 10 different HRF modeling methods in terms of encoding and decoding score in two different datasets. Our results show that the R1-GLM model significantly outperforms competing methods in both encoding and decoding settings, positioning it as an attractive method both from the points of view of accuracy and computational efficiency.
In the 1988 textbook Fractals Everywhere M. Barnsley introduced an algorithm for generating fractals through a random procedure which he called the chaos game. Using ideas from the classical theory of covering times of Markov chains we prove an asymp
totic formula for the expected time taken by this procedure to generate a $delta$-dense subset of a given self-similar fractal satisfying the open set condition.
We define interacting particle systems on configurations of the integer lattice (with values in some finite alphabet) by the superimposition of two dynamics: a substitution process with finite range rates, and a circular permutation mechanism(called
cut-and-paste) with possibly unbounded range. The model is motivated by the dynamics of DNA sequences: we consider an ergodic model for substitutions, the RN+YpR model ([BGP08]), with three particular cases, the models JC+cpg,T92+cpg, and RNc+YpR. We investigate whether they remain ergodic with the additional cut-and-paste mechanism, which models insertions and deletions of nucleotides. Using either duality or attractiveness techniques, we provide various sets of sufficient conditions, concerning only the substitution rates, for ergodicity of the superimposed process. They imply ergodicity of the models JC+cpg, T92+cpg as well as the attractive RNc+YpR, all with an additional cut-and-paste mechanism.
The recent history of The On-Line Encyclopedia of Integer Sequences (or OEIS), describing developments since 2009, and discussing recent sequences involving interesting unsolved problems and in many cases spectacular illustrations. These include: Pea
ceable Queens, circles in the plane, the earliest cube-free binary sequence, the EKG and Yellowstone permutations, other lexicographically earliest sequences, iteration of number-theoretic functions, home primes and power trains, a memorable prime, a missing prime, Posts tag system, and coordination sequences.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
