Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching

Published:2013 Issue: Volume: Page:78-88
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Gawrychowski Paweł,Straszak Damian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-45030-3_8

Reference13 articles.

1. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. J. Comput. Syst. Sci. 52(2), 299–307 (1996)

2. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257–275 (2004)

3. Bille, P., Fagerberg, R., Gørtz, I.L.: Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Transactions on Algorithms 6(1) (2009)

4. Cole, R., Hariharan, R.: Approximate string matching: A simpler faster algorithm. SIAM J. Comput. 31(6), 1761–1782 (2002)

5. Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific (2002)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Communication Complexity of Approximate Pattern Matching;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Circular pattern matching with k mismatches;Journal of Computer and System Sciences;2021-02

3. Faster Approximate Pattern Matching: A Unified Approach;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

4. Circular Pattern Matching with k Mismatches;Fundamentals of Computation Theory;2019

5. Approximate pattern matching in LZ77-compressed texts;Journal of Discrete Algorithms;2015-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3