4. CPM 1993: Padova, Italy

@proceedings{DBLP:conf/cpm/1993,
  editor    = {Alberto Apostolico and
               Maxime Crochemore and
               Zvi Galil and
               Udi Manber},
  title     = {Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93,
               Padova, Italy, June 2-4, 1993, Proceedings},
  booktitle = {CPM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {684},
  year      = {1993},
  isbn      = {3-540-56764-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Tatsuya Akutsu: A Linear Time Pattern Matching Algorithm Between a String and a Tree. 1-10 BibTeX
• Dany Breslauer, Livio Colussi, Laura Toniolo: Tight Comparison Bounds for the String Prefix-Matching Problem. 11-19 BibTeX
• Daniel Fischer, Raquel Norel, Ruth Nussinov, Haim J. Wolfson: 3-D Docking of Protein Molecules. 20-34 BibTeX
• Emmanuelle Garel: Minimal Separators of Two Words. 35-53 BibTeX
• Costas S. Iliopoulos, Dennis Moore, Kunsoo Park: Covering a String. 54-62 BibTeX
• Robert W. Irving, Campbell Fraser: On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings. 63-73 BibTeX
• Sampath Kannan, Eugene W. Myers: An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score. 74-86 BibTeX
• John D. Kececioglu, David Sankoff: Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes. 87-105 BibTeX
• John D. Kececioglu: The Maximum Weight Trace Problem in Multiple Sequence Alignment. 106-119 BibTeX
• Gad M. Landau, Jeanette P. Schmidt: An Algorithm for Approximate Tandem Repeats. 120-133 BibTeX
• Gad M. Landau, Uzi Vishkin: Two Dimensional Pattern Matching in a Digitized Image. 134-151 BibTeX
• Guy Louchard, Wojciech Szpankowski: Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). 152-163 BibTeX
• S. Muthukrishnan: Detecting False Matches in String Matching Algorithms. 164-178 BibTeX
• Dalit Naor, Douglas L. Brutlag: On Suboptimal Alignments of Biological Sequences. 179-196 BibTeX
• Pavel A. Pevzner, Michael S. Waterman: A Fast Filtration Algorithm for the Substring Matching Problem. 197-214 BibTeX
• Mireille Régnier, Ladan Rostami: A Unifying Look at d-Dimensional Periodicities and Space Coverings. 215-227 BibTeX
• Esko Ukkonen: Approximate String-Matching over Suffix Trees. 228-242 BibTeX
• Martin Vingron, Pavel A. Pevzner: Multiple Sequence Comparison and n-Dimensional Image Reconstruction. 243-253 BibTeX
• Kaizhong Zhang: A New Editing based Distance between Unordered Labeled Trees. 254-265 BibTeX