...
首页> 外文期刊>Journal of Bioinformatics and Computational Biology >A SHORT INTRODUCTION TO SOME RECENT PROGRESS IN PHYLOGENETIC NETWORK RECONSTRUCTION, GENOME MAPPING, GENE EXPRESSION ANALYSIS, MOLECULAR DYNAMIC SIMULATION, AND OTHER PROBLEMS IN BIOINFORMATICS
【24h】

A SHORT INTRODUCTION TO SOME RECENT PROGRESS IN PHYLOGENETIC NETWORK RECONSTRUCTION, GENOME MAPPING, GENE EXPRESSION ANALYSIS, MOLECULAR DYNAMIC SIMULATION, AND OTHER PROBLEMS IN BIOINFORMATICS

机译:简要介绍系统发育网络重建,基因组映射,基因表达分析,分子动力学模拟以及生物信息学中的其他问题方面的最新进展

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

摘要

Phylogenetic network is a way to describe evolutionary histories that have undergonenevolutionary events such as recombination, hybridization, or horizontal genentransfer. The level, k, of a network determines how non-treelike the evolution can be,nwith level-0 networks being trees. A number of methods for constructing rootednphylogenetic network from triplets have been proposed in the past.1,2 In this issue,nGambette et al.3 discuss how to generalize these methods to construct unrootednphylogenetic network from quartets. The paper has three main contributions: (1) itngives an Oen5e1 t u0001en; nTTT time algorithm to compute the set of quartets of annetwork; (2) it shows that level-1 quartet consistency is NP-hard; and (3) given a setnQ of quartets, it shows that Oen4T time is su±cient to compute the unrooted level-1nnetwork N such that Q ?QeNT, if it exists.
机译:系统发育网络是描述经历了进化史(例如重组,杂交或水平基因转移)的进化历史的一种方法。网络的级别k决定了非树状演化的程度,而级别0的网络是树。过去,人们已经提出了许多从三联体构建根系进化网络的方法。1,2在本期中,nGambette等人3讨论了如何概括这些方法以从四重奏组构建根系进化网络。该论文有三个主要贡献:(1)对一个Oen5e1 t u0001en进行编程; nTTT时间算法,用于计算网络四方组; (2)表明1级四重奏一致性为NP-hard; (3)给出四重奏的setnQ,表明Oen4T时间足以计算无根的1级网络N,使得Q?QeNT(如果存在)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号