3. CPM 1992:
Tucson,
Arizona,
USA
Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber (Eds.):
Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings.
Lecture Notes in Computer Science 644 Springer 1992, ISBN 3-540-56024-6 
- Wojciech Szpankowski:
Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract).
1-14
- Mireille Régnier:
A Language Approach to String Searching Evaluation.
15-26
- Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski:
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).
27-40
- Jong Yong Kim, John Shawe-Taylor:
Fast Multiple Keyword Searching.
41-51
- Guy Jacobson, Kiem-Phong Vo:
Heaviest Increasing/Common Subsequence Problems.
52-66
- James R. Knight, Eugene W. Myers:
Approximate Regular Expression Pattern Matching with Concave Gap Penalties.
67-78
- Pavel A. Pevzner, Michael S. Waterman:
Matrix Longest Common Subsequence Problem, Duality and Hibert Bases.
79-89
- Chia-Hsiang Chang, Robert Paige:
From Regular Expressions to DFA's Using Compressed NFA's.
90-110
- 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
- David Sankoff:
Edit Distances for Genome Comparisons Based on Non-Local Operations.
121-135
- Daniel Fischer, Ruth Nussinov, Haim J. Wolfson:
3-D Substructure Matching in Protein Molecules.
136-150
- Kaizhong Zhang, Dennis Shasha, Jason Tsong-Li Wang:
Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's.
151-161
- Pekka Kilpeläinen, Heikki Mannila:
Grammatical Tree Matching.
162-174
- William I. Chang, Jordan Lampe:
Theoretical and Empirical Comparisons of Approximate String Matching Algorithms.
175-184
- Ricardo A. Baeza-Yates, Chris H. Perleberg:
Fast and Practical Approximate String Matching.
185-192
- Dominique Revuz, Marc Zipstein:
DZ: A Text Compression Algorithm For Natural Languages.
193-204
- Pavel A. Pevzner:
Multiple Alignment with Guaranteed Error Bounds and Communication Cost.
205-213
- Robert W. Irving, Campbell Fraser:
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings.
214-229
- Lucas Chi Kwong Hui:
Color Set Size Problem with Application to String Matching.
230-243
- Dinesh P. Mehta, Sartaj Sahni:
Computing Display Conflicts in String and Circular String Visualization.
244-261
- Amihood Amir, Martin Farach, Yossi Matias:
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).
262-275
- Ramana M. Idury, Alejandro A. Schäffer:
Dynamic Dictionary Matching with Failure Functions (Extended Abstract).
276-287
Last update Thu May 24 04:15:23 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
