Markovian language model of the DNA and its information content

This work proposes a Markovian memoryless model for the DNA that simplifies enormously the complexity of it. We encode nucleotide sequences into symbolic sequences, called words, from which we establish meaningful length of words and groups of words that share symbolic similarities. Interpreting a n...

Full description

Bibliographic Details
Main Authors: S. Srivastava, M. S. Baptista
Format: Article
Language:English
Published: The Royal Society 2016-01-01
Series:Royal Society Open Science
Subjects:
Online Access:https://royalsocietypublishing.org/doi/pdf/10.1098/rsos.150527
id doaj-90c8a44b05fd490a9f5db766f0439ee3
record_format Article
spelling doaj-90c8a44b05fd490a9f5db766f0439ee32020-11-25T03:08:41ZengThe Royal SocietyRoyal Society Open Science2054-57032016-01-013110.1098/rsos.150527150527Markovian language model of the DNA and its information contentS. SrivastavaM. S. BaptistaThis work proposes a Markovian memoryless model for the DNA that simplifies enormously the complexity of it. We encode nucleotide sequences into symbolic sequences, called words, from which we establish meaningful length of words and groups of words that share symbolic similarities. Interpreting a node to represent a group of similar words and edges to represent their functional connectivity allows us to construct a network of the grammatical rules governing the appearance of groups of words in the DNA. Our model allows us to predict the transition between groups of words in the DNA with unprecedented accuracy, and to easily calculate many informational quantities to better characterize the DNA. In addition, we reduce the DNA of known bacteria to a network of only tens of nodes, show how our model can be used to detect similar (or dissimilar) genes in different organisms, and which sequences of symbols are responsible for most of the information content of the DNA. Therefore, the DNA can indeed be treated as a language, a Markovian language, where a ‘word’ is an element of a group, and its grammar represents the rules behind the probability of transitions between any two groups.https://royalsocietypublishing.org/doi/pdf/10.1098/rsos.150527dna linguistic modelsymbolic dynamicsmarkov partitionschains and modelsinformation and ergodic theorynetwork theory
collection DOAJ
language English
format Article
sources DOAJ
author S. Srivastava
M. S. Baptista
spellingShingle S. Srivastava
M. S. Baptista
Markovian language model of the DNA and its information content
Royal Society Open Science
dna linguistic model
symbolic dynamics
markov partitions
chains and models
information and ergodic theory
network theory
author_facet S. Srivastava
M. S. Baptista
author_sort S. Srivastava
title Markovian language model of the DNA and its information content
title_short Markovian language model of the DNA and its information content
title_full Markovian language model of the DNA and its information content
title_fullStr Markovian language model of the DNA and its information content
title_full_unstemmed Markovian language model of the DNA and its information content
title_sort markovian language model of the dna and its information content
publisher The Royal Society
series Royal Society Open Science
issn 2054-5703
publishDate 2016-01-01
description This work proposes a Markovian memoryless model for the DNA that simplifies enormously the complexity of it. We encode nucleotide sequences into symbolic sequences, called words, from which we establish meaningful length of words and groups of words that share symbolic similarities. Interpreting a node to represent a group of similar words and edges to represent their functional connectivity allows us to construct a network of the grammatical rules governing the appearance of groups of words in the DNA. Our model allows us to predict the transition between groups of words in the DNA with unprecedented accuracy, and to easily calculate many informational quantities to better characterize the DNA. In addition, we reduce the DNA of known bacteria to a network of only tens of nodes, show how our model can be used to detect similar (or dissimilar) genes in different organisms, and which sequences of symbols are responsible for most of the information content of the DNA. Therefore, the DNA can indeed be treated as a language, a Markovian language, where a ‘word’ is an element of a group, and its grammar represents the rules behind the probability of transitions between any two groups.
topic dna linguistic model
symbolic dynamics
markov partitions
chains and models
information and ergodic theory
network theory
url https://royalsocietypublishing.org/doi/pdf/10.1098/rsos.150527
work_keys_str_mv AT ssrivastava markovianlanguagemodelofthednaanditsinformationcontent
AT msbaptista markovianlanguagemodelofthednaanditsinformationcontent
_version_ 1724664808379252736