© 2007

Combinatorial Pattern Matching

18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings

  • Editors
  • Bin Ma
  • Kaizhong Zhang
Conference proceedings CPM 2007

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4580)

Table of contents

  1. Front Matter
  2. Invited Talks (Abstracts)

  3. Session 1: Alogirthmic Techniques I

    1. Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
      Pages 4-15
    2. Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
      Pages 16-27
  4. Session 2: Approximate Pattern Matching

    1. Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
      Pages 28-39
    2. Wing-Kai Hon, Tak-Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter
      Pages 40-51
    3. Peter Clifford, Raphaël Clifford
      Pages 63-70
  5. Session 3: Data Compression I

    1. Travis Gagie, Giovanni Manzini
      Pages 71-82
    2. Diego Arroyuelo, Gonzalo Navarro
      Pages 83-94
    3. Haim Kaplan, Elad Verbin
      Pages 107-118
  6. Session 4: Computational Biology I

    1. Zhixiang Chen, Bin Fu, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu
      Pages 119-130
    2. Maxime Benoît-Gagné, Sylvie Hamel
      Pages 131-141
    3. Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu
      Pages 142-149
  7. Session 5: Computational Biology II

    1. Jing Zhang, Xi Chen, Ming Li
      Pages 162-172
  8. Session 6: Algorithmic Techniques II

About these proceedings


The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees,regularexpressions,graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently.


Alphabet DOM Pattern Matching Variable algorithms approximation bioinformatics coding and data compression combinatorial pattern matching computational discrete mathematics data analysis data compression data mining dynamic programming genome

Bibliographic information