facc a novel finite automaton based on cloud computing for the multiple longest common subsequences searchfacc一种新颖的基于云计算的有限自动机的多个最长公共子序列搜索.pdfVIP

  • 2
  • 0
  • 约7.18万字
  • 约 18页
  • 2017-08-28 发布于上海
  • 举报

facc a novel finite automaton based on cloud computing for the multiple longest common subsequences searchfacc一种新颖的基于云计算的有限自动机的多个最长公共子序列搜索.pdf

facc a novel finite automaton based on cloud computing for the multiple longest common subsequences searchfacc一种新颖的基于云计算的有限自动机的多个最长公共子序列搜索

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2012, Article ID 310328, 17 pages doi:10.1155/2012/310328 Research Article FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search Yanni Li,1, 2 Yuping Wang,1 and Liang Bao2 1 School of Computer Science and Technology, Xidian University, Xi’an 710071, China 2 School of Software, Xidian University, Xi’an 710071, China Correspondence should be addressed to Yanni Li, yannili@ Received 14 April 2012; A

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档