Two-dimensional periodicity and its applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 440-452

  Amir, Amihood ^a   Benson, Gary ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION;

ALGORITHMIC TECHNIQUES; ALGORITHMIC TOOLS; COMPRESSED MATCHING; ITS APPLICATIONS; OPTIMAL ALGORITHM; PERIODICITY ANALYSIS; RECTANGULAR ARRAYS; STRING MATCHING;

PATTERN MATCHING;

EID: 85030052368     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A.V. Aho and M.J. Corasick, "Efficient String Matching", C. ACM, Vol. 18, No. 6, 1975, pp. 333-340.
2. A. Amir, G.M. Landau and U. Vishkin, "Efficient Pattern Matching with Scaling", Proo. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 344-357.
3. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber, and U. Vishkin, "Parallel Construction of a Suffix Tree with Applications", Algorithmica, Vol. 3, 1988, pp. 347-365.
4. T.P. Baker, "A Technique For Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension", SIAM J. Comput., Vol. 7, No. 4, 1978, pp. 533-541.
5. G. Benson, Doctoral dissertation, University of Maryland, College Park, Md., 1992.
6. R.S. Bird, 'Two Dimensional Pattern Matching", Information Processing Letters, Vol. 6, No. 5, 1977, pp. 168-170.
7. R.S. Boyer and J.S. Moore, "A Fast String Searching Algorithm", Comm. ACM, Vol. 20, 1977, pp. 762772.
8. Z. Galil, "Optimal Parallel Algorithms for String Matching", Information and Control, Vol. 67, 1985, pp 144-157.
9. D. Harel and R.E. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors", SIAM J. Computing, Vol. 13, No. 2, 1984, pp. 338-355.
10. D. A. Huffman, "A Method for the Construction of Minimum-Redundancy Code", Proceedings of the IRE 40, 1952, pp. 1098-1101.
11. R.M. Karp, and M.O. Rabin, "Efficient Randomized Pattern-Matching Algorithms", IBM Journal of Res. and Dev., 1987, pp. 249-260.
12. D.E. Knuth, J.H. Morris and V.R. Pratt, "Fast Pattern Matching in Strings", SIAM J. Comp., Vol. 6, 1977, pp. 323-350.
13. R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation", J ACM, Vol 27, 1980, pp. 831-838.
14. G. G. Langdon and J. Rissanen, "Compression of Black-White Images with Arithmetic Coding", IEEE Trans. Communications, 1981, pp. 858-867.
15. A. Lempel and J. Ziv, "On the Complexity of Finite Sequences", IEEE Transactions on Information Theory, Vol. 22, pp. 75-81.
16. A. Lempel and J. Ziv, "Compression of Two-Dimensional Images", Combinatorial Algorithms on Words, (A. Apostolico and Z. Galil, editors), 1985, pp. 141-154.
17. M.G. Main and R.J. Lorentz, "An O(rclogn) Algorithm for Finding all Repetitions in a String", J. of Algorithms, 1984, pp. 422-432.
18. V. S. Miller and M. N. Wegman, "Variations on a Theme by Lempel and Ziv", Combinatorial Algorithms on Words, (A. Apostolico and Z. Galil, editors), 1985, pp. 131-140.
19. J. Rissanen, "Stochastic Complexity", J. of the Royal Statistical Society, Series B, Vol. 49, 1987, pp. 223-239.
20. J. Rissanen and G.G. Langdon, "Arithmetic Coding", IBM Journal of Research and Development, Vol. 23, 1979, pp. 149-162.
21. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
22. B. Schieber and U. Vishkin, "On Finding Low- est Common Ancestors: Simplification and Parallelization", SIAM J. Comput., Vol. 17, 1988, pp. 1253-1262.
23. J. A. Storer, "Lossy On-Line dynamic Data Compression", Sequences: Combinatorics, Compression, Security, and Transmission, (R. M. Capocelli, editor), Springer-Verlag, 1990, pp. 348-357.
24. U. Vishkin, "Optimal Parallel Pattern Matching in Strings", Information and Control, Vol. 67, 1985, pp. 91-113.
25. U. Vishkin, "Deterministic Sampling-a new technique for fast pattern matching", SIAM J. Comput., Vol. 20, 1991, pp. 303-314.
26. P. Weiner, "Linear Pattern Matching Algorithms", Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.
27. T. A. Welch, "A Technique for High-Performance Data Compression", IEEE Computer, Vol. 17, 1984, pp. 8-19.