z-logo
open-access-imgOpen Access
Patterns of Nucleotide Substitution in Mitochondrial Protein Coding Genes of Vertebrates
Author(s) -
Sudhir Kumar
Publication year - 1996
Publication title -
genetics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.792
H-Index - 246
eISSN - 1943-2631
pISSN - 0016-6731
DOI - 10.1093/genetics/143.1.537
Subject(s) - transversion , biology , substitution (logic) , genetics , gene , nucleotide , evolutionary biology , mutation , computer science , programming language
Maximum likelihood methods were used to study the differences in substitution rates among the four nucleotides and among different nucleotide sites in mitochondrial protein-coding genes of vertebrates. In the 1st + 2nd codon position data, the frequency of nucleotide G is negatively correlated with evolutionary rates of genes, substitution rates vary substantially among sites, and the transition/transversion rate bias (R) is two to five times larger than that expected at random. Generally, largest transition biases and greatest differences in substitution rates among sites are found in the highly conserved genes. The 3rd positions in placental mammal genes exhibit strong nucleotide composition biases and the transitional rates exceed transversional rates by one to two orders of magnitude. Tamura-Nei and Hasegawa-Kishino-Yano models with gamma distributed variable rates among sites (gamma parameter, alpha) adequately describe the nucleotide substitution process in 1st+2nd position data. In these data, ignoring differences in substitution rates among sites leads to largest biases while estimating substitution rates. Kimura's two-parameter model with variable-rates among sites performs satisfactorily in likelihood estimation of R, alpha, and overall amount of evolution for 1st+2nd position data. It can also be used to estimate pairwise distances with appropriate values of alpha for a majority of genes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here