Efficiency of fast parallel pattern searching in highly compressed texts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1672, Issue , 1999, Pages 48-58

  Gąsieniec, Leszek ^a   Gibbons, Alan ^a   Rytter, Wojciech ^a,b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; EFFICIENCY; ENCODING (SYMBOLS); FORESTRY;

COMPRESSED MATCHING; DIRECTED ACYCLIC GRAPH (DAG); FIBONACCI WORD; P-COMPLETE; PARALLEL PATTERNS; POLYLOGARITHMIC TIME; TREE CONTRACTION; TWO-DIMENSIONAL TEXTS;

TREES (MATHEMATICS);

EID: 84949211315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_5     Document Type: Conference Paper

References (22)

1. A. Amir, G. Benson, and M. Farach, Let sleeping files lie: Pattern matching in Z-compressed files, Proc. of 5th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994.
2. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3 (1988) 347- 365
3. P. Berman, M. Karpiński, L. Larmore, W. Plandowski, and W. Rytter, The complexity of pattern matching of highly compressed two-dimensional texts, Proc. of 8th Annual Symposium on Combinatorial Pattern Matching, CPM'97, July 1997.
4. M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, 1994.
5. K. Culik and J. Karhumaki, Finite automata computing real functions, SIAM J. Comp (1994).
6. K. Culik and J. Kari, Image compression using weighted finite automata, Computer and Graphics 17, 305-313 (1993).
7. K. Culik and J. Kari, Fractal image compression: theory and applications, (ed. Y. Fisher), Springer Verlag 243-258 (1995).
8. S. De Agostino, P-complete problems in data compression, TCS 127, 181-186, 1994
9. M. Farach and M. Thorup, String Matching in Lempel-Ziv Compressed Strings, Proc. 27th ACM Symposium on Theory of Computing, pp. 703-713, 1994.
10. P. Ferragina, Personal communication
11. L. Gejsieniec, W. Rytter, Almost optimal fully LZW-compressed pattern matching, IEEE Data Compression Conference 1999
12. L. Gesieniec, M. Karpiński, W. Plandowski, and W. Rytter, Efficient algorithms for Lempel-Ziv encoding, Proc. 5th Scandinavian Workshop on Algorithms Theory, pp. 392-403, LNCS 1097, July 1996.
13. A. Gibbons, W. Rytter. Efficient parallel algorithms, Cambridge Univ. Press 1988
14. M. Gu, M. Farach, R. Beigel, An efficient algorithm for dynamic text indexing, SODA'94, 697-704
15. J. Karhumaki, W.Plandowski, W. Rytter, Pattern matching for images generated by finite automata, FCT'97, in LNCS Springer Verlag 1997
16. J. Kari, P. Franti, Arithmetic coding of weighted finite automata, KAIRO Theor. Inform. Appl. 28 343-360 (1994).
17. H.J. Karloff, W.L. Ruzzo, The iterated mod problem, Inf. & Comp. 80(3) 193-204, 1989
18. M. Karpiński, W. Rytter, and A. Shinohara, A pattern matching for strings with short description, Proc. 6th Combinatorial Pattern Matching, June 1995.
19. A. Lempel and J. Ziv On the complexity of finite sequences, IEEE Transactions on Information Theory, pp. 22:75-81, 1976.
20. W. Plandowski and W. Rytter, Application of Lempel-Ziv encodings to the solution of words equations, Proc. of 25th International Colloquium on Automata, Languages, and Programming, to appear.
21. T.A. Welch, A technique for high performance data compression, IEEE transactions on Computers, pp. 17:8-19, 1984.
22. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, pp. IT-23(3):337-343, 1977.