Computing all longest common subsequences on MPI cluster

Jinxian Lin, Yiqing Lv
{"title":"Computing all longest common subsequences on MPI cluster","authors":"Jinxian Lin, Yiqing Lv","doi":"10.1109/CINC.2010.5643814","DOIUrl":null,"url":null,"abstract":"Finding out the longest common subsequences (LCS) is one of the most important problems of Bioengineering. But there is still not excellent algorithm for computing all of the longest common subsequences (ALCS). An existing fast algorithm for LCS was studied and improved in this paper. We combined the algorithm with MPI cluster and computed all the longest common subsequences of two random generate gene sequences on MPI cluster. The experiment results show that computing ALCS on MPI cluster is an efficient and practicality method.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2010.5643814","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Finding out the longest common subsequences (LCS) is one of the most important problems of Bioengineering. But there is still not excellent algorithm for computing all of the longest common subsequences (ALCS). An existing fast algorithm for LCS was studied and improved in this paper. We combined the algorithm with MPI cluster and computed all the longest common subsequences of two random generate gene sequences on MPI cluster. The experiment results show that computing ALCS on MPI cluster is an efficient and practicality method.
计算MPI集群上所有最长公共子序列
最长公共子序列的求解是生物工程中最重要的问题之一。但是目前还没有一个很好的算法来计算所有的最长公共子序列。本文对现有的一种快速LCS算法进行了研究和改进。将该算法与MPI聚类相结合,计算了两个随机生成的基因序列在MPI聚类上的所有最长公共子序列。实验结果表明,在MPI聚类上计算ALCS是一种高效实用的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信