Revisiting the relationship between compositional sequence complexity and periodicity
From MaRDI portal
Publication:936027
DOI10.1016/J.COMPBIOLCHEM.2007.09.001zbMath1144.92014OpenAlexW1980548187WikidataQ48076638 ScholiaQ48076638MaRDI QIDQ936027
Publication date: 12 August 2008
Published in: Computational Biology and Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2007.09.001
Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
Uses Software
Cites Work
- Information capacity of nucleotide sequences and its applications
- Information decomposition method to analyze symbolical sequences
- A maximum entropy principle for the distribution of local complexity in naturally occurring nucleotide sequences
- On the robustness of maximum entropy relationships for complexity distributions of nucleotide sequences
- Shuffling biological sequences
This page was built for publication: Revisiting the relationship between compositional sequence complexity and periodicity