首页> 外文学位 >Can molecular data really shake the mammalian tree? The quality of evidence from complete mitochondrial DNA sequences.
【24h】

Can molecular data really shake the mammalian tree? The quality of evidence from complete mitochondrial DNA sequences.

机译:分子数据真的能动摇哺乳动物吗?完整线粒体DNA序列的证据质量。

获取原文
获取原文并翻译 | 示例

摘要

In recent years mtDNA sequences have been used to resolve long-standing and sometimes controversial phylogenetic problems. Among the most intractable have been those of the eutherian mammals that evolved with at least two episodes of rapid divergence. These gave rise to modern orders at least 65 million years ago and then 25 million years later to recognizably modern families. The difficulty arises because sequences must contain enough change to reveal closely spaced branching events without accumulating homoplasies that obscure the true branching pattern; thus sequences must be conserved and they also must be relatively long.; In principle, mtDNA sequences are ideal for these kinds of analyses because the genes evolve at different rates but have a single evolutionary history. It has become clear, however, that single genes (2-kb) can generate different trees. To determine the reason for the conflicting trees, I use maximum likelihood methods to estimate topologies and branch lengths from 19 sequences with known subordinal relationships and comprising all 13 mtDNA protein-coding genes. I compare these optimal estimates from single genes (0.2–1.8-kb) and from seven combinations of genes (2–3.5 kb) and use maximum likelihood tests (Chapter 1) and spectral analytic (Chapter 2) methods to show that random error, rather than systematic error explains conflicting gene trees. I show that the proper choice of genes to sequence enables reliable estimation of relationships among mammalian families. Even the entire 11-kb sequence, however, cannot to unambiguously resolve ancient interordinal relationships among these 19 eutherians.; Moreover, I use real (Chapters 3) and simulated sequences (Chapter 4) to demonstrate that a single model cannot adequately describe sequence evolution among these species. Instead, the best strategy is to accommodate significant interdependence among model parameters (base frequency, substitution type, invariant sites and gamma rate heterogeneity) with maximum likelihood estimates (MLE) that are fully-stratified by codon position. Failure to do so results in misleading branch length and topology estimates and provides a false level of confidence that the true tree has been identified.; Finally, I use the same techniques on 56 complete mtDNA sequences (Chapter 5) to confirm that densely sampled, complete sequences (10.6-kb) resolve relationship among modern eutherian families with high confidence. The same sequences, however, are almost certainly too short and uninformative to describe unambiguously ancient evolution among modern mammalian orders.
机译:近年来,mtDNA序列已用于解决长期存在且有时引起争议的系统发育问题。其中最难处理的是那些以至少两次快速发散而进化的欧亚哺乳动物。这些至少在6500万年前就产生了现代订单,然后在2500万年后才形成了公认的现代家庭。出现困难的原因是,序列必须包含足够的变化以揭示间隔很近的分支事件,而又不会积累掩盖真实分支模式的同质体。因此,序列必须守恒,而且必须相对较长。原则上,mtDNA序列是此类分析的理想选择,因为这些基因以不同的速率进化,但是具有单一的进化历史。但是,很明显,单个基因(<2-kb)可以生成不同的树。为了确定树冲突的原因,我使用最大似然方法从具有已知次要关系的19个序列(包括所有13个mtDNA蛋白质编码基因)中估计拓扑和分支长度。我比较了单个基因(0.2–1.8-kb)和基因的七个组合(2–3.5 kb)的最佳估计值,并使用最大似然检验(第1章)和频谱分析(第2章)方法显示了随机误差,而不是系统的错误解释了冲突的基因树。我表明正确选择基因进行测序可以可靠地估计哺乳动物家族之间的关系。但是,即使是整个11kb的序列,也不能明确地解决这19位以太主义者之间的古老的内部关系。而且,我使用真实的(第3章)和模拟的序列(第4章)来证明单个模型不能充分描述这些物种之间的序列进化。相反,最好的策略是通过最大密码子位置完全分层的最大似然估计(MLE)来适应模型参数(基本频率,替换类型,不变位点和伽马速率异质性)之间的显着相互依赖性。否则,将导致误导的分支长度和拓扑估计,并提供错误的可信度,表明已确定了真实的树。最后,我对56个完整的mtDNA序列使用了相同的技术(第5章),以确认密集采样的完整序列(10.6 kb)以高可信度解决了现代欧亚家​​族之间的关系。然而,几乎相同的序列几乎肯定太短且没有信息,无法描述现代哺乳动物种群中的古代进化。

著录项

  • 作者

    Corneli, Patrice Showers.;

  • 作者单位

    The University of Utah.;

  • 授予单位 The University of Utah.;
  • 学科 Biology Molecular.; Biology Genetics.; Biology Biostatistics.
  • 学位 Ph.D.
  • 年度 2003
  • 页码 170 p.
  • 总页数 170
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 分子遗传学;遗传学;生物数学方法;
  • 关键词

  • 入库时间 2022-08-17 11:44:45

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号