Exploring the consequences of lack of closure in codon models
Models of codon evolution are commonly used to identify positive selection. Positive selection is typically a heterogeneous process, i.e., it acts on some branches of the evolutionary tree and not others. Previous work on DNA models showed that when evolution occurs under a heterogeneous process it is important to consider the property of model closure, because non-closed models can give biased estimates of evolutionary processes. The existing codon models that account for the genetic code are not closed; to establish this it is enough to show that they are not linear (meaning that the sum of two codon rate matrices in the model is not a matrix in the model). This raises the concern that a single codon model fit to a heterogeneous process might mis-estimate both the effect of selection and branch lengths. Codon models are typically constructed by choosing an underlying DNA model (e.g., HKY) that acts identically and independently at each codon position, and then applying the genetic code via the parameter $\omega$ to modify the rate of transitions between codons that code for different amino acids. Here we use simulation to investigate the accuracy of estimation of both the selection parameter $\omega$ and branch lengths in cases where the underlying DNA process is heterogeneous but $\omega$ is constant. We find that both $\omega$ and branch lengths can be mis-estimated in these scenarios. Errors in $\omega$ were usually less than 2% but could be as high as 17%. We also assessed if choosing different underlying DNA models had any affect on accuracy, in particular we assessed if using closed DNA models gave any advantage. However, a DNA model being closed does not imply that the codon model constructed from it is closed, and in general we found that using closed DNA models did not decrease errors in the estimation of $\omega$.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
CodonMPNN for Organism Specific and Codon Optimal Inverse Folding
Generating protein sequences conditioned on protein structures is an impactful technique for protein engineering. When synthesizing engineered proteins, they are commonly translated into DNA and expressed in an organism …
mRNA Codon Optimization on Quantum Comptuers
Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard combinatorial optimization problem. Each amino acid in the protein sequence can be represented by as many as six codons, and the pr…
Combinatorial OptimizationTranslationHierarchy of codon usage frequencies from codon-anticodon interaction in the crystal basis model
Analyzing the codon usage frequencies of a specimen of 20 plants, for which the codon-anticodon pattern is known, we have remarked that the hierarchy of the usage frequencies present an almost "universal" behavior. Searc…
Smooth $\%$MinMax: A Differentiable Relaxation for Codon Harmonization
Codon harmonization aims to adapt the coding sequences for heterologous expression while preserving the native-like patterns of frequent and rare codons that may influence local translation dynamics and co-translational …
Co-evolution between Codon Usage and Protein-Protein Interaction in Bacteria
We study the correlation between the codon usage bias of genetic sequences and the network features of protein-protein interaction (PPI) in bacterial species. We use PCA techniques in the space of codon bias indices to s…