首页> 外文会议>IEEE International Conference on Computational Advances in Bio and Medical Sciences >Global maximum-parsimony based ancestral reconstruction with non-universal genes
【24h】

Global maximum-parsimony based ancestral reconstruction with non-universal genes

机译:基于全局最大简约性的具有非通用基因的祖先重建

获取原文

摘要

Ancestral reconstruction can be useful in many facets of genetic analysis. It allows for a look into the (potential) past, and can provide a clearer idea of species divergance. Unfortunately, ancestral construction is not as easy with swiftly changing genomes as input. Confounding factors such as horizontal gene transfer and gene loss limit available information under current heuristics that mitigate the computational difficulty of finding an exact solution. Here, we address a specific limitation of these heursitics, namely the restriction that genes be present in all leaf genomes. We show that we can greatly improve the number of genes placed in an ancestral genome by accepting genes not universal to the whole data set but universal to a given subtree. We implement this approach by modifying the popular ancestral reconstruction program PATHGROUPS and test it on fruit fly and mosquito data with multiple available genomes.
机译:祖先重建在遗传分析的许多方面都可能有用。它允许您查看(潜在的)过去,并可以提供更清晰的物种多样性概念。不幸的是,利用快速变化的基因组作为输入,祖先的构建并不容易。诸如水平基因转移和基因丢失之类的混杂因素限制了当前启发式方法下的可用信息,这些信息减轻了寻找精确解的计算难度。在这里,我们解决了这些试探法的特定限制,即所有叶基因组中都存在基因的限制。我们表明,通过接受并非对整个数据集通用但对于给定子树通用的基因,我们可以大大提高放置在祖先基因组中的基因数量。我们通过修改流行的祖先重建程序PATHGROUPS来实现此方法,并在果蝇和蚊子数据上使用多个可用基因组对其进行测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号