首页> 外文会议> >A heuristic algorithm for blocked multiple sequence alignment
【24h】

A heuristic algorithm for blocked multiple sequence alignment

机译:阻止多序列比对的启发式算法

获取原文

摘要

Blocked multiple-sequence alignment (BMA) refers to the construction of multiple alignments in DNA by first aligning conserved regions into what we call "blocks" and then aligning the regions between successive blocks to form a final alignment. Instead of starting from low-order pairwise alignments, we propose a new way to form blocks by searching for closely related regions in all input sequences, allowing internal spaces in blocks as well as some degree of mismatch. We address the problem of semi-conserved patterns (patterns that do not appear in all input sequences) by introducing into the process two similarity thresholds that are adjusted dynamically according to the input. A method to control the number of blocks is also presented to deal with the situation when input sequences have so many similar regions that it becomes impractical to form blocks by trying every combination. BMA is an implementation of this approach, and our experimental results indicate that this approach is efficient, particularly on large numbers of long sequences with well-conserved regions.
机译:封闭的多序列比对(BMA)是指通过首先将保守区域比对成我们所谓的“嵌段”,然后将连续的嵌段之间的区域比对以形成最终的比对,来构建DNA中的多重比对。代替从低阶成对对齐开始,我们提出了一种通过在所有输入序列中搜索紧密相关的区域来形成块的新方法,从而允许块中的内部空间以及一定程度的不匹配。通过将两个根据输入动态调整的相似性阈值引入到处理中,我们解决了半保守模式(并非在所有输入序列中都出现的模式)的问题。还提出了一种控制块数的方法来处理输入序列具有如此多的相似区域以致于无法尝试每种组合来形成块的情况。 BMA是此方法的一种实现,我们的实验结果表明,该方法是有效的,特别是在具有良好保守区域的大量长序列上。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号