Phylosymmetric Algebras: Mathematical Properties of a New Tool in Phylogenetics

Abstract

In phylogenetics, it is of interest for rate matrix sets to satisfy closure under matrix multiplication as this makes finding the set of corresponding transition matrices possible without having to compute matrix exponentials. It is also advantageous to have a small number of free parameters as this, in applications, will result in a reduction in computation time. We explore a method of building a rate matrix set from a rooted tree structure by assigning rates to internal tree nodes and states to the leaves, then defining the rate of change between two states as the rate assigned to the most recent common ancestor of those two states. We investigate the properties of these matrix sets from both a linear algebra and a graph theory perspective and show that any rate matrix set generated this way is closed under matrix multiplication. The consequences of setting two rates assigned to internal tree nodes to be equal are then considered. This methodology could be used to develop parameterised models of amino acid substitution which have a small number of parameters but convey biological meaning.

Introduction

Phylogenetics is the study of constructing phylogenetic trees that represent evolutionary history. Analysis of RNA, DNA and protein sequence data with the use of continuous time Markov chains to measure the frequency of occurrence of point mutations is commonly employed in this field. From a continuous time Markov chain, transitions matrices (whose matrix entries represent probabilities of a change of state for a set time period) and rate matrices (whose entries represent the rates of change between states) can be generated. Transition matrices in phylogenetics are typically classified as either empirical, where the transition probabilities are values which have been calculated by analysing sequence data, or parameterised, where transition probabilities are represented by free parameters which are chosen to fit data as needed (Yang 2014). Given that a parameterised transition matrix contains free parameters, it can be thought of as a set of transition matrices and such a set is often referred to as a model where the set of transition matrices is denoted by $\mathcal{M}$ and the set of corresponding rate matrices is denoted by $\mathcal{Q}$. Parameterised models are often developed to be consistent with biological and chemical mechanisms (e.g. the K2P model Kimura 1980 captures the fact that it is chemically easier to substitute a purine for a purine or a pyrimidine for a pyrimidine) but sometimes they are developed to satisfy mathematical properties. Some parameterised models are more complicated than setting two rates to be equal to each other, e.g. there are multiplicative constraints on matrix entries. In this paper, however, we will only be looking at models whose constraints are that some rates are equal to other rates.

The Lie Markov models (LMM) (Sumner et al. 2012; Fernández-Sánchez et al. 2015) are a set of parameterised DNA rate substitution models. Their construction is based on mathematical properties of matrices; each rate matrix model in this set forms a Lie algebra (note that a Lie algebra in this context can be defined as a matrix vector space which is closed under the operation $[A,B]=AB-BA$) as this guarantees that each transition matrix set is closed under matrix multiplication. In a study following this, Shore (2015) found that if a rate matrix set, $\mathcal{Q}$, forms a matrix algebra (a matrix algebra we define as a matrix vector space which is closed under matrix multiplication, any matrix algebra is automatically a Lie algebra), the set of corresponding transition matrices is $\{I+Q:Q\in \mathcal{Q},$ det$(I+Q)\ne 0\}$. This makes finding the space of corresponding transition matrices a straightforward process compared to the usual practice of having to calculate matrix exponentials, which is notoriously computationally expensive (Moler and Van Loan 1978), although unfortunately this does not completely absolve the necessity of calculating matrix exponentials in practice. It is therefore advantageous for a rate matrix set to form a matrix algebra.

The study conducted by Shore et al. (2020) employed a method devised by Wills et al. (2015) of generating rate matrix sets from trees by labelling leaves on a rooted tree as the states and then defining the rate of change between two states to be the rate assigned to their most recent common ancestor. (Note that this method is explained in more detail in Sect. 2.) This method was used to test if certain biological mechanisms to distinguish amino acids could have developed in a serial manner (i.e. the specificity of a mechanism increased over time) and what properties of amino acids could have effected this development. To test this, the rooted trees were used to represent the increasing specificity of amino acid selection mechanisms rather than the evolution of a group of organisms.

Their methodology, which is now the focus of this work, was used to show that there is a link between properties of amino acids (namely, their polarity and the class in which their corresponding aaRS fall into) and the observed rates of change between amino acids as described in Le and Gascuel (2008). Given that this methodology has already been shown to correlate with biological mechanisms, it is now proposed that it be used to develop a suite of parameterised substitution models; particularly for amino acid substitution of which the most commonly used rate matrices are empirical. The family of rate matrix sets generated by this method has previously been unexplored, and we now aim to gain a mathematical understanding of these matrix sets.

In the present paper, we introduce a set of matrices associated with trees with rates associated to each interior vertex. In Sect. 3, we derive results on the multiplication of these matrices, and show, in the case that each rate is unique, that the matrices form a matrix algebra, which we refer to as a phylosymmetric algebra. In Sect. 5, we extend this result to completely characterise all conditions for which the matrices form a matrix algebra when two rates are identical, and derive sufficient conditions for simple cases of arbitrarily many equal rates.

Background

Definition 1

A rooted tree $\mathcal{T}$ on a set of taxa X is a connected, directed acyclic graph with no vertices of degree-2 other than the root, and whose leaves (degree-1 vertices) are bijectively labelled by the set X. The vertices other than the root and the leaves are referred to as internal vertices. Subtrees of $\mathcal{T}$ are denoted by T. The set of all rooted trees on a set of taxa X is denoted RP(X).

All trees in this paper are rooted trees and are permitted to be non-binary. We will henceforth refer to them as X-trees, or simply trees if there is no ambiguity.

If there is a directed edge from a vertex u to a vertex v, then we say that u is a parent of v and v is a child of u. If there is a directed path from u to v, then u is an ancestor of v and v is a descendant of u. In particular, a parent of a vertex v is always an ancestor of v, a child of v is always a descendant of v, and v is both an ancestor and descendant of itself. If two vertices u and v share a parent vertex, we say that u and v are siblings of each other.

Definition 2

A hierarchy H on a set X is a collection of subsets of X with the following properties:

1. H contains both X and all singleton sets $\{x\}$ for $x\in X$.

2. If $H_1,H_2\in H$, then $H_1\cap H_2=\varnothing$, $H_1\subseteq H_2$ or $H_2\subseteq H_1$.

Definition 3

Let $\mathcal{T}\in RP(X)$ be a tree and v be a vertex of $\mathcal{T}$. Then, the cluster of $\mathcal{T}$ associated with v is the subset of X consisting of the descendants of v in $\mathcal{T}$.

A collection of subsets of X is a hierarchy if and only if it is the set of clusters of some rooted tree $\mathcal{T}$ taken over all vertices of $\mathcal{T}$ (see Steel 2016 for instance). For this reason, we refer to the set of clusters of T as the hierarchy of $\mathcal{T}$, denoted $H(\mathcal{T})$.

Suppose $\mathcal{T}$ is a tree with vertex set V and leaf set $X=\{1,2,\dots ,n\}\subseteq V$. For each pair of vertices a, b we denote their most recent common ancestor as mrca(a, b). Define a function $\omega :V\to \mathbb{R}$ that assigns a real number to each vertex of the tree. For each vertex, $u\in V$, we call $\omega (u)=\alpha$ the rate at u. Define the subset $C_{\alpha }\subseteq X\times X$ where $(x,y)\in C_{\alpha }$ if and only if mrca$(x,y)=u$ for all u with $\omega (u)=\alpha$. It follows that the set $\{C_{\alpha }:\alpha \in V\}$ forms a partition of $X\times X$.

To each $C_{\alpha }$, we associate an $n\times n$ matrix $Q_{\alpha }$ with off diagonal entries given by

$$\begin{array}{c}\hfill {(Q_{\alpha })}_{\mathit{xy}}=\left\{\begin{array}{cc}1\hfill & \text{if}\text{mrca}(x,y)=u,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right);\end{array}$$

and diagonal entries

$$\begin{array}{c}\hfill {(Q_{\alpha })}_{\mathit{xx}}=-\#(z:(x,z)\in C_{\alpha }).\end{array}$$

We refer to $Q_{\alpha }$ as the rate matrix associated with $\alpha$. Note that when u is a leaf on $\mathcal{T}$, the corresponding rate matrix $Q_{\alpha }=0$, and that matrices produced by the mrca function are symmetric. The set of mrca matrices produced by a single tree form the basis for a matrix algebra (see Theorem 8). Therefore, products in this space are symmetric, which implies that the algebra is commutative (see Lemma 1). The intent of this paper is to investigate the properties of the resulting set of matrix algebras.

Remark 1

It follows quickly from the definitions that

$$\begin{array}{c}\hfill \sum _{\alpha \in \omega (V)}{Q}_{\alpha }=J,\end{array}$$

where J is the $n\times n$ matrix with 1 in each off diagonal entry and $1-n$ in each diagonal entry. In fact, for a tree with a unique rate at every vertex, if some non-leaf vertex u has m leaf descendants and we denote the set of all vertices that are descendants of some vertex u by $V_u$, we can see that

$$\begin{array}{c}\hfill \sum _{\alpha \in \omega (V_u)}{Q}_{\alpha }=J_u,\end{array}$$

where $J_u$ is the matrix

$$\begin{array}{c}\hfill {(J_u)}_{\mathit{ij}}=\left\{\begin{array}{cc}1\hfill & \text{if}i\ne j\text{and}i,j\text{are descendants of}u,\hfill \\ -m\hfill & \text{if}i=j,\text{and}\hfill \\ 0\hfill & \text{otherwise.}\hfill \end{array}\right)\end{array}$$

Lemma 1

If the product of two symmetric matrices is also symmetric, then those two matrices commute (Leon 2010).

Proof

Let A, B and AB be symmetric matrices. Then, we have:

$$\begin{array}{cc}\hfill \mathit{AB}& ={(AB)}^T\hfill \\ \hfill & =B^T{A}^T\hfill \\ \hfill & =BA.\hfill \end{array}$$

$\square$

Example 1

We end this section by computing the rate matrix set associated with the tree in Fig. 1.

Fig. 1.

A rooted tree on taxa $X=\{1,2,3,4,5\}$, with all non-leaf vertices labelled by their rates

In this space, we have

$$\begin{array}{cc}& Q_{\alpha }=\left(\begin{array}{ccccc}\hfill -3& \hfill 0& \hfill 1& \hfill 1& \hfill 1\\ \hfill 0& \hfill -3& \hfill 1& \hfill 1& \hfill 1\\ \hfill 1& \hfill 1& \hfill -2& \hfill 0& \hfill 0\\ \hfill 1& \hfill 1& \hfill 0& \hfill -2& \hfill 0\\ \hfill 1& \hfill 1& \hfill 0& \hfill 0& \hfill -2\end{array}\right),Q_{\beta }=\left(\begin{array}{ccccc}\hfill -1& \hfill 1& \hfill 0& \hfill 0& \hfill 0\\ \hfill 1& \hfill -1& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\end{array}\right),\hfill \\ \hfill & Q_{\gamma }=\left(\begin{array}{ccccc}\hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill -2& \hfill 1& \hfill 1\\ \hfill 0& \hfill 0& \hfill 1& \hfill -1& \hfill 0\\ \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill -1\end{array}\right),Q_{\delta }=\left(\begin{array}{ccccc}\hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill -1& \hfill 1\\ \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill -1\end{array}\right),\hfill \end{array}$$

and the matrix algebra is the set

$$\begin{array}{c}\hfill \left\{\left(\begin{array}{ccccc}\hfill \ast & \hfill \beta & \hfill \alpha & \hfill \alpha & \hfill \alpha \\ \hfill \beta & \hfill \ast & \hfill \alpha & \hfill \alpha & \hfill \alpha \\ \hfill \alpha & \hfill \alpha & \hfill \ast & \hfill \gamma & \hfill \gamma \\ \hfill \alpha & \hfill \alpha & \hfill \gamma & \hfill \ast & \hfill \delta \\ \hfill \alpha & \hfill \alpha & \hfill \gamma & \hfill \delta & \hfill \ast \end{array}\right),:,,\alpha ,,,\beta ,,,\gamma ,,,\delta ,\in ,\mathbb{R}\right\}\end{array}$$

where $\ast$ is chosen to give zero row, and column, sum.

The Link to Graph Theory

We can also construct the matrix algebra corresponding to a tree $\mathcal{T}$ by considering a certain set of graphs associated with $\mathcal{T}$ that we will refer to as tree-induced graph sets (or TIGS). The basis elements of the matrix algebra will then be the Laplacian matrices of the associated TIGS.

Definition 4

Let ${\mathcal{G}}_X$ be a set of graphs on vertex set X, where ${\mathcal{G}}_X=\{G_1=(X,E_1),\dots ,G_{\ell }=(X,E_{\ell })\}$ with edge sets $E_1,\dots ,E_{\ell }$ disjoint, such that $(X,\cup E_i)$ is the complete graph on |X| vertices. Suppose each graph $G_i\in \mathcal{G}$ is a disjoint union $Z_i\bigsqcup C_i$ where $Z_i$ is a set of degree-0 vertices and $C_i$ is a complete k-partite graph for some k, and that without loss of generality that $G_1$ contains no degree-0 vertices. Finally, given a graph $G_i$ in $\mathcal{G}$, suppose that for each part P of the k partitions in $C_i$ that contain more than one element, there exists a unique graph $G_j$ where $V(C_j)=V(P)$. Then, we call $\mathcal{G}$ a tree-induced graph set (or TIGS).

This definition may seem opaque, so we provide an example to aid understanding. While the TIGS have been defined independently of trees, there is a very natural association between TIGS and trees, described in Theorem 1. We can therefore refer to a tree and its associated TIGS, with the intention of examining the TIGS using the Laplacian of each graph in the graph set.

Example 2

For example, consider the set of graphs depicted in Fig. 2. We can see that $G_{\alpha }$ is the only graph in the set that has no degree zero vertices. Further, $G_{\alpha }$ is a bipartite graph, with partitions $P_1=\{1,2\}$ and $P_2=\{3,4,5\}$. We can then see that $V(G_{\beta })$ corresponds to the partition $P_1$, as $C_{\beta }=P_1$ and $Z_{\beta }=X\backslash P_1$, and that $C_{\beta }$ is bipartite with partitions $\{1\}$ and $\{2\}$. Similarly, $G_{\gamma }$ corresponds to the partition $P_2$ of $G_{\alpha }$, and $G_{\gamma }$ is bipartite with partitions $\{3\}$ and $\{4,5\}$. Finally, $G_{\delta }$ corresponds to the partition $\{4,5\}$ of $G_{\gamma }$. As the only remaining partitions are singletons, the set $\{G_{\alpha },G_{\beta },G_{\gamma },G_{\delta }\}$ is a TIGS.

Fig. 2.

An example of a TIGS. Additionally, these graphs are the $\alpha$-, $\beta$-, $\gamma$- and $\delta$-mrca graphs of the tree in Fig. 1, as defined in Definition 5

Theorem 1

There exists a bijection between the set of hierarchies on X and the set of tree-induced graph sets on X.

Proof

For a cluster A in a hierarchy H(T) with inclusion-maximal subclusters $A_1,\dots ,A_{\ell }$, we can define the graph $G(A)=(V,E)$ where $V=X$ and $e=(v,w)\in E$ if and only if v and w are in the same inclusion-maximal subcluster $A_i$. This is the disjoint union of the complete graphs $K_{A_i}$. Let Z be the subset of V corresponding to $X\backslash A$. Let $\phi$ be a function that maps A to $G(A)\cup Z$, and let ${\phi }^C$ be the function that maps A to $G^C(A)\cup Z$, where $G^C$ denotes the complement of G (that is, the graph consisting of the same vertex set as G and an edge between vertices v and w if and only if there is not an edge between them in G).

Denote by $\varphi$ the function that maps H(T) to the set $\{{\phi }^C(A)\mid A\in H(T)\}$. This is certainly injective, as $\phi$ and the operation of taking the complement on the subgraph induced by G(A) are both invertible. We therefore just need to show that the image of $\varphi$ is precisely the set of TIGS.

Suppose we have some TIGS $\mathcal{G}=\{G_1=(X,E_1),\dots ,G_{\ell }=(X,E_k)\}$. Let ${\mathcal{G}}^C=\{C_1^C\cup Z_1,\dots ,C_k^C\cup Z_k\}$, where for $C_i$ the complement is taken on the induced subgraph of $C_i$. Let $H_{i,j}$ be the vertex set of the jth complete graph of $C_i$. We claim that $\mathcal{H}=\{X\}\cup S\cup \{H_{i,j}\mid i\in \{1,\dots ,\ell \},j\in \{1,\dots ,k\}\}$ forms a hierarchy, where S is the set of singletons on X.

Recall that a hierarchy is a set of subsets of X that contains X, all singletons and the intersection between two subsets A and B is A, B or empty. Certainly, $\mathcal{H}$ contains all singletons, and the intersection of any $H_{i,j}$ with X is $H_{i,j}$, so it only remains to check that for any $H_{i_1,j_1},H_{i_2,j_2}$ the intersection $H_{i_1,j_1}\cap H_{i_2,j_2}$ is either empty or one of $H_{i_1,j_1}$ or $H_{i_2,j_2}$.

Suppose $H_{i_1,j_1}\cap H_{i_2,j_2}$ is non-empty. The only way that this is possible is if $V(C_{i_1})$ is a subset of one of the partitions of $C_{i_2}$, or vice versa. But then, respectively, $H_{i_1,j_1}\subseteq H_{i_2,j_2}$ or the reverse, so the intersection $H_{i_1,j_1}\cap H_{i_2,j_2}$ is one of $H_{i_1,j_1}$ or $H_{i_2,j_2}$.

It follows that $\mathcal{H}$ is a hierarchy and therefore that the stated bijection exists. $\square$

Following the construction in Theorem 1, for each interior vertex of a tree, with rate $\alpha$, we can associate a single graph.

Definition 5

Let $\mathcal{T}$ be a tree with associated mrca partition $C_{\alpha }$. Let $G_{\alpha }$ be the graph (V, E) where $V=X$ and an edge $e=(x,y)\in E$ if and only if $\omega (mrca(x,y))=\alpha$. Then, $G_{\alpha }(\mathcal{T})$ is referred to as the $\alpha$-mrca graph of $\mathcal{T}$.

Then, the set of mrca graphs of $\mathcal{T}$ is the corresponding tree-induced graph set as seen in Theorem 1. For example, the corresponding set of mrca graphs of the tree in Fig. 1 is shown in Fig. 2.

Recall the following standard graph-theoretic definitions.

Definition 6

Let $G=(V,E)$ be a graph. Then, the adjacency matrix A(G) of G is the $|V|\times |V|$ matrix where

$$\begin{array}{c}\hfill {(A(G))}_{\mathit{vw}}=\left\{\begin{array}{cc}1\hfill & \text{if}(v,w)\in E,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right).\end{array}$$

The degree matrix D(G) of G is the diagonal $|V|\times |V|$ matrix

$$\begin{array}{c}\hfill {(D(G))}_{\mathit{vw}}=\left\{\begin{array}{cc}deg(v)\hfill & \text{if}v=w,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right).\end{array}$$

Finally, the Laplacian matrix L(G) of G is the $|V|\times |V|$ matrix $L(G)=D(G)-A(G)$. We simply write L, D, A if G is clear from context.

One can then see that the set of negative Laplacians of the associated mrca graphs of $\mathcal{T}$ correspond exactly to the basis elements of the matrix algebra.

Theorem 2

For any tree $\mathcal{T}$, interior vertex u, and rate $\omega (u)=\alpha$, $Q_{\alpha }=-L(G_{\alpha }(\mathcal{T}))$.

In the next section, we will use the properties of the Laplacians of the associated mrca graphs to prove properties of the resulting matrix algebras.

Algebras Induced by Trees with Distinct Rates for each Vertex

We will now show that for a given tree, the set of rate matrices under matrix multiplication forms a matrix algebra.

Definition 7

A matrix algebra is a matrix vector space which is closed under matrix multiplication. A phylosymmetric algebra is a matrix set generated from a rooted tree using the previously described method. It always forms an commutative matrix algebra when the rates assigned to the non-leaf vertices are unique (see Theorem 8). We denote the matrix set generated from a tree $\mathcal{T}$ by ${\mathcal{Q}}_{\mathcal{T}}$.

In order to prove that the set of rate matrices under matrix multiplication for a given tree $\mathcal{T}$ forms a matrix algebra, it suffices to check that for each possible pair of rate matrices $Q_{\alpha },Q_{\beta }$, the product $Q_{\alpha }{Q}_{\beta }$ is a linear combination of rate matrices derived from $\mathcal{T}$. To do this, we will need to be able to refer the relationship between different vertices of $\mathcal{T}$.

Definition 8

For a tree $\mathcal{T}$ and two vertices on this tree u and v, we say that

• u and v are comparable if either u is a descendant of v or the reverse.

• u and v are incomparable if u is neither an ancestor nor a descendant of v.

We will also need to refer to different subtrees of $\mathcal{T}$.

Definition 9

For a tree $\mathcal{T}$ which has an internal vertex u with rate $\omega (u)=\alpha$, we define

• $T^{\alpha }$ as the subtree rooted at u;

• $T_{\beta }^{\alpha }$ as the subtree rooted at the child of u that is an ancestor of v.

Finally, we will need to appeal to some classical graph-theoretical results. Theorem 3 is folkloric and easily proven (see e.g. Brouwer and Haemers 2011, Proposition 1.3.1) and Theorem 4 can be proven in an almost identical way. We provide them here as they will be heavily used in the following work.

Theorem 3

Let G be a graph and $A=A(G)$ its adjacency matrix. Then, ${(A^k)}_{\mathit{ij}}$ is the number of walks of length k on G from vertex i to vertex j.

Theorem 4

Let $G_1=(V,E_1)$ and $G_2=(V,E_2)$ be graphs on the same set of vertices and $A_1=A(G_1),A_2=A(G_2)$ their corresponding adjacency matrices. Consider the multigraph $G^{\times }=(V,E_1\cup E_2)$. Then, ${(A_1{A}_2)}_{\mathit{ij}}$ is the number of walks of length 2 on $G^{\times }$ from vertex i to vertex j, where the first edge is taken from $E_1$ and the second from $E_2$.

We are now in a position to investigate matrix multiplication of elements of ${\mathcal{Q}}_{\mathcal{T}}$, by appealing to the structure of the associated TIGS. We will consider squares of a rate matrix first.

Theorem 5

Let u be a vertex of a tree T so that $\omega (u)=\alpha$, and let $G_{\alpha }$ be an $\alpha$-mrca graph, and $Q_{\alpha }=-L(G_{\alpha })=A_{\alpha }-D_{\alpha }$ be the $n\times n$ matrix described before. Suppose $D_{\alpha }=\mathrm{diag}(d_1,...,d_n)$. Then,

$$\begin{array}{c}\hfill {(Q_{\alpha }^2)}_{\mathit{ij}}=\left\{\begin{array}{cc}{d}_i(d_i+1)\hfill & \text{if}i=j,\hfill \\ -|T^{\alpha }|\hfill & \text{if}i\text{and}j\text{are in different}k\text{-partitions of}{G}_{\alpha }\hfill \\ d_i\hfill & \text{if}i\ne j\text{are in the same}k\text{-partition of}{G}_{\alpha }\hfill \end{array}\right).\end{array}$$

Equivalently, if we denote the set of child vertices of u by $C_u$,

$$\begin{array}{c}\hfill Q_{\alpha }^2=(1-|T^{\alpha }|)Q_{\alpha }+\sum _{\beta \in \omega (C_u)}\left[(|,T^{\alpha },|-|,T^{\beta },|),\left(\sum _{\gamma \in \omega (V_u)},Q_{\gamma }\right)\right].\end{array}$$

Proof

Since $Q_{\alpha }=A_{\alpha }-D_{\alpha }$, we know $Q_{\alpha }^2=A_{\alpha }^2-D_{\alpha }{A}_{\alpha }-A_{\alpha }{D}_{\alpha }+D_{\alpha }^2$, and it suffices to consider each of these terms separately.

As $D_{\alpha }$ is a diagonal matrix, the last three terms are trivial to calculate. Certainly, $D_{\alpha }^2=\mathrm{diag}(d_1^2,\dots ,d_n^2)$. Further,

$$\begin{array}{c}\hfill {(D_{\alpha }{A}_{\alpha })}_{\mathit{ij}}=d_i{(A)}_{\mathit{ij}}=\left\{\begin{array}{cc}0\hfill & \text{if}i,j\text{are in the same}k\text{-partition of}{G}_{\alpha },\hfill \\ d_i\hfill & \text{otherwise}\hfill \end{array}\right),\end{array}$$

and

$$\begin{array}{c}\hfill {(A_{\alpha }{D}_{\alpha })}_{\mathit{ij}}=d_j{(A)}_{\mathit{ij}}=\left\{\begin{array}{cc}0\hfill & \text{if}i,j\text{are in the same}k\text{-partition of}{G}_{\alpha },\hfill \\ d_j\hfill & \mathrm{otherwise}.\hfill \end{array}\right).\end{array}$$

Now, by Theorem 1, we can consider the associated TIGS graph (and in particular $G_{\alpha }$), and by Theorem 3, ${(A_{\alpha }^2)}_{\mathit{ij}}$ is the number of walks of length 2 from i to j in $G_{\alpha }$. As $G_{\alpha }$ is the complete k-partite graph for k the number of partitions, if i, j are in the same partition, this is simply the number of vertices of $G_{\alpha }$ not in this partition, so $d_i$. If they are in different partitions, this is the number of vertices that are in neither the partition containing i nor the one containing j. If we denote the partition containing i by P(i) and similarly for j, this is $|T^{\alpha }|-|P(i)|-|P(j)|=d_i+d_j-|T^{\alpha }|$, since $|P(i)|=|T^{\alpha }|-d_i$ and $|P(j)|=|T^{\alpha }|-d_j$.

To summarise,

$$\begin{array}{c}\hfill {(A_{\alpha }^2)}_{\mathit{ij}}=\left\{\begin{array}{cc}{d}_i\hfill & \text{if}i,j\text{are in the same}k\text{-partition of}{G}_{\alpha }\hfill \\ d_i+d_j-|T^{\alpha }|\hfill & \text{otherwise.}\hfill \end{array}\right)\end{array}$$

Since $Q_{\alpha }^2=A_{\alpha }^2-D_{\alpha }{A}_{\alpha }-A_{\alpha }{D}_{\alpha }+D_{\alpha }^2$, we therefore obtain

$$\begin{array}{c}\hfill {(Q_{\alpha }^2)}_{\mathit{ij}}=\left\{\begin{array}{cc}{d}_i(d_i+1)\hfill & \text{if}i=j,\hfill \\ -|T^{\alpha }|\hfill & \text{if}i\text{and}j\text{are in different}k\text{-partitions of}{G}_{\alpha }\hfill \\ d_i\hfill & \text{if}i\ne j\text{are in the same}k\text{-partition of}{G}_{\alpha }\hfill \end{array}\right).\end{array}$$

as required.

Finally, equivalence of the two expressions in the statement of the theorem follows simply by observing the entries of the matrix and applying Remark 1. $\square$

We will now consider multiplication of two rate matrices associated to comparable vertices.

Theorem 6

Let u and v be vertices of a tree T so that $\omega (u)=\alpha ,\omega (v)=\beta$. Let $G_{\alpha },G_{\beta }$ be $\alpha$- and $\beta$-mrca graphs, and $Q_{\alpha }=-L(G_{\alpha })=A_{\alpha }-D_{\alpha }$ and $Q_{\beta }=-L(G_{\beta })=A_{\beta }-D_{\beta }$ be the $n\times n$ matrices described before. Finally, suppose that v is a descendant of u. Then,

$$\begin{array}{c}\hfill Q_{\alpha }{Q}_{\beta }=(|T_{\beta }^{\alpha }|-|T^{\alpha }|)Q_{\beta }=Q_{\beta }{Q}_{\alpha }.\end{array}$$

Proof

Suppose $D_{\alpha }=\mathrm{diag}(c_1,\dots ,c_n)$ and $D_{\beta }=\mathrm{diag}(d_1,\dots ,d_n)$. Further let $A_{\alpha }=(a_{\mathit{ij}})$ and $A_{\beta }=(b_{\mathit{ij}})$.

Since $Q_{\alpha }{Q}_{\beta }=(A_{\alpha }-D_{\alpha })(A_{\beta }-D_{\beta })$, we know $Q_{\alpha }{Q}_{\beta }=A_{\alpha }{A}_{\beta }-A_{\beta }{D}_{\alpha }-A_{\alpha }{D}_{\beta }+D_{\alpha }{D}_{\beta }$, and it suffices to consider each of these terms separately.

We first consider $D_{\alpha }{D}_{\beta }$. As v is a descendant of u, any vertex i of $G_{\beta }$ with nonzero degree is a subset of a single k-partition of $G_{\alpha }$. In particular, as $G_{\alpha }$ is a complete k-partite graph $c_i=|T^{\alpha }|-|T_{\beta }^{\alpha }|$ so it follows

$$\begin{array}{c}\hfill {(D_{\alpha }{D}_{\beta })}_{\mathit{ij}}=\left\{\begin{array}{cc}(|T^{\alpha }|-|T_{\beta }^{\alpha }|)d_i\hfill & \text{if}i=j\text{and}i\text{is a descendant of}v,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right).\end{array}$$

Therefore, $(D_{\alpha }{D}_{\beta })=(|T^{\alpha }|-|T_{\beta }^{\alpha }|)D_{\beta }$.

We now consider $A_{\beta }{D}_{\alpha }$. Let ${(A_{\beta })}_{\mathit{ij}}=b_{\mathit{ij}}$. As $D_{\alpha }$ is diagonal, ${(A_{\beta }{D}_{\alpha })}_{\mathit{ij}}=b_{\mathit{ij}}{c}_i$. In particular, $b_{\mathit{ij}}$ is nonzero (in fact 1) if and only if i, j are both descendants of v and i and j are in different partitions of $G_{\beta }$. For all such i, j, we see i and j are in the same partition of $G_{\alpha }$, so again $c_i=|T^{\alpha }|-|T_{\beta }^{\alpha }|$. Hence,

$$\begin{array}{c}\hfill {(A_{\beta }{D}_{\alpha })}_{\mathit{ij}}=\left\{\begin{array}{cc}|T^{\alpha }|-|T_{\beta }^{\alpha }|\hfill & \text{if}i,j\hfill \\ \hfill & \text{are descendants of}v\text{and in separate partitions of}{G}_{\beta },\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right).\end{array}$$

Therefore, $(A_{\beta }{D}_{\alpha })=(|T^{\alpha }|-|T_{\beta }^{\alpha }|)A_{\beta }$.

We now consider $A_{\alpha }{D}_{\beta }$. Let ${(A_{\alpha })}_{\mathit{ij}}=a_{\mathit{ij}}$. As $D_{\beta }$ is diagonal, ${(D_{\alpha }{A}_{\beta })}_{\mathit{ij}}=d_j{a}_{\mathit{ij}}$. In this case, $d_j$ is nonzero if and only if j is a descendant of v. But we know all descendants of v are in the same k-partition of $G_{\alpha }$, so it follows that

$$\begin{array}{c}\hfill {(A_{\alpha }{D}_{\beta })}_{\mathit{ij}}=\left\{\begin{array}{cc}{d}_j\hfill & \text{if}j\text{is a descendant of}v\text{and}i\text{is a descendant of}u\text{but not}v,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right).\end{array}$$

Finally, we consider $A_{\alpha }{A}_{\beta }$. By Theorem 1, we can consider the associated TIGS graph of T (and in particular $G_{\alpha }$ and $G_{\beta }$), and by Theorem 4, this says that if $G_{\alpha }=(V,E_1),G_{\beta }=(V,E_2)$, then by taking the multigraph $G^{\times }=(V,E_1\cup E_2)$, ${(A_{\alpha }{A}_{\beta })}_{\mathit{ij}}$ is the number of walks of length 2 on $G^{\times }$ from vertex i to vertex j, where the first edge $e_1$ is taken from $E_1$ and the second edge $e_2$ from $E_2$. We consider $e_2$ first. This is an edge from leaf k in a partition of $G_{\beta }$ that does not contain j to j itself, of which there are $deg(j)=d_j$ such edges. It follows that, if it exists, $e_1$ is an edge in $G_{\alpha }$ from the vertex i (which is not a descendant of v) to k, of which there is only one. Thus

$$\begin{array}{c}\hfill {(A_{\alpha }{A}_{\beta })}_{\mathit{ij}}=\left\{\begin{array}{cc}{d}_j\hfill & \text{if}j\text{is a descendant of}v\text{and}i\text{is a descendant of}u\text{but not}v,\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\right),\end{array}$$

which means $A_{\alpha }{A}_{\beta }=A_{\alpha }{D}_{\beta }$.

It follows that

$$\begin{array}{cc}\hfill Q_{\alpha }{Q}_{\beta }& =A_{\alpha }{A}_{\beta }-A_{\beta }{D}_{\alpha }-A_{\alpha }{D}_{\beta }+D_{\alpha }{D}_{\beta }\hfill \\ \hfill & =D_{\alpha }{D}_{\beta }-A_{\beta }{D}_{\alpha }\hfill \\ \hfill & =(|T^{\alpha }|-|T_{\beta }^{\alpha }|)D_{\beta }-(|T^{\alpha }|-|T_{\beta }^{\alpha }|)A_{\beta }\hfill \\ \hfill & =(|T^{\alpha }|-|T_{\beta }^{\alpha }|)(D_{\beta }-A_{\beta })\hfill \\ \hfill & =(|T_{\beta }^{\alpha }|-|T^{\alpha }|)Q_{\beta }\hfill \end{array}$$

as required.

To complete the proof, we see that $Q_{\alpha }{Q}_{\beta }=Q_{\beta }{Q}_{\alpha }$, as $Q_{\alpha }$ and $Q_{\beta }$ are symmetric matrices, and their product is a scalar multiple of a symmetric matrix and hence symmetric itself, so by Lemma 1, we know that $Q_{\alpha }$ and $Q_{\beta }$ commute. $\square$

Finally, we consider multiplication of two rate matrices associated with incomparable vertices.

Theorem 7

Suppose that u and v are incomparable vertices so that $\omega (u)=\alpha$ and $\omega (v)=\beta$. Let $G_{\alpha },G_{\beta }$ be $\alpha$- and $\beta$-mrca graphs, and $Q_{\alpha }=A_{\alpha }-D_{\alpha }$ and $Q_{\beta }=A_{\beta }-D_{\beta }$ be the $n\times n$ matrices described before. Then,

$$\begin{array}{c}\hfill Q_{\alpha }{Q}_{\beta }=0_{n\times n}.\end{array}$$

Proof

By Theorem 1, we can consider the associated TIGS graph (and in particular $G_{\alpha }$ and $G_{\beta }$), and as u and v are incomparable, $G_{\alpha }$ and $G_{\beta }$ can have their vertices partitioned into disjoint sets A and B, where $G_{\alpha }$ only has edges between vertices in A, and $G_{\beta }$ only has edges between vertices in B.

It therefore suffices to observe that under an appropriate choice of basis, the Laplacian matrix of each graph is block diagonal, where all nonzero blocks of $Q_{\alpha }$ correspond to zero blocks of $Q_{\beta }$, and vice versa. It follows that

$$\begin{array}{c}\hfill Q_{\alpha }{Q}_{\beta }=0_{n\times n}.\end{array}$$

$\square$

Theorem 8

For a binary rooted tree $\mathcal{T}$, ${\mathcal{Q}}_{\mathcal{T}}$ is an commutative matrix algebra.

Proof

We know that ${\mathcal{Q}}_{\mathcal{T}}$ is a vector space, closed under matrix products (see Theorems 5–7) and that all matrices in ${\mathcal{Q}}_{\mathcal{T}}$ and their products are symmetric, so the space is commutative by Lemma 1.

$\square$

Algebras Induced by Trees with Repeated Rates

So far we have found that when the rates assigned to tree nodes are unique, the matrix set forms an algebra. Now, we explore cases of rates not being unique. We note here that the K2P model is an example of a phylosymmetric algebra with non-unique rates. We see that the tree represented in Fig. 3 gives rise to the K2P model. We know from previous work (Fernández-Sánchez et al. 2015) that the matrix set for K2P is closed under matrix multiplication. However, in the general case, there is no guarantee that a matrix set will still be closed under matrix multiplication when several rates on the tree are set to be equal. It should be noted here that for all cases in which two or more rates are set to be equal, the matrix algebra generated from the same tree with unique rates will always be a commuting matrix algebra which contains the set of rate matrices generated from the tree which contains repeated rates. (This matrix algebra, however, would not honour the constraint of the rates being equal.) We now explore the conditions that have to be met on such a rooted tree for its rate matrix set to be an algebra.

Fig. 3.

A rooted tree on states of DNA with taxa $X=\{$ A, G, C, T $\}$, with all non-leaf vertices labelled by their rates. The phylosymmetric algebra that this tree gives rise to is the K2P model

Definition 10

Let $\mathcal{T}$ be a tree with at least two non-leaf vertices u and v, so that $\omega (u)=\alpha$ and $\omega (v)=\beta$. Let ${\mathcal{T}}^{\prime }$ be a tree with the same topological tree structure and associated rates as $\mathcal{T}$, with the additional constraint that $\alpha =\beta$. (Here, we suppose that there are only two rates on ${\mathcal{T}}^{\prime }$ that are equal.) We note that if ${\mathcal{Q}}_{\mathcal{T}}=$ span${\{Q_{\alpha },Q_{\beta },Q_{\gamma },Q_{\delta },\dots \}}_{\mathbb{R}}$ and we define $Q_X=Q_{\alpha }+Q_{\beta }$, then we have ${\mathcal{Q}}_{{\mathcal{T}}^{\prime }}=$ span${\{Q_X,Q_{\gamma },Q_{\delta },\dots \}}_{\mathbb{R}}$. If ${\mathcal{Q}}_{{\mathcal{T}}^{\prime }}$ is a matrix algebra, we say that $\alpha =\beta$ is a phylo-algebraic constraint.

Labelling two vertices by the same rate is equivalent to adding their rate matrices, so we can consider

$$\begin{array}{c}\hfill {(Q_{\alpha }+Q_{\beta })}^2=Q_{\alpha }^2+Q_{\beta }^2+2Q_{\alpha }{Q}_{\beta },\end{array}$$

as $Q_{\alpha }{Q}_{\beta }=Q_{\beta }{Q}_{\alpha }$ by Lemma 1 and Theorem 6.

If u is an ancestor of v, then by Lemma 5 this becomes

$$\begin{array}{c}\hfill Q_{\alpha }^2+Q_{\beta }^2+2(|T^{\alpha }|-|T^{\beta }|)Q_{\beta },\end{array}$$

and in the particular case that they are incomparable, by Theorem 7 we obtain

$$\begin{array}{c}\hfill Q_{\alpha }^2+Q_{\beta }^2.\end{array}$$

Theorem 9

If $\mathcal{T}$ is a tree and u and v are siblings so that $\omega (u)=\alpha$ and $\omega (v)=\beta$, and u and v have the same number of leaf descendants, $\alpha =\beta$ is a phylo-algebraic constraint (and hence the resultant matrix algebra is closed).

Proof

Suppose u and v are siblings, and have the same number of leaf descendants (i.e. $|T^{\alpha }|=|T^{\beta }|$). Then, by Theorem 5,

$$\begin{array}{cc}& Q_{\alpha }^2+Q_{\beta }^2=-|T^{\alpha }|(Q_{\alpha }+Q_{\beta })\hfill \\ \hfill & +\text{scalar multiples of the rate matrices of their descendants,}\hfill \end{array}$$

which is certainly within the generated matrix set. As u and v are siblings, then for any third vertex w with rate $\gamma$, w is an ancestor to both of them, incomparable to both of them, or incomparable to one and a descendant of the other.

If w is an ancestor of both u and v, then $(Q_{\alpha }+Q_{\beta })Q_{\gamma }=(|T^{\gamma }|-|T^{\beta }|)(Q_{\alpha }+Q_{\beta })$. If w is incomparable to both, $(Q_{\alpha }+Q_{\beta })Q_{\gamma }=0_{n\times n}$. If, w is, say, incomparable to u and a descendant of v, then $(Q_{\alpha }+Q_{\beta })Q_{\gamma }=(|T^{\alpha }|-|T^{\gamma }|)Q_{\gamma }$. This covers all possible cases, as u and v are siblings.

In all three cases, the result is clearly in the algebra, so we will always obtain a phylosymmetric algebra. $\square$

Theorem 10

If $\mathcal{T}$ is a tree, u and v are interior vertices such that $\omega (u)=\alpha$ and $\omega (v)=\beta$, and one of u and v is the parent of the other, $\alpha =\beta$ is a phylo-algebraic constraint

Proof

Suppose without loss of generality, u is the parent of v. We first consider the tree T without the $\alpha =\beta$ constraint. Using Theorem 1, we can consider the associated TIGS, in particular $G_{\alpha }$ and $G_{\beta }$. Suppose $G_{\alpha }$ be a complete k-partite graph and $G_{\beta }$ be a complete $k^{\prime }$-partite graph. In this case, we can see that the only change induced to the corresponding TIGS by the $\alpha =\beta$ constraint is that $G_{\alpha }$ and $G_{\beta }$ are removed and replaced with $G_{\alpha }+G_{\beta }$, where $+$ indicates a graph sum. Then, the resulting mrca graph set is certainly a TIGS, as we can partition $G_{\alpha }+G_{\beta }$ into a complete $(k+k^{\prime }-1)$-partite graph, by applying the k-partition of $G_{\alpha }$ and subpartition the partition consisting of the descendants of v into the $k^{\prime }$ parts corresponding to $G_{\beta }$.

The resultant TIGS therefore corresponds to a tree by Theorem 1, and therefore by Theorem 8 forms a matrix algebra. $\square$

Observation

The set of basis matrices obtained in the case of Lemma 10 coincides exactly with the set of basis matrices of the tree in which the vertices u and v are identified in the graph theoretic sense. Let T be a tree in which there is a union $\cup C_i$ of connected subgraphs of T where each connected subgraph $C_i$ has all rates identified with each other, but not any other connected subgraph $C_j$. Then this will also induce a matrix algebra (indeed a phylosymmetric algebra), as we can sequentially identify parent–child pairs, obtain a matrix algebra corresponding to a tree and then identify another parent–child pair.

Theorem 11

Let $\mathcal{T}$ be a tree with unique rates and ${\mathcal{Q}}_{\mathcal{T}}$ be the phylosymmetric algebra of $\mathcal{T}$. If u and v are interior vertices so that $\omega (u)=\alpha$ and $\omega (v)=\beta$, we define ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ as the matrix set generated from setting $\alpha =\beta$. ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ is a matrix algebra if and only if one of the following is true:

1. u is a parent of v or vice versa; 

2. u and v are siblings and have the same number of leaf descendants.

Proof

For an added constraint $\alpha =\beta$, we let $Q_X=Q_{\alpha }+Q_{\beta }$. We can show that ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ is not a matrix algebra by showing that products in the space cannot be written as linear combinations that include $Q_X$ but do not include $Q_{\alpha }$ and $Q_{\beta }$.

First, we assume that ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ is a matrix algebra. There are five possible ways to describe the positions of two vertices u and v on a tree:

1. There exists a vertex w such that w is a descendant of u and an ancestor of v.

2. There exists a vertex w such that u and w are incomparable and v is a descendant of w.

3. There exists a vertex w with rate $\gamma$ such that u and v are child vertices of w and $|T^{\alpha }|\ne |T^{\beta }|$.

4. There exists a vertex w with rate $\gamma$ such that u and v are child vertices of w and $|T^{\alpha }|=|T^{\beta }|$.

5. The vertex u is a parent of v or vice versa.

In Case 1, we see that

$$\begin{array}{cc}\hfill Q_{\gamma }{Q}_X& =Q_{\gamma }(Q_{\alpha }+Q_{\beta })\hfill \\ \hfill & =Q_{\gamma }{Q}_{\alpha }+Q_{\gamma }{Q}_{\beta }\hfill \\ \hfill & =-n_1{Q}_{\gamma }-n_2{Q}_{\beta }(\because \text{Theorem 6 where}{n}_i\in \mathbb{N}),\hfill \end{array}$$

as $n_1\ne n_2$, therefore $\alpha =\beta$ is not a phylo-algebraic constraint and ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ is not a matrix algebra.

For Case 2, we let u and w be incomparable and v be a descendant of w. We then have

$$\begin{array}{cc}\hfill Q_{\gamma }{Q}_X& =Q_{\gamma }(Q_{\alpha }+Q_{\beta })\hfill \\ \hfill & =Q_{\gamma }{Q}_{\alpha }+Q_{\gamma }{Q}_{\beta }\hfill \\ \hfill & =(|T^{\gamma }|-|T^{\beta }|)Q_{\beta }.\hfill \end{array}$$

As this set of matrices are linearly independent, any scalar multiple of $Q_{\beta }$ is not able to be generated by the set, and so this product is not contained within the space.

In Case 3, if we denote the set of child vertices of w by $C_w$,

$$\begin{array}{cc}\hfill Q_{\gamma }^2& =(1-|T^{\gamma }|)Q_{\gamma }+\sum _{\delta \in \omega (C_w)}\left[(|,T^{\gamma },|-|,T^{\delta },|),\left(\sum _{ϵ\in \omega (V_w)},Q_{ϵ}\right)\right]\hfill \\ \hfill & =(|T^{\gamma }|-|T^{\alpha }|)Q_{\alpha }+(|T^{\gamma }|-|T^{\beta }|)Q_{\beta }\hfill \\ \hfill & +\text{other matrix terms linearly independent of}{Q}_{\alpha }\text{and}{Q}_{\beta }.\hfill \\ \hfill \end{array}$$

As we know that $|T^{\alpha }|\ne |T^{\beta }|$, we can see that under these circumstances, ${\mathcal{Q}}_{\mathcal{T}}^{\alpha =\beta }$ is not a matrix algebra.

So we see that only cases 4 and 5 remain, and both produce matrix algebras by Lemmas 9 and 10 respectively.

The theorem follows. $\square$

Discussion

In Sect. 2, we introduced a set of matrices associated with trees that had rates associated to each non-leaf vertex. In Sect. 4, we derived results on the multiplication of these matrices, and showed, in the case that each rate is unique, that the matrices form a matrix algebra. In Sect. 5, we extended this result to completely characterise all conditions for which the matrices form a matrix algebra when two rates are identical, and derived sufficient conditions for simple cases of arbitrarily many equal rates.

In previous work, it has been found that building phylogenetic models with a focus on mathematical, rather than biological, properties can produce models which are computationally faster to use and can address biological problems that had not previously been considered (Sumner et al. 2012; Sumner 2017; Shore 2015). Development of phylogenetic models also presents new applications of, and new problems in, linear algebra, graph theory and other areas of mathematics (Steel 2016). Phylosymmetric algebras are an application of both linear algebra and graph theory in phylogenetics which has previously been unexplored. We hope that future research in this area will provide similarly valuable results. In particular, future work could characterise all conditions for which a tree with a given set of associated rates form a matrix algebra. In addition, a characterisation of which matrix algebras are induced by trees would also be interesting and may lead to a better structural understanding of rooted trees.

Another avenue of possible research from this point is development of phylogenetic models. We have shown that phylosymmetric algebras have desirable mathematical properties. Sumner et al. (2012) and Shore (2015) have shown that such mathematical properties are desirable in rate substitution models. To use these algebras for rate substitution models in DNA would not provide much in the way of new ground given the broad literature of DNA rate substitution models (Fernández-Sánchez et al. 2015 for example provides a list of all parameterised DNA models with purine/pyrimidine symmetry which are closed under multiplication). Although, as discussed in Sect. 5, we note that the K2P model is an example of a phylosymmetric algebra.

In amino acid substitution models, however, empirical models are most commonly used (Le and Gascuel 2008 for example) with very few parameterised models having been developed as utilised. The current parameterised amino acid substitution models (Yang et al. 1998; Adachi and Hasegawa 1996) have between 24 and 190 parameters and are not constructed with desirable mathematical properties. To fill this gap, our method of rate matrix construction could be used to build a suite of parameterised amino acid substitution matrices with between 3 and 19 parameters. Having a smaller number of parameters makes computations faster (and hence more computational power can be dedicated to checking the robustness of results) (Mello et al. 2016) and makes the process of interpreting the fitted parameters a much simpler task.

This proposed method of amino acid substitution matrix generation is distinct from all existing amino acid substitution matrices as our proposed approach features a set of parameterised matrices with a low number of parameters. These models have desirable mathematical properties and, given we can build the initial trees with splits that represent characteristics of amino acids such as polarity, the parameters convey biological significance. As well as such models being mathematically tractable, they have also already been shown to have real biological applications and correlate with biological data as shown by Shore et al. (2020).

Funding

Funding Open Access funding enabled and organized by Projekt DEAL.