首页> 外文会议>Federated Conference on Computer Science and Information Systems >Efficient Computation of RNA Partition Functions Using McCaskill’s Algorithm
【24h】

Efficient Computation of RNA Partition Functions Using McCaskill’s Algorithm

机译:使用麦卡斯基尔算法对RNA分区函数进行高效计算

获取原文

摘要

We develop efficient single- and multi-core algorithms to compute partition functions for RNA sequences. Our algorithms, which are based on McCaskill’s algorithm, are benchmarked against state-of-the-art fast algorithms obtained using the parallelizing source-to-source compilers PLUTO and TRACO. On our Intel I9 computational platform, our best single core algorithm takes up to 81.2% less time than the single core algorithm resulting from PLUTO, which is faster than that obtained from TRACO. Our best multi-core algorithm takes up to 84.7% less time than the multi-core algorithm obtained using TRACO when run with 20 threads (our I9 has 10 cores and supports hyperthreading); the TRACO multi-core algorithm is faster than the PLUTO one.
机译:我们开发了有效的单核和多核算法来计算RNA序列的分区功能。我们基于McCaskill算法的算法,以使用并行化的源到源编译器PLUTO和TRACO获得的最新快速算法为基准。在我们的Intel I9计算平台上,我们最好的单核算法所花费的时间比PLUTO所产生的单核算法要少81.2%,这比TRACO所获得的时间要快。当使用20个线程(我们的I9具有10个内核并支持超线程)运行时,我们最好的多核算法所花的时间比使用TRACO获得的多核算法要少84.7%的时间; TRACO多核算法比PLUTO算法更快。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号