{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T12:52:48Z","timestamp":1778676768055,"version":"3.51.4"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p>We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck.<\/jats:p>","DOI":"10.1145\/1644015.1644018","type":"journal-article","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T13:16:40Z","timestamp":1282655800000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts"],"prefix":"10.1145","volume":"6","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense M, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,12,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1177220"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 2nd Data Compression Conference. 279--288","author":"Amir A.","unstructured":"Amir , A. and Benson , G . 1992a. Efficient two-dimensional compressed matching . In Proceedings of the 2nd Data Compression Conference. 279--288 . Amir, A. and Benson, G. 1992a. Efficient two-dimensional compressed matching. In Proceedings of the 2nd Data Compression Conference. 279--288."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 3rd Symposium on Discrete Algorithms. 440--452","author":"Amir A.","unstructured":"Amir , A. and Benson , G . 1992b. Two-Dimensional periodicity and its applications . In Proceedings of the 3rd Symposium on Discrete Algorithms. 440--452 . Amir, A. and Benson, G. 1992b. Two-Dimensional periodicity and its applications. In Proceedings of the 3rd Symposium on Discrete Algorithms. 440--452."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0023"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_56"},{"key":"e_1_2_1_6_1","unstructured":"Bille P. and Farach-Colton M. 2005. Fast and compact regular expression matching. Submitted for publication. Preprint arxiv.org\/cs\/0509069.  Bille P. and Farach-Colton M. 2005. Fast and compact regular expression matching. Submitted for publication. Preprint arxiv.org\/cs\/0509069."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700370527"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402007"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009202"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00032-7"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 8th Data Compression Conference. 103--112","author":"Kida T.","unstructured":"Kida , T. , Takeda , M. , Shinohara , A. , Miyazaki , M. , and Arikawa , S . 1998. Multiple pattern matching in LZW compressed text . In Proceedings of the 8th Data Compression Conference. 103--112 . Kida, T., Takeda, M., Shinohara, A., Miyazaki, M., and Arikawa, S. 1998. Multiple pattern matching in LZW compressed text. In Proceedings of the 8th Data Compression Conference. 103--112."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90010-2"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-1005-2"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 7th International Symposium on String Processing and Information Retrieval. 221--228","author":"Matsumoto T.","unstructured":"Matsumoto , T. , Kida , T. , Takeda , M. , Shinohara , A. , and Arikawa , S . 2000. Bit-Parallel approach to approximate string matching in compressed texts . In Proceedings of the 7th International Symposium on String Processing and Information Retrieval. 221--228 . Matsumoto, T., Kida, T., Takeda, M., Shinohara, A., and Arikawa, S. 2000. Bit-Parallel approach to approximate string matching in compressed texts. In Proceedings of the 7th International Symposium on String Processing and Information Retrieval. 221--228."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/128749.128755"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00036-4"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 11th Data Compression Conference. 459","author":"Navarro G.","unstructured":"Navarro , G. , Kida , T. , Takeda , M. , Shinohara , A. , and Arikawa , S . 2001. Faster approximate string matching over compressed text . In Proceedings of the 11th Data Compression Conference. 459 . Navarro, G., Kida, T., Takeda, M., Shinohara, A., and Arikawa, S. 2001. Faster approximate string matching over compressed text. In Proceedings of the 11th Data Compression Conference. 459."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Navarro G. and Raffinot M. 1998. A general practical approach to pattern matching over Ziv-Lempel compressed text. Tech. rep. TR\/DCC-98-12 Department of Computer Science University of Chile.  Navarro G. and Raffinot M. 1998. A general practical approach to pattern matching over Ziv-Lempel compressed text. Tech. rep. TR\/DCC-98-12 Department of Computer Science University of Chile.","DOI":"10.1007\/3-540-48452-3_2"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1644015.1644018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1644015.1644018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:44Z","timestamp":1750278404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1644015.1644018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1145\/1644015.1644018"],"URL":"https:\/\/doi.org\/10.1145\/1644015.1644018","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]},"assertion":[{"value":"2007-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-12-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}