Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition-Reference-Cited by-同舟云学术

Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition

Published:2011 Issue: Volume: Page:401-414
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Tiskin Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20712-9_32

Reference22 articles.

1. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences 52(2), 299–307 (1996)

2. Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoretical Computer Science 409(3), 486–496 (2008)

3. Lecture Notes in Computer Science;P. Cégielski,2006

4. Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A subquadratic sequence alignment algorithm for unrestricted score matrices. SIAM Journal on Computing 32(6), 1654–1673 (2003)

5. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: Unified compression-based acceleration of edit-distance computation. Technical Report 1004.1194, arXiv

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

1. Communication vs Synchronisation in Parallel String Comparison;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

2. Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10

3. Compressed Subsequence Matching and Packed Tree Coloring;Algorithmica;2015-09-30

4. Compressed Subsequence Matching and Packed Tree Coloring;Combinatorial Pattern Matching;2014

5. Fast Distance Multiplication of Unit-Monge Matrices;Algorithmica;2013-09-19