Title of article :
Compositional complexity of DNA sequence models Original Research Article
Author/Authors :
P. Bernaola-Galv?n، نويسنده , , P. Carpena، نويسنده , , R. Rom?n-Rold?n، نويسنده , , J.L. Oliver، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Pages :
3
From page :
136
To page :
138
Abstract :
Recently, we proposed a new measure of complexity for symbolic sequences (Sequence Compositional Complexity, SCC) based on the entropic segmentation of a sequence into compositionally homogeneous domains. Such segmentation is carried out by means of a conceptually simple, computationally efficient heuristic algorithm. SCC is now applied to the sequences generated by several stochastic models which describe the statistical properties of DNA, in particular the observed long-range fractal correlations. This approach allows us to test the capability of the different models in describing the complex compositional heterogeneity found in DNA sequences. Moreover, SCC detects clear differences where conventional standard methods fail.
Journal title :
Computer Physics Communications
Serial Year :
1999
Journal title :
Computer Physics Communications
Record number :
1135169
Link To Document :
بازگشت