• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Workshop on Algorithms in Bioinformatics(WABI 2004); 20040917-21; Bergen(NO) >Reconstructing Ancestral Gene Orders Using Conserved Intervals
【24h】

Reconstructing Ancestral Gene Orders Using Conserved Intervals

机译：使用保守间隔重建祖先的基因顺序

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reconstruction based on such similarity measures raises many biological, formal and algorithmic questions, in particular the labelling of internal nodes with putative ancestral gene orders, and the selection of a good tree topology. In this paper, we investigate the properties of sets of permutations associated to conserved intervals as a representation of putative ancestral gene orders for a given tree topology. We define set-theoretic operations on sets of conserved intervals, together with the associated algorithms, and we apply these techniques, in a manner similar to the Fitch-Hartigan algorithm for parsimony, to a subset of chloroplast genes of 13 species.
机译：最近引入了保守间隔，以度量基因组之间的相似性，这些基因的基因在进化过程中由于基因组重排而被改组。基于这种相似性度量的系统发育重建提出了许多生物学，形式和算法问题，尤其是内部节点带有推定祖先基因顺序的标记以及良好树形拓扑的选择。在本文中，我们研究了与保守间隔相关的排列集的性质，作为给定树形拓扑的假定祖先基因顺序的表示。我们在保守间隔的集合上定义了集合理论运算以及相关算法，并且我们以类似于Fitch-Hartigan算法的简约方式将这些技术应用于13个物种的叶绿体基因的子集。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号