CPM 1994: Asilomar, California, USA
Maxime Crochemore, Dan Gusfield (Eds.): Lecture Notes in Computer Science 807, Springer, 1994.
- Gary Benson:
A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score.
1-14
download paper
- Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus.
15-30
download paper
- Kun-Mao Chao:
Computing all Suboptimal Alignments in Linear Space.
31-42
download paper
- Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment.
43-53
download paper
- Xiaoqiu Huang:
A Context Dependent Method for Comparing Sequences.
54-63
download paper
- Archie L. Cobbs:
Fast Identification of Approximately Matching Substrings.
64-74
download paper
- Tao Jiang, Lusheng Wang, Kaizhong Zhang:
Alignment of Trees - An Alternative to Tree Edit.
75-86
download paper
- Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller:
Parametric Recomuting in Alignment Graphs.
87-101
download paper
- Tomasz Luczak, Wojciech Szpankowski:
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.
102-112
download paper
- Udi Manber:
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File.
113-124
download paper
- Marek Karpinski, Wojciech Rytter:
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern.
125-135
download paper
- L. Lestrée:
Unit Route Upper Bound for String-Matching on Hypercube.
136-145
download paper
- S. Rao Kosaraju:
Computation of Squares in a String (Preliminary Version).
146-150
download paper
- Mehryar Mohri:
Minimization of Sequential Transducers.
151-163
download paper
- Kenneth S. Alexander:
Shortest Common Superstrings for Strings of Random Letters.
164-172
download paper
- Robert W. Irving, Campbell Fraser:
Maximal Common Subsequences and Minimal Common Supersequences.
173-183
download paper
- Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.
184-197
download paper
- Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu:
Proximity Matching Using Fixed-Queries Trees.
198-212
download paper
- Pekka Kilpeläinen, Heikki Mannila:
Query Primitives for Tree-Structured Data.
213-225
download paper
- Ramana M. Idury, Alejandro A. Schäffer:
Multiple Matching of Parameterized Patterns.
226-239
download paper
- Tatsuya Akutsu:
Approximate String Matching with Don't Care Characters.
240-249
download paper
- Shouwen Tang, Kaizhong Zhang, Xiaolin Wu:
Matching with Matrix Norm Minimization.
250-258
download paper
- William I. Chang, Thomas G. Marr:
Approximate String Matching and Local Similarity.
259-273
download paper
- Minoru Ito, Kuniyasu Shimizu, Michio Nakanishi, Akihiro Hashimoto:
Polynomial-Time Algorithms for Computing Characteristic Strings.
274-288
download paper
- Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler:
Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars.
289-306
download paper
- John D. Kececioglu, David Sankoff:
Efficient Bounds for Oriented Chromosome Inversion Distance.
307-325
download paper