Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto. Improving Time and Space Complexity for Compressed Pattern Matching. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 484-493, Springer, 2006. [doi]
@inproceedings{MaruyamaMS06,
title = {Improving Time and Space Complexity for Compressed Pattern Matching},
author = {Shirou Maruyama and Hiromitsu Miyagawa and Hiroshi Sakamoto},
year = {2006},
doi = {10.1007/11940128_49},
url = {http://dx.doi.org/10.1007/11940128_49},
tags = {pattern matching},
researchr = {https://researchr.org/publication/MaruyamaMS06},
cites = {0},
citedby = {0},
pages = {484-493},
booktitle = {Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings},
editor = {Tetsuo Asano},
volume = {4288},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-49694-7},
}