首页> 外文期刊>Bioinformatics >FAME: fast and memory efficient multiple sequences alignment tool through compatible chain of roots
【24h】

FAME: fast and memory efficient multiple sequences alignment tool through compatible chain of roots

机译:名称:快速和记忆有效的多个序列通过兼容根链对齐工具

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

摘要

Motivation: Multiple sequence alignment (MSA) is important and challenging problem of computational biology. Most of the existing methods can only provide a short length multiple alignments in an acceptable time. Nevertheless, when the researchers confront the genome size in the multiple alignments, the process has required a huge processing space/time. Accordingly, using the method that can align genome size rapidly and precisely has a great effect, especially on the analysis of the very long alignments. Herein, we have proposed an efficient method, called FAME, which vertically divides sequences from the places that they have common areas; then they are arranged in consecutive order. Then these common areas are shifted and placed under each other, and the subsequences between them are aligned using any existing MSA tool.
机译:动机:多序列对齐(MSA)是计算生物学的重要和挑战性问题。 大多数现有方法只能在可接受的时间内提供短长度的多个对齐。 然而,当研究人员在多次对准中面对基因组大小时,该过程需要巨大的处理空间/时间。 因此,使用可以快速地对准基因组大小并精确地具有很大效果的方法,特别是在对非常长的对准的分析。 在此,我们提出了一种称为FAME的有效方法,其垂直地将其与其具有共同区域的地方的序列; 然后它们以连续顺序排列。 然后,这些公共区域彼此移动并放置,并且它们之间的子序列使用任何现有的MSA工具对齐。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号