首页> 外文会议>International Conference on Comparative Genomics >Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees
【24h】

Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees

机译:多垃圾邮件:使用多个间隔字母和四重奏树和四重奏的系统发生重建的最大似然方法

获取原文

摘要

Word-based or 'alignment-free' methods for phylogeny reconstruction are much faster than traditional, alignment-based approaches, but they are generally less accurate. Most alignment-free methods calculate pairwise distances for a set of input sequences, for example from word frequencies, from so-called spaced-word matches or from the average length of common substrings. In this paper, we propose the first word-based phylogeny approach that is based on multiple sequence comparison and Maximum Likelihood. Our algorithm first samples small, gap-free alignments involving four taxa each. For each of these alignments, it then calculates a quartet tree and, finally, the program Quartet MaxCut is used to infer a super tree for the full set of input taxa from the calculated quartet trees. Experimental results show that trees calculated with our approach are of high quality.
机译:基于单词或'对准的'系统的方法,用于系统发生重建的方法比传统的基于对准的方法快得多,但它们通常不太准确。大多数对齐方法计算一组输入序列的成对距离,例如从词频率,来自所谓的间隔匹配或来自公共子串的平均长度。在本文中,我们提出了基于基于单词的文学性系统,其基于多个序列比较和最大可能性。我们的算法首先对涉及四个分类群进行小型,间隙 - 无间距对齐。对于这些对齐中的每一个,它可以计算四重奏树,最后,程序Quartet maxCut用于从计算的四核树中推断为整套输入分类群的超级树。实验结果表明,随着我们的方法计算的树木具有高质量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号