A Markovian genomic concatenation model guided by persymmetric matrices
The aim of this work is to provide a rigorous mathematical analysis of a stochastic concatenation model presented by Sobottka and Hart (2011) which allows approximation of the first-order stochastic structure in bacterial DNA by means of a stationary Markov chain. Two probabilistic constructions that rigorously formalize the model are presented. Necessary and sufficient conditions for a Markov chain to be generated by the model are given, as well as the theoretical background needed for designing new algorithms for statistical analyses of real bacterial genomes. It is shown that the model encompasses the Markov chains satisfying intra-strand parity, a property observed in most DNA sequences.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Supersymmetric Artificial Neural Network
The “Supersymmetric Artificial Neural Network” in deep learning (denoted (x; θ, bar{θ})Tw), espouses the importance of considering biological constraints in the aim of further generalizing backward propagation. Looking…
Deep LearningTruth, beauty, and goodness in grand unification: a machine learning approach
We investigate the flavour sector of the supersymmetric $SU(5)$ Grand Unified Theory (GUT) model using machine learning techniques. The minimal $SU(5)$ model is known to predict fermion masses that disagree with observed…
MetaCompass: Reference-guided Assembly of Metagenomes
Metagenomic studies have primarily relied on de novo assembly for reconstructing genes and genomes from microbial mixtures. While reference-guided approaches have been employed in the assembly of single organisms, they h…
Violina: Various-of-trajectories Identification of Linear Time-invariant Non-Markovian Dynamics
We propose a new system identification method Violina (various-of-trajectories identification of linear time-invariant non-Markovian dynamics). In the Violina framework, we optimize the coefficient matrices of state-spac…
State Space ModelsOptimal Best Markovian Arm Identification with Fixed Confidence
We give a complete characterization of the sampling complexity of best Markovian arm identification in one-parameter Markovian bandit models. We derive instance specific nonasymptotic and asymptotic lower bounds which ge…