Compressed and fully compressed pattern matching in one and two dimensions

Proceedings of the IEEE

Volumn 88, Issue 11, 2000, Pages 1769-1778

  Rytter, Wojciech ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038638640     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.892712     Document Type: Article

References (74)

1. A. V. Aho, I. F., Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, VIA: Addison-Wesley. 1974.
2. A. Amir, G. Benson, and M. Farach, "Let sleeping files lie: Patiemmatching in Z-compressed files," J. Commit. Syst. Sci., vol. 52, no. 2. pp. 299-307. 1996.
3. A. Amir and G. Benson, "F.fftcient two dimensional compressed matching," in Proc. 2nd IEEE Data Compression Con)'., 1992, pp. 279-288.
4. A. Amir, G. Benson. and M. Farach, "Optimal two-dimensional compressed matching," J. Algorithms, vol. 24, pp. 354-379, Aug. 1997.
5. A. Amir, G. M. Landau, and D. Sokoi. "Inplaee run-length 2d compressed search," SODA, 2000.
6. D. Angjuin, "Finding patterns common to a set of strings," J. Compul. Syst. Sci., vol. 21, no. 1, pp. 46-62, 1980.
7. S. De Agosiino, "P-compiete problems in data compression," Theur. Comput. Sei., vol. 127. no. 1, pp. 181-1S6, 1994.
8. _, "Pattern-matclung in text compressed with the ID heuristic," in Data Compression Conf. 1998, J. Storer and M. Conn, Eds. Los Alatmtos. CA: IEEE Comput. Soc. Press, pp. 113-118.
9. [91 M. F. Barnsley and L. P. Hurd. Fractal image Compression: A. K. Peters Ltd., 1993.
10. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. W. Rytter, "On the complexity of pattern matching for highly coinpressed two-dimensional texts," in P roc. 8th Anr.it. Symp. Combinatorial Faltern Matching, A. Apostolico and J. Heir, Eds., 1997, pp. 40-51.
11. M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, "Text compression using antidictionanes," ICALP, 1999.
12. M. Crochemore and W. Rytter, Tc,\t Algorithms. New York: Oxford Univ. Press. 1994.
13. _, "Efficient parallel algorithms to tost squarc-frecness and factorize strings." Inform. Process. Lett., vol. 38, no. 2, pp. 57-60, 1991.
14. K. Culik and J. Karhumaki, "Finite automata computing real functions," SIAMJ. Comput., vol. 23, no. 4, pp. 789-814, 1994.
15. [151 K. Culik and J. Kari, "Image compression using weighted finite automata," Comput. Graph., vol. 17, no. 3, pp. 305-313, 1993.
16. _, Fractal Image Compression: Theory and Applications, Y. Fisher. Ed, New York: Springer-Verlag, 1995. pp. 243-258.
17. D. Derencourt, J. Karhumäki, M. Letteux, and A. Terlutte, "On continuous functions computed by real functions," RAIRO Theor. Inform. Appl., vol. 28. pp. 387-404, 1994.
18. V. Diekert and M. Robson, "On quadratic word equations," STACS, pp. 217-226, 1999.
19. V. Diekert, "Makanin's algorithm." in Algebraic Combinatorics on Words. J. Berstel and D. Perrin, Eds. Cambridge, U.K.: Cambridge Univ. Press.
20. S. Eilenberg, Automata, Languages and Machines. New York: Academic, 1974, vol. A.
21. M. Farach and M. Thorup, "String matching in Lempel-Ziv compressed strings," in P roc. 27th Arinu. S\mp. Theorv of Computing, 1995, pp. 703-712.
22. M. Farach and S. Muthukrishnan, "Optimal parallel dictionary matching and compression." SPA4, 1995.
23. J. Karhumaki, W. Plandowski, and W. Rytter, "Pattern matching for images generated by finite automata." Nordic J. Comp., vol. 7. no. 1, 2000.
24. M. Gu, M. Farach, and R. Beigel, An Efficient Algorithm for Dynamic Text Indexing: SODA, 1994.
25. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of KP-Completeness. New York: Freeman, 1979.
26. L. Gasiemec, M. Karpinski, W. Plandowski. and W. Rytter, "Efficient algorithms for Lempel-Ziv encoding,'" in Proc. 5th Scandinavian Workshop on Algorithm Theory. New York: Springer-Verlag, 1996.
27. L. Gasiemec, M. Karpmksi, \V. Plandowski, and W. Rytter, "Randomized algorithms for compressed texts: the finger-print approach." in Combinatorial Pattern Matching 1996. New York: Springer-Verlag, 1996.
28. L. Gasieniec and W. Rytier, "Almost optimal fully compressed LZW-rnatching." in Data Compression Cnnf.. Los Alamitos, CA: IEEE Comput. Soc. Press, 1999.
29. L. Gasieniec. A. Gibbons, and W. Rytter, "The parallel complexity of pattern-searching in highly compressed texts," in MFCS, 1999.
30. A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge, U.K.: Cambridge Univ. Press. 1988.
31. D. Gussfield, Algorithms on Strings and Arrays. Cambridge, U.K.: Cambridge Univ. Press, 1997.
32. VI. Hirao, A. S. Hinohara, M. Takcda, and S. Arikawa, "Faster fully compressed pattern-matching for a subclass of straight line programs,", to be published.
33. O. H. Ibarra and S. Moran, "Probabilistic algorithms for deciding equivalence of straight-line programs," J. ACM, vol. 30, pp. 217-228, 1983.
34. L. Ilie and W. Piandowski, "Two variable word equations," in STACS'2000.
35. J. Karhumaki, W. Piandowski, and W. Rytter, "The compression of subsegments of compressed images," Combinatorial Pattern Matching. 1999.
36. I. Karhumaki, F. Mignosi, and W. Plandowski, "The expressibilily of languages and relations by word equations," in 1CALP'97, 1997, Lecture Notes in Computer Science 1256, pp. 98-109.
37. [371 M. Karpmski, W. Piandowski, and W. Rytter, "Reducing the depth of straight-line program representation of Ion? texts,", manuscript, 2000.
38. R. .VI. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Compulations, R. E. Miller and J. W. Thatcher, Eds. New York: Plemum, 1972.
39. T. Kida, M. Takeda, A. Shinohara, and S. Arikawa, "Sh:ft-and approach to pattern-matching in LZW compressed text," in Combinatorial Pmiern-Maiching I9l)9, Lecture Notes in Computer Science 1645, pp. 1-13.
40. T. Kida, M. Takeda, A. Shinohara, Vf. Miyazaki, and S. Arikawa, "Multiple pattern-matching in LZW compressed text," in Data Compression Conf. 1998, J. Atorer and M. Cohn, Eds. Los Alamitos, ÇA: IEEE Comput. Soc. Press, pp. 103-112.
41. T. Kida, Y. Shibara, M. Takeda, A. Shinohara, and S. Arikawa, "A unifying framework for compressed pattern matching," in SP/RE'99.
42. M. Karpinski, W. Rytter, and A. Shinohara, "Pattern-matching for strings with short description," Morale J. Compur., vol. 4, no. 2, pp. 172-186, 1997.
43. J. Kaii and P. Fraud, "Arithmetic coding of weighted finite automata," RA1RO Theor. Inform. Appl., vol. 28, no. 3-4, pp. 343-360, 1994.
44. J. Karkainen, G. Navarro, and E. Ukkonen, "Approximate stringmatching over Ziv-Lempel compressed text,", to oe published.
45. R. M. Karp and M. Rabin, "Efficient randomized pattern matching algorithms," IBM J. Res. Dcv., vol. 31, no. 2, pp. 249-260, 1987.
46. D. Knuth, The Art of Computing, Vol. II: Seminumcrical Algorithms, 2nded. Reading, MA: Adclison-Wesley, 1981.
47. A. Koscielski and L. Pacholski, "Complexity of Makanin's algorithm," J. ACM, vol. 43, no. 4, pp. 670-684, 1996.
48. J. K. Lanctoi, M. Li, and E. Yang, "Estimating DNA sequence entropy," SODA, 2000.
49. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. 22, no. 1. pp. 75-81. 1976.
50. A. Lempel and J. Ziv, "Compression of two-dimensional images sequences," in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds. New York: Springer-Verlag, 1985, pp. 141-156.
51. M. Lothaire, Combinatorics on Words. New York: Addison-Wesley, 1993.
52. G. S. Makanin, "The problem of solvability of equations in a free semigroup" (in Math. U.S.S.R. Sb., English transi., Vol. 32, 1977.), Mat. Sb., vol. 103, no. 145, pp. 147-233, 1977.
53. U. Vlanber, "A text compression scheme that allows fast searching directly in the compressed file," ACM Trans. Inform. KvsL, vol. 15, no. 2, pp. 124-136. 1997.
54. M. Miyazaki, A. Shinohara, and VI. Takeda, "An improved patternmatching algorithm for strings in terms of straight-line programs," in Combinatorial Pattern-Matching 1997. Lecture Notes in Computer Science 1264, pp. 1-11.
55. [551 R- Motwani and P. Ragnavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
56. E. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Y'ates, "Direct pattern-matching on compressed text," in SPIKE. Los Alamitos, CA: IEEE Comput. Sei. Press, 1998, pp. 90-95.
57. _, "Fast sequential searching on compressed texts allowing errors," in 21st Annu. Int. ACM SIGIK Conf. Research and Development in Information Retrieval: York Press, 1998, pp. 298-306.
58. G. Navarro und VI. Raffinot. "A general practical approach to pattern-matching over Zil-J .ornpei compressed text." in Combinatorial Pattern-Matching 1999. Lecture Notes in Computer Science 1645, pp. 14-36.
59. G. Navarre and J. Tarhio. "Buyer Morre string-matching over Ziv-Lempel compressed text,", to be published.
60. E. Obono. S. Gorlacik, and M. Maksimenko. "Efficient solving of word equations with one variable," in MFCS'94, 1994, Lecture Notes in Computer Science 841, pp. 336-341.
61. C. H. Papadimitriou, Computational Complexity. Reading, MA: Addison-Wesley, 1994.
62. H. O. Peitgen and P. H. Richter, The Beauty of Plants. New York: Springer-Yer.ag. 1986.
63. W. Plandowski, "Testing equiva.ence of morphisms on context-free languages," in Proc. 2nd Amu. Eur. Symp. Algorithms (ESA '94). New York: Springer-Verlag. 1994. pp. 460-470.
64. _, "Solvability of word equations with constants is in NEXP-TIME., in STOC 1999.
65. _,"Sulvahilitv of word equations with constants is in P-SPACE," in FOCS, 1999.
66. W. Plandowski and W. Rytrer. "Complexity of compressed recognition of formal languages," in Jewels Forever. J. Karhumaki, Ed. New York: Springer-Verlag, 1999.
67. W. Plandowski and W. Rytter, "Applying Lempcl-Ziv encodings to the solution of word equations," in SCALP. 1998.
68. J. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities," J. ACM, vol. 27, no. 4, pp. 701-717, 1980.
69. n (a ),'' in 10th Symp. Discrete Algorithms, 1999.
70. Y. Shihafa, M. Takeda. A. Shinohara. and S. Arikawa, "Pattern-matching in text compressed by using antidictionaries," in Combinatorial Pattern-Matching 1999. Lecture Notes in Computer Science 1645, p. 37.
71. Y. Shibata, T Maisumoto, M. Takeda, A. Shinohara, and S. Arikawa, "A Boyer-Moore type algorithm for compressed pattern-matching,", to be published.
72. J. Storer, Data Compression: Methods und Theory. Rockville, MD: Computer Science, 1988.
73. R. E. Zippel, "Probabilistic algorithms for sparse polynomials," in Proc. Int. Svmp. Symbolic ana Algebraic Manipulation IEUROSAM 79) LNCS72. New York: Springer-Verlag, 1979, pp. 216-226.
74. J. Ziv and A. Lempei, "A universal algorithm for sequential data compression," IEEE Trans. Inform. The.or\. vol. IT-23, pp. 337-343, May 1977.