13. CPM 2002: Fukuoka, Japan

@proceedings{DBLP:conf/cpm/2002,
  editor    = {Alberto Apostolico and
               Masayuki Takeda},
  title     = {Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002,
               Fukuoka, Japan, July 3-5, 2002, Proceedings},
  booktitle = {CPM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2373},
  year      = {2002},
  isbn      = {3-540-43862-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jun Ogasawara, Shinichi Morishita:
  Practical Software for Aligning ESTs to Human Genome. 1-16
  Electronic Edition (Springer LINK) BibTeX
• Hiroki Arimura:
  Efficient Text Mining with Optimized Pattern Discovery. 17-19
  Electronic Edition (Springer LINK) BibTeX
• Wojciech Rytter:
  Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. 20-31
  Electronic Edition (Springer LINK) BibTeX
• Raymond Wan, Alistair Moffat:
  Block Merging for Off-Line Compression. 32-41
  Electronic Edition (Springer LINK) BibTeX
• Jussi Rautio, Jani Tanninen, Jorma Tarhio:
  String Matching with Stopper Encoding and Code Splitting. 42-52
  Electronic Edition (Springer LINK) BibTeX
• Stéphane Vialette:
  Pattern Matching Problems over 2-Interval Sets. 53-63
  Electronic Edition (Springer LINK) BibTeX
• Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy:
  The Problem of Context Sensitive String Matching. 64-75
  Electronic Edition (Springer LINK) BibTeX
• Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth:
  Two-Pattern Strings. 76-84
  Electronic Edition (Springer LINK) BibTeX
• Dana Shapira, James A. Storer:
  Edit Distance with Move Operations. 85-98
  Electronic Edition (Springer LINK) BibTeX
• Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
  Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. 99-114
  Electronic Edition (Springer LINK) BibTeX
• Veli Mäkinen, Esko Ukkonen:
  Local Similarity Based Point-Pattern Matching. 115-132
  Electronic Edition (Springer LINK) BibTeX
• Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
  Identifying Occurrences of Maximal Pairs in Multiple Strings. 133-143
  Electronic Edition (Springer LINK) BibTeX
• Wing-Kai Hon, Kunihiko Sadakane:
  Space-Economical Algorithms for Finding Maximal Unique Matches. 144-152
  Electronic Edition (Springer LINK) BibTeX
• Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa:
  The Minimum DAWG for All Suffixes of a String and Its Applications. 153-167
  Electronic Edition (Springer LINK) BibTeX
• Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
  On the Complexity of Deriving Position Specific Score Matrices from Examples. 168-177
  Electronic Edition (Springer LINK) BibTeX
• Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
  Three Heuristics for delta-Matching: delta-BM Algorithms. 178-189
  Electronic Edition (Springer LINK) BibTeX
• Brona Brejová, Tomás Vinar:
  A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. 190-202
  Electronic Edition (Springer LINK) BibTeX
• Heikki Hyyrö, Gonzalo Navarro:
  Faster Bit-Parallel Approximate String Matching. 203-224
  Electronic Edition (Springer LINK) BibTeX
• Stefan Burkhardt, Juha Kärkkäinen:
  One-Gapped q-Gram Filtersfor Levenshtein Distance. 225-234
  Electronic Edition (Springer LINK) BibTeX
• Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
  Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. 235-248
  Electronic Edition (Springer LINK) BibTeX
• Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
  Statistical Identification of Uniformly Mutated Segments within Repeats. 249-261
  Electronic Edition (Springer LINK) BibTeX
• S. Muthukrishnan, Süleyman Cenk Sahinalp:
  Simple and Practical Sequence Nearest Neighbors with Block Operations. 262-278
  Electronic Edition (Springer LINK) BibTeX
• Lucian Ilie, Sheng Yu:
  Constructing NFA s by Optimal Use of Positions in Regular Expressions. 279-288
  Electronic Edition (Springer LINK) BibTeX