Generating Markov evolutionary matrices for a given branch length

DOI10.1016/J.LAA.2012.11.009zbMATH Open1267.15030arXiv1112.3529OpenAlexW2964011350WikidataQ61068397 ScholiaQ61068397MaRDI QIDQ1938705FDOQ1938705

Anna M. Kedzierska, Marta Casanellas

Publication date: 22 February 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Under a markovian evolutionary process, the expected number of substitutions per site (also called branch length) that have occurred when a sequence has evolved from another according to a transition matrix $P$ can be approximated by $-1/4logdetP.$ When the Markov process is assumed to be continuous in time, i.e. $P=expQt$ it is easy to simulate this evolutionary process for a given branch length (this amounts to requiring $Q$ of a certain trace). For the more general case (what we call discrete-time models), it is not trivial to generate a substitution matrix $P$ of given determinant (i.e. corresponding to a process of given branch length). In this paper we solve this problem for the most well-known discrete-time models JC*, K80*, K81*, SSM and GMM. These models lie in the class of nonhomogeneous evolutionary models. For any of these models we provide concise algorithms to generate matrices $P$ of given determinant. Moreover, in the first four models, our results prove that any of these matrices can be generated in this way. Our techniques are mainly based on algebraic tools.

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

zbMATH Keywords

algorithmdeterminantstochastic matricesMarkov matrixbranch lengthdiscrete-time modelevolutionary modelnonhomogeneous evolutionary processes

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Determinants, permanents, traces, other special matrix functions (15A15) Stochastic matrices (15B51)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic Statistics for Computational Biology
• On the ideals of equivariant tree models
• Phylogenetic invariants for the general Markov model of sequence mutation
• The Strand Symmetric Model
• Toric Ideals of Phylogenetic Invariants
• On the Existence and Uniqueness of the Real Logarithm of a Matrix
• Relevant phylogenetic invariants of evolutionary models
• Mathematical Models in Biology
• Recovering a tree from the leaf colourations it generates under a Markov model
• Estimation of evolutionary distances between homologous nucleotide sequences.
• Statistical analysis of hominoid molecular evolution

Cited In (4)

• Markov evolution algebras
• An open set of 4×4 embeddable matrices whose principal logarithm is not a Markov generator
• Generating embeddable matrices whose principal logarithm is not a Markov generator
• Embeddability of centrosymmetric matrices capturing the double-helix structure in natural and synthetic DNA

This page was built for publication: Generating Markov evolutionary matrices for a given branch length

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