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