Journal of the ACM Bibliography

Selected papers that cite this one

• Amihood Amir, Gary Benson, and Martin Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52(2):299-307, April 1996.

• Amihood Amir, Gary Benson, and Martin Farach. An alphabet independent approach to two-dimensional pattern matching. SIAM Journal on Computing, 23(2):313-323, April 1994.

• Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, and Alejandro Schäffer. Improved dynamic dictionary matching. Information and Computation, 119(2):258-282, June 1995.

• A. Apostolico and F. P. Preparata. Data structures and algorithms for the strings stastitics problem. Algorithmica, 15(5):481-494, May 1996.

• Lars Arge, Paolo Ferragina, Roberto Grossi, and Jeffrey Scott Vitter. On sorting strings in external memory (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 540-548, El Paso, Texas, 4-6 May 1997.

• Brenda S. Baker. Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM Journal on Computing, 26(5):1343-1362, October 1997.

• Brenda S. Baker. Parameterized pattern matching: Algorithms and applications. Journal of Computer and System Sciences, 52(1):28-42, February 1996.

• Omer Berkman, Costas S. Iliopoulos, and Kunsoo Park. The subtree max gap problem with application to parallel string covering. Information and Computation, 123(1):127-137, 15 November 1995.

• Dany Breslauer. The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science, 191(1-2):131-144, 30 January 1998.

• Dany Breslauer. Dictionary-matching on unbounded alphabets: Uniform length dictionaries. Journal of Algorithms, 18(2):278-295, March 1995.

• Y. Choi and T. W. Lam. Dynamic suffix tree and two-dimensional texts management. Information Processing Letters, 61(4):213-220, 28 February 1997.

• Livio Colussi and Alessia De Col. A time and space efficient data structure for string searching on large texts. Information Processing Letters, 58(5):217-222, 10 June 1996.

• Maxime Crochemore and Dominique Perrin. Two-way string-matching. Journal of the ACM, 38(3):651-675, July 1991.

• David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming I: Linear cost functions. Journal of the ACM, 39(3):519-545, July 1992.

• Martin Farach. Optimal suffix tree construction with large alphabets. In 38th Annual Symposium on Foundations of Computer Science, pages 137-143, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Paolo Ferragina. Dynamic text indexing under string updates. Journal of Algorithms, 22(2):296-328, February 1997.

• Paolo Ferragina and Roberto Grossi. Optimal on-line search and sublinear time update in string matching. SIAM Journal on Computing, 27(3):713-736, June 1998.

• Paolo Ferragina and Roberto Grossi. A fully-dynamic data structure for external substring search (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 693-702, Las Vegas, Nevada, 29 May-1 June 1995.

• Paolo Ferragina, Roberto Grossi, and Manuela Montangero. On updating suffix tree labels. Theoretical Computer Science, 201(1-2):249-262, 6 July 1998. Note.

• Paolo Ferragina and Fabrizio Luccio. Dynamic dictionary matching in external memory. Information and Computation, 146(2):85-99, 1 November 1998.

• Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 4(1):33-72, March 1988.

• Raffaele Giancarlo. A generalization of the suffix tree to square matrices, with applications. SIAM Journal on Computing, 24(3):520-562, June 1995.

• Raffaele Giancarlo and Roberto Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130(2):151-182, 1 November 1996.

• Raffaele Giancarlo and Roberto Grossi. Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms. Journal of Algorithms, 24(2):223-265, August 1997.

• R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3):331-353, November 1997.

• Robert Giegerich and Stefan Kurtz. A comparison of imperative and purely functional suffix tree constructions. Science of Computer Programming, 25(2-3):187-218, December 1995.

• Ramesh Hariharan. Optimal parallel suffix tree construction. Journal of Computer and System Sciences, 55(1):44-69, August 1997.

• Ramana M. Idury and Alejandro A. Schäffer. Multiple matching of parameterized patterns. Theoretical Computer Science, 154(2):203-224, 5 February 1996.

• J. Kärkkäinen and E. Sutinen. Lempel-Ziv index for q-grams. Algorithmica, 21(1):137-154, May 1998.

• S. Rao Kosaraju. Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 310-316, Montréal, Québec, Canada, 23-25 May 1994.

• S. Rao Kosaraju and Arthur L. Delcher. Large-scale assembly of DNA strings and space-efficient construction of suffix trees (preliminary version). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 169-177, Las Vegas, Nevada, 29 May-1 June 1995.

• Gad M. Landau, Eugene W. Myers, and Jeanette P. Schmidt. Incremental string comparison. SIAM Journal on Computing, 27(2):557-582, March 1998.

• Süleyman Cenk \d{S}ahinalp and Uzi Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 320-328, Burlington, Vermont, 14-16 October 1996. IEEE.

• Süleyman Cenk \d{S}ahinalp and Uzi Vishkin. Symmetry breaking for suffix tree construction (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 300-309, Montréal, Québec, Canada, 23-25 May 1994.

• James A. Storer and Thomas G. Szymanski. Data compression via textural substitution. Journal of the ACM, 29(4):928-951, October 1982.

Shortcuts: