期刊文献+

FM-index算法性能测试及并行化 被引量:1

Performance Testing of FM-index Algorithm and Parallelization
下载PDF
导出
摘要 介绍了FM-index压缩查询技术,详细阐述了FM-index的工作流程,描述了实现计算字符串在压缩文本中出现次数的算法。对FM-index的源代码在Linux平台上进行了测试,从测试结果分析了使用FM-index进行压缩查询的优点和不足。最后给出了加快FM-index压缩速度的一个并行化算法的初步设计思路。 FM-index is a new technology for searching compressed text. This paper introduceds the working procedure of FM-index and analyzes the algorithm of counting string occurrence in compressed text. The source code of FM-index is tested on two kinds of Linux platforms. Based on the experimental results, it summarizes the advantages of adopting FM-index to search compressed text. Finally, it puts forward one elementary parallel method to accelerate FM-index compress speed.
出处 《计算机工程》 EI CAS CSCD 北大核心 2005年第22期51-53,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60303020) 国家"973"计划资助项目(G1999032805) 国家"863"计划基金资助项目(2004AA104020) 中科院软件所培育基金资助项目(CXK25628)
关键词 FM—index 压缩查询 BW转换 后缀数组 FM-index Compressed text search BW transform Suffix array
  • 相关文献

参考文献6

  • 1Manzini G An Analysis of the Burrows-wheeler Transform. In:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. http://www.imc.pi.cnr.it/~manzini/tr-99-13/,1999.
  • 2Ferragina P, Manzini G. Opportunistic Data Structures with Applications. In: Proceedings of the 41^st IEEE Symposium on Foundations of Computer Science, 2000.
  • 3Manber U, Myers G. Suffix Arrays: a New Method for On-line String Searches. SIAM Journal on Computing, 1993,22(5):935-948.
  • 4Bentley J, Sleator D, Tarjan R, et al. A Locally Adaptive Compression Scheme. Communication of the ACM, 1986,29(4):320-330.
  • 5Farach M, Thorup M. String Matching in Lempel-ziv Compressed Strings. Algorithmica, 1998,20(4):388-404.
  • 6Manzini G. An Analysis of the Burrows-Wheeler Transform. In:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, http://www.imc.pi.cnr.it/-manzini/tr-99-13/,1999.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部