14. CPM 2003: Morelia, Michocán, Mexico

@proceedings{DBLP:conf/cpm/2003,
  editor    = {Ricardo A. Baeza-Yates and
               Edgar Ch{\'a}vez and
               Maxime Crochemore},
  title     = {Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003,
               Morelia, Michoc{\'a}n, Mexico, June 25-27, 2003, Proceedings},
  booktitle = {CPM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2676},
  year      = {2003},
  isbn      = {3-540-40311-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
  Multiple Genome Alignment: Chaining Algorithms Revisited. 1-16
  Electronic Edition (Springer LINK) BibTeX
• Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
  Two-Dimensional Pattern Matching with Rotations. 17-31
  Electronic Edition (Springer LINK) BibTeX
• Behshad Behzadi, Jean-Marc Steyaert:
  An Improved Algorithm for Generalized Comparison of Minisatellites. 32-41
  Electronic Edition (Springer LINK) BibTeX
• Brona Brejová, Daniel G. Brown, Tomás Vinar:
  Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. 42-54
  Electronic Edition (Springer LINK) BibTeX
• Stefan Burkhardt, Juha Kärkkäinen:
  Fast Lightweight Suffix Array Construction and Checking. 55-69
  Electronic Edition (Springer LINK) BibTeX
• Raphaël Clifford, Marek J. Sergot:
  Distributed and Paged Suffix Trees for Large Genetic Databases. 70-82
  Electronic Edition (Springer LINK) BibTeX
• Serge Dulucq, Hélène Touzet:
  Analysis of Tree Edit Distance Algorithms. 83-95
  Electronic Edition (Springer LINK) BibTeX
• Olivier Elemento, Olivier Gascuel:
  An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees. 96-108
  Electronic Edition (Springer LINK) BibTeX
• Kimmo Fredriksson, Gonzalo Navarro:
  Average-Optimal Multiple Approximate String Matching. 109-128
  Electronic Edition (Springer LINK) BibTeX
• Raffaele Giancarlo, Marinella Sciortino:
  Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms. 129-143
  Electronic Edition (Springer LINK) BibTeX
• Dan Gusfield:
  Haplotype Inference by Pure Parsimony. 144-155
  Electronic Edition (Springer LINK) BibTeX
• Tzvika Hartman:
  A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. 156-169
  Electronic Edition (Springer LINK) BibTeX
• Haim Kaplan, Elad Verbin:
  Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. 170-185
  Electronic Edition (Springer LINK) BibTeX
• Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
  Linear-Time Construction of Suffix Arrays. 186-199
  Electronic Edition (Springer LINK) BibTeX
• Pang Ko, Srinivas Aluru:
  Space Efficient Linear Time Construction of Suffix Arrays. 200-210
  Electronic Edition (Springer LINK) BibTeX
• Jari Kytöjoki, Leena Salmela, Jorma Tarhio:
  Tuning String Matching for Huge Pattern Sets. 211-224
  Electronic Edition (Springer LINK) BibTeX
• Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
  Sparse LCS Common Substring Alignment. 225-236
  Electronic Edition (Springer LINK) BibTeX
• Kjell Lemström, Veli Mäkinen:
  On Minimizing Pattern Splitting in Multi-track String Matching. 237-253
  Electronic Edition (Springer LINK) BibTeX
• Bin Ma, Zhuozhi Wang, Kaizhong Zhang:
  Alignment between Two Multiple Alignments. 254-265
  Electronic Edition (Springer LINK) BibTeX
• Bin Ma, Kaizhong Zhang, Chengzhi Liang:
  An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum. 266-277
  Electronic Edition (Springer LINK) BibTeX
• Giancarlo Mauri, Giulio Pavesi:
  Pattern Discovery in RNA Secondary Structure Using Affix Trees. 278-294
  Electronic Edition (Springer LINK) BibTeX
• Nadia Nedjah, Luiza de Macedo Mourelle:
  More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs. 295-314
  Electronic Edition (Springer LINK) BibTeX
• François Nicolas, Eric Rivals:
  Complexities of the Centre and Median String Problems. 315-327
  Electronic Edition (Springer LINK) BibTeX
• Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre:
  Extracting Approximate Patterns. 328-347
  Electronic Edition (Springer LINK) BibTeX
• Hiroshi Sakamoto:
  A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression. 348-360
  Electronic Edition (Springer LINK) BibTeX
• Gabriel Valiente:
  Constrained Tree Inclusion. 361-371
  Electronic Edition (Springer LINK) BibTeX
• Maria Emilia Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira:
  Working on the Problem of Sorting by Transpositions on Genome Rearrangements. 372-383
  Electronic Edition (Springer LINK) BibTeX
• Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi:
  Efficient Selection of Unique and Popular Oligos for Large EST Databases. 384-401
  Electronic Edition (Springer LINK) BibTeX