CPM 1992: Tucson, Arizona, USA

• Wojciech Szpankowski:
  Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract). 1-14
  download paper
• Mireille Régnier:
  A Language Approach to String Searching Evaluation. 15-26
  download paper
• Mikhail J. Atallah, Philippe Pacquet, Wojciech Szpankowski:
  Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). 27-40
  download paper
• Jong Yong Kim, John Shawe-Taylor:
  Fast Multiple Keyword Searching. 41-51
  download paper
• Guy Jacobson, Kiem-Phong Vo:
  Heaviest Increasing/Common Subsequence Problems. 52-66
  download paper
• James R. Knight, Eugene W. Myers:
  Approximate Regular Expression Pattern Matching with Concave Gap Penalties. 67-78
  download paper
• Pavel A. Pevzner, M. S. Waterman:
  Matrix Longest Common Subsequence Problem, Duality and Hibert Bases. 79-89
  download paper
• Chia-Hsiang Chang, Robert Paige:
  From Regular Expressions to DFA's Using Compressed NFA's. 90-110
  download paper
• Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers:
  Identifying Periodic Occurrences of a Template with Applications to Protein Structures. 111-120
  download paper
• David Sankoff:
  Edit Distances for Genome Comparisons Based on Non-Local Operations. 121-135
  download paper
• Daniel Fischer, Ruth Nussinov, Haim J. Wolfson:
  3-D Substructure Matching in Protein Molecules. 136-150
  download paper
• Kaizhong Zhang, Dennis Shasha, Jason Tsong-Li Wang:
  Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's. 151-161
  download paper
• Pekka Kilpeläinen, Heikki Mannila:
  Grammatical Tree Matching. 162-174
  download paper
• William I. Chang, Jordan Lampe:
  Theoretical and Empirical Comparisons of Approximate String Matching Algorithms. 175-184
  download paper
• Ricardo A. Baeza-Yates, Chris H. Perleberg:
  Fast and Practical Approximate String Matching. 185-192
  download paper
• Dominique Revuz, Marc Zipstein:
  DZ: A Text Compression Algorithm For Natural Languages. 193-204
  download paper
• Pavel A. Pevzner:
  Multiple Alignment with Guaranteed Error Bounds and Communication Cost. 205-213
  download paper
• Robert W. Irving, Campbell Fraser:
  Two Algorithms for the Longest Common Subsequence of Three (or More) Strings. 214-229
  download paper
• Lucas Chi Kwong Hui:
  Color Set Size Problem with Application to String Matching. 230-243
  download paper
• Dinesh P. Mehta, Sartaj Sahni:
  Computing Display Conflicts in String and Circular String Visualization. 244-261
  download paper
• Amihood Amir, Martin Farach, Yossi Matias:
  Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). 262-275
  download paper
• Ramana M. Idury, Alejandro A. Schäffer:
  Dynamic Dictionary Matching with Failure Functions (Extended Abstract). 276-287
  download paper