String matching with preprocessing of text and pattern

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

Volumn 510 LNCS, Issue , 1991, Pages 739-750

  Naor, Moni ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

LEMPEL-ZIV ALGORITHMS; LINEAR TIME; LOGARITHMIC TIME; ON-LINE ALGORITHMS; ON-LINE COMPLEXITY; PRE-PROCESSING ALGORITHMS; STRING MATCHING; SUBSTRING;

DIGITAL STORAGE;

EID: 21144458670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54233-7_179     Document Type: Conference Paper

References (17)

1. A. V. Aho, Algorithms for finding patterns in strings, in The Handbook of Theoretical Computer Science, edited by J. van Leeuwen, Elsevier, Amsterdam, 1990.
2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974.
3. A. Apostolico and Z. Galil, Combinatorial algorithms on words, Springer-Verlag, 1985.
4. A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3, 1988, pp. 347-365.
5. Chen and Seifres, Efficient and elegant subword-tree construction, in combinatorial algorithms on words, Springer-Verlag, 1985, pp. 97-110.
6. C. Jordan, Sur le assemblages des lignes, J. Reine und Ang. Math. 70, 1869, pp. 185-190.
7. R. M. Karp and M. O. Rabin Efficient randomized pattern-matching algorithms, IBM Journal of R & D, 31, 1987, 249-260.
8. D. E. Knuth, J. H. Morris and V. R. Pratt, Fast pattern matching in strings, Siam journal on Computing 6, 1977, pp. 323-349.
9. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Transactions on Information Theory 22, 1976, pp. 75-81.
10. E. M. McCreight, A space economical suffix tree construction algorithm, Journal of the ACM 23, 1976, 262-272.
11. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, Journal of the ACM 30, 1983, pp 852-865.
12. M. Rodeh, V. R. Pratt and S. Even, Linear algorithms for compression via string matching, Journal of the ACM 28, 1980, pp. 16-24.
13. J. A. Storer, Data compression: methods and theory, Computer Sdence Press, Rockville, 1988.
14. P. Weiner, Linear pattern matching algorithms Proc. 14th annual Symp. on Switching and Automata Theory, pp. 1-11.
15. A. C. Yao Some complexity question related to distributive computing Proc. 11th ACM Symposioum on Theory of Computing, 1979, pp. 209-213.
16. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory 23, 1977, pp. 337-343.
17. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory 24, 1978, pp. 530-536.