CPM 1996: Laguna Beach, California, USA
Daniel S. Hirschberg, Eugene W. Myers (Eds.): Lecture Notes in
Computer Science 1075, Springer, 1996.
- Ricardo A. Baeza-Yates, Gonzalo Navarro:
A Faster Algorithm for Approximate String Matching.
1-23
download paper
- Nadia El-Mabrouk, Maxime Crochemore:
Boyer-Moore Strategy to Efficient Approximate String Matching.
24-38
download paper
- Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
39-49
download paper
- Erkki Sutinen, Jorma Tarhio:
Filtration with q-Samples in Approximate String Matching.
50-63
download paper
- David J. Lipman:
Computing Discoveries in Molecular Biology (Invited Lecture).
64
download paper
- Gerth Stølting Brodal, Leszek Gasieniec:
Approximate Dictionary Queries.
65-74
download paper
- Robert Muth, Udi Manber:
Approximate Multiple Strings Search.
75-86
download paper
- Chris Armen, Clifford Stein:
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.
87-101
download paper
- Arne Andersson, N. Jesper Larsson, Kurt Swanson:
Suffix Trees on Words.
102-115
download paper
- Dany Breslauer:
The suffix Tree of a Tree and Minimizing Sequential Transducers.
116-129
download paper
- Martin Farach, S. Muthukrishnan:
Perfect Hashing for Strings: Formalization and Algorithms.
130-140
download paper
- Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner:
Spliced Alignment: A New Approach to Gene Recognition.
141-158
download paper
- Vincent Ferretti, Joseph H. Nadeau, David Sankoff:
Original Synteny.
159-167
download paper
- Piotr Berman, Sridhar Hannenhalli:
Fast Sorting by Reversal.
168-185
download paper
- Marie-France Sagot, Alain Viari:
A Double Combinatorial Approach to Discovering Patterns in Biological Sequences.
186-208
download paper
- Richard Arratia, Gesine Reinert:
Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization (Invited Lecture).
209-219
download paper
- Lusheng Wang, Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment.
220-233
download paper
- Cynthia A. Phillips, Tandy Warnow:
The Asymmetric Median Tree - A New model for Building Consensus Trees.
234-252
download paper
- Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin:
Constructing Computer Virus Phylogenies.
253-270
download paper
- Bilha Sandak, Ruth Nussinov, Haim J. Wolfson:
Docking of Conformationally Flexible Proteins.
271-287
download paper
- William E. Hart, Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).
288-303
download paper
- Dan Gusfield, Richard M. Karp, Lushen Wang, Paul Stelling:
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.
304-319
download paper
- Amihood Amir, Gruia Calinescu:
Alphabet Independent and Dictionary Scaled Matching.
320-334
download paper
- Kunsoo Park:
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.
335-347
download paper
- Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
348-360
download paper
- Kaizhong Zhang:
Efficient Parallel Algorithms for Tree Editing Problems.
361-372
download paper
- James J. Fu:
Approximate Pattern Matching in Directed Graphs.
373-383
download paper
- Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans:
Finite-State Computability of Annotations of Strings and Trees.
384-391
download paper