Replica procedure for probabilistic algorithms as a model of gene duplication

DOI10.1134/S1064562411060032zbMATH Open1317.92053arXiv1105.2893OpenAlexW2125039897MaRDI QIDQ653048FDOQ653048

Authors: S. V. Kozyrev, Andrei Khrennikov 

Publication date: 6 January 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

Abstract: In the present paper we propose to describe gene networks in biological systems using probabilistic algorithms. We describe gene duplication in the process of biological evolution using introduction of the replica procedure for probabilistic algorithms. We construct the examples of such a replica procedure for hidden Markov models. We introduce the family of hidden Markov models where the set of hidden states is a finite additive group with a p-adic metric and build the replica procedure for this family of markovian models.

Full work available at URL: https://arxiv.org/abs/1105.2893

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Genetics and epigenetics (92D10)

Cites Work

• Title not available (Why is that?)
• 2-adic numbers in genetics and Rumer's symmetry
• A \(p\)-adic model of DNA sequence and genetic code
• Title not available (Why is that?)
• Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
• Title not available (Why is that?)

Cited In (4)

• \(p\)-adic mathematical physics: the first 30 years
• Classification by ensembles of neural networks
• Learning problem for functional programming and model of biological evolution
• Non-Archimedean replicator dynamics and Eigen's paradox

This page was built for publication: Replica procedure for probabilistic algorithms as a model of gene duplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653048)