首页> 外文期刊>Bioinformatics >Combining partial order alignment and progressive multiple sequence alignment increases alignment speed and scalability to very large alignment problems
【24h】

Combining partial order alignment and progressive multiple sequence alignment increases alignment speed and scalability to very large alignment problems

机译:将部分顺序比对和渐进多序列比对相结合可提高比对速度和可扩展性,以解决非常大的比对问题

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

摘要

Motivation: Partial order alignment (POA) has been proposed as a new approach to multiple sequence alignment (MSA), which can be combined with existing methods such as progressive alignment. This is important for addressing problems both in the original version of POA (such as order sensitivity) and in standard progressive alignment programs (such as information loss in complex alignments, especially surrounding gap regions). Results: We have developed a new Partial Order–Partial Order alignment algorithm that optimally aligns a pair of MSAs and which therefore can be applied directly to progressive alignment methods such as CLUSTAL. Using this algorithm, we show the combined Progressive POA alignment method yields results comparable with the best available MSA programs (CLUSTALW, DIALIGN2, T-COFFEE) but is far faster. For example, depending on the level of sequence similarity, aligning 1000 sequences, each 500 amino acids long, took 15 min (at 90% average identity) to 44 min (at 30% identity) on a standard PC. For large alignments, Progressive POA was 10–30 times faster than the fastest of the three previous methods (CLUSTALW). These data suggest that POA-based methods can scale to much larger alignment problems than possible for previous methods.
机译:动机:已经提出了部分顺序比对(POA)作为多序列比对(MSA)的新方法,可以将其与诸如逐步比对的现有方法结合使用。这对于解决原始版本的POA(例如顺序灵敏度)和标准渐进式比对程序(例如复杂比对(尤其是周围的缺口区域)中的信息丢失)中的问题都很重要。结果:我们开发了一种新的“部分订单-部分订单”对齐算法,该算法可以最佳地对齐一对MSA,因此可以直接应用于渐进式对齐方法(例如CLUSTAL)。使用此算法,我们证明了组合的渐进式POA对齐方法产生的结果可与最佳的可用MSA程序(CLUSTALW,DIALIGN2,T-COFFEE)相提并论,但速度要快得多。例如,根据序列相似性的水平,在标准PC上比对1000个序列(每个序列500个氨基酸)需要15分钟(平均同一性为90%)到44分钟(相同性为30%)。对于较大的比对,渐进式POA比之前三种最快的方法(CLUSTALW)快10–30倍。这些数据表明,与以前的方法相比,基于POA的方法可以解决更大的比对问题。

著录项

  • 来源
    《Bioinformatics》 |2004年第10期|p. 1546-1556|共11页
  • 作者单位

    Department of Chemistry and Biochemistry, Molecular Biology Institute, Center for Genomics and Proteomics, University of California, Los Angeles, CA 90095-1570, USA;

    Department of Chemistry and Biochemistry, Molecular Biology Institute, Center for Genomics and Proteomics, University of California, Los Angeles, CA 90095-1570, USA;

  • 收录信息 美国《科学引文索引》(SCI);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 生物科学;
  • 关键词

  • 入库时间 2022-08-17 23:50:21

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号