11. CPM 2000: Montreal, Canada

@proceedings{DBLP:conf/cpm/2000,
  editor    = {Raffaele Giancarlo and
               David Sankoff},
  title     = {Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000,
               Montreal, Canada, June 21-23, 2000, Proceedings},
  booktitle = {CPM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1848},
  year      = {2000},
  isbn      = {3-540-67633-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Andrei Z. Broder:
  Identifying and Filtering Near-Duplicate Documents. 1-10
  Electronic Edition (Springer LINK) BibTeX
• Fernando C. N. Pereira:
  Machine Learning for Efficient Natural-Language Processing. 11
  Electronic Edition (Springer LINK) BibTeX
• Ian H. Witten:
  Browsing around a Digital Library: Today and Tomorrow. 12-26
  Electronic Edition (Springer LINK) BibTeX

Summer School Lectures

• Adam L. Buchsbaum, Raffaele Giancarlo:
  Algorithmic Aspects of Speech Recognition: A Synopsis. 27-32
  Electronic Edition (Springer LINK) BibTeX
• Laxmi Parida:
  Some Results on Flexible-Pattern Discovery. 33-45
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

• Robert Giegerich:
  Explaining and Controlling Ambiguity in Dynamic Programming. 46-59
  Electronic Edition (Springer LINK) BibTeX
• Sung-Ryul Kim, Kunsoo Park:
  A Dynamic Edit Distance Table. 60-68
  Electronic Edition (Springer LINK) BibTeX
• David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
  Parametric Multiple Sequence Alignment and Phylogeny Construction. 69-83
  Electronic Edition (Springer LINK) BibTeX
• Paul Horton:
  Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment. 84-98
  Electronic Edition (Springer LINK) BibTeX
• Bin Ma:
  A Polynominal Time Approximation Scheme for the Closest Substring Problem. 99-107
  Electronic Edition (Springer LINK) BibTeX
• Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
  Approximation Algorithms for Hamming Clustering Problems. 108-118
  Electronic Edition (Springer LINK) BibTeX
• Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
  Approximating the Maximum Isomorphic Agreement Subtree Is Hard. 119-128
  Electronic Edition (Springer LINK) BibTeX
• Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
  A Faster and Unifying Algorithm for Comparing Trees. 129-142
  Electronic Edition (Springer LINK) BibTeX
• Itsik Pe'er, Ron Shamir, Roded Sharan:
  Incomplete Directed Perfect Phylogeny. 143-153
  Electronic Edition (Springer LINK) BibTeX
• Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
  The Longest Common Subsequence Problem for Arc-Annotated Sequences. 154-165
  Electronic Edition (Springer LINK) BibTeX
• Gonzalo Navarro, Jorma Tarhio:
  Boyer-Moore String Matching over Ziv-Lempel Compressed Text. 166-180
  Electronic Edition (Springer LINK) BibTeX
• Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
  A Boyer-Moore Type Algorithm for Compressed Pattern Matching. 181-194
  Electronic Edition (Springer LINK) BibTeX
• Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
  Approximate String Matching over Ziv-Lempel Compressed Text. 195-209
  Electronic Edition (Springer LINK) BibTeX
• Shmuel T. Klein:
  Improving Static Compression Schemes by Alphabet Extension. 210-221
  Electronic Edition (Springer LINK) BibTeX
• Nadia El-Mabrouk:
  Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments. 222-234
  Electronic Edition (Springer LINK) BibTeX
• David Bryant:
  A Lower Bound for the Breakpoint Phylogeny Problem. 235-247
  Electronic Edition (Springer LINK) BibTeX
• David Liben-Nowell, Jon M. Kleinberg:
  Structural Properties and Tractability Results for Linear Synteny. 248-263
  Electronic Edition (Springer LINK) BibTeX
• Steven Skiena, Pavel Sumazin:
  Shift Error Detection in Standardized Exams. 264-276
  Electronic Edition (Springer LINK) BibTeX
• Rolf Backofen:
  An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC). 277-292
  Electronic Edition (Springer LINK) BibTeX
• Matthew R. Nelson, Sharon L. Kardia, Charles F. Sing:
  The Combinatorial Partitioning Method. 293-304
  Electronic Edition (Springer LINK) BibTeX
• Veli Mäkinen:
  Compact Suffix Array. 305-319
  Electronic Edition (Springer LINK) BibTeX
• Moritz G. Maaß:
  Linear Bidirectional On-Line Construction of Affix Trees. 320-334
  Electronic Edition (Springer LINK) BibTeX
• Emily Rocke:
  Using Suffix Trees for Gapped Motif Discovery. 335-349
  Electronic Edition (Springer LINK) BibTeX
• Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jorma Tarhio:
  Indexing Text with Approximate q-Grams. 350-363
  Electronic Edition (Springer LINK) BibTeX
• Cyril Allauzen, Mathieu Raffinot:
  Simple Optimal String Matching Algorithm. 364-374
  Electronic Edition (Springer LINK) BibTeX
• Sven Rahmann, Eric Rivals:
  Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts. 375-387
  Electronic Edition (Springer LINK) BibTeX
• Mireille Régnier, Laurent Mouchard:
  Periods and Quasiperiods Characterization. 388-396
  Electronic Edition (Springer LINK) BibTeX
• Gerth Stølting Brodal, Christian N. S. Pedersen:
  Finding Maximal Quasiperiodicities in Strings. 397-411
  Electronic Edition (Springer LINK) BibTeX
• Artur Czumaj, Leszek Gasieniec:
  On the Complexity of Determining the Period of a String. 412-422
  Electronic Edition (Springer LINK) BibTeX