CPM B

23 papers

YearTitle / Authors
19923-D Substructure Matching in Protein Molecules.
Daniel Fischer, Ruth Nussinov, Haim J. Wolfson
1992A Language Approach to String Searching Evaluation.
Mireille Régnier
1992Approximate Regular Expression Pattern Matching with Concave Gap Penalties.
James R. Knight, Eugene W. Myers
1992Color Set Size Problem with Application to String Matching.
Lucas Chi Kwong Hui
1992Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings
Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1992Computing Display Conflicts in String and Circular String Visualization.
Dinesh P. Mehta, Sartaj Sahni
1992DZ: A Text Compression Algorithm For Natural Languages.
Dominique Revuz, Marc Zipstein
1992Dynamic Dictionary Matching with Failure Functions (Extended Abstract).
Ramana M. Idury, Alejandro A. Schäffer
1992Edit Distances for Genome Comparisons Based on Non-Local Operations.
David Sankoff
1992Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).
Amihood Amir, Martin Farach, Yossi Matias
1992Fast Multiple Keyword Searching.
Jong Yong Kim, John Shawe-Taylor
1992Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's.
Kaizhong Zhang, Dennis E. Shasha, Jason Tsong-Li Wang
1992Fast and Practical Approximate String Matching.
Ricardo A. Baeza-Yates, Chris H. Perleberg
1992From Regular Expressions to DFA's Using Compressed NFA's.
Chia-Hsiang Chang, Robert Paige
1992Grammatical Tree Matching.
Pekka Kilpeläinen, Heikki Mannila
1992Heaviest Increasing/Common Subsequence Problems.
Guy Jacobson, Kiem-Phong Vo
1992Identifying Periodic Occurrences of a Template with Applications to Protein Structures.
Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
1992Matrix Longest Common Subsequence Problem, Duality and Hibert Bases.
Pavel A. Pevzner, Michael S. Waterman
1992Multiple Alignment with Guaranteed Error Bounds and Communication Cost.
Pavel A. Pevzner
1992Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).
Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski
1992Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract).
Wojciech Szpankowski
1992Theoretical and Empirical Comparisons of Approximate String Matching Algorithms.
William I. Chang, Jordan Lampe
1992Two Algorithms for the Longest Common Subsequence of Three (or More) Strings.
Robert W. Irving, Campbell Fraser