首页> 外文会议>International Conference on Information Science and Security >An Algorithm to Cluster Orthologous Proteins across Multiple Genomes
【24h】

An Algorithm to Cluster Orthologous Proteins across Multiple Genomes

机译:多种基因组簇簇蛋白的算法

获取原文

摘要

In GOLD (Genomes OnLine Database), the re It has been a successful technique, for researches on genome evolution and for functional annotation of newly sequenced genomes, to construct an OPCs(Orthologous Protein Clusters) with the best reciprocal BLAST hits from multiple complete-genomes. It, however, needs time-labor processes to make the OPCs by hand and biological analysis. In order to reduce the load, we propose an automatic parallel computing method that clusters OPs(Orthologous Proteins) from multiple complete-genomes. For systematic representation of clustering OPs, a mathematical frame of a vector is suggested. The algorithm starts, on the hypercube model, with parallelism of clustering pairwise genomes(CPG) and parallelizes all the processes of clustering multiple genomes(CMG). In CPG, all pairwise- comparisons are divided into sub-pairwise- comparisons, and the local results of clustering OPs between two genomes are integrated and broadcast to each processor. In CMG, all the clustering-processes are split into sub- clustering-processes, and the local results of OPCs among multiple genomes are broadcast to each processor and integrated in it.
机译:在黄金(基因组在线数据库)中,重新实现了一种成功的技术,用于对新序列的基因组的基因组进化和功能注释的研究,构建具有来自多个完整的最佳互核爆炸的OPCs(直蛋白蛋白质簇) - 基因组。然而,它需要时间劳动过程通过手工制作OPC和生物学分析。为了减少负载,我们提出了一种自动并行计算方法,其从多个完全基因组中簇(正交蛋白)。为了进行群集OPS的系统表示,建议了矢量的数学帧。该算法在HyperCube模型上开始,具有聚类成对基因组(CPG)的并行性,并并行化群集多个基因组(CMG)的所有过程。在CPG中,所有成对比较被分成子对比较,并且在两个基因组之间的聚类OPS的局部结果集成并广播到每个处理器。在CMG中,所有聚类过程都被分成子群集过程,并且多个基因组之间的opcs的本地结果被广播到每个处理器并集成在其中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号