Show simple item record

dc.contributor.authorSrivastava, S.en_US
dc.contributor.authorBaptista, M. S.en_US
dc.date.accessioned2016-10-11T05:37:20Z
dc.date.available2016-10-11T05:37:20Z
dc.date.issued2016en_US
dc.identifier.otherHPU4160676en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/23567en_US
dc.description.abstractThis 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 DNAen_US
dc.format.extent14 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenen_US
dc.subjectBiologyen_US
dc.subjectBioinformaticsen_US
dc.subjectComputational biologyen_US
dc.subjectStatistical physicsen_US
dc.subjectDNA linguistic modelen_US
dc.subjectSymbolic dynamicsen_US
dc.subjectMarkov partitionsen_US
dc.subjectChains andmodelsen_US
dc.subjectInformation and ergodic theoryen_US
dc.subjectNetwork theoryen_US
dc.titleMarkovian language model of the DNA and its information contenten_US
dc.typeArticleen_US
dc.size744KBen_US
dc.departmentEducationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record