Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Pattern Matching

17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Moshe Lewenstein

    1. Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gabriel Valiente

    1. Department of Software, Technical University of Catalonia, Barcelona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CPM 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  2. Asynchronous Pattern Matching

    1. Asynchronous Pattern Matching

      • Amihood Amir
      Pages 1-10

    2. SNP and Haplotype Analysis – Algorithms and Applications

      • Eran Halperin
      Pages 11-11

    3. Identifying Co-referential Names Across Large Corpora

      • Levon Lloyd, Andrew Mehler, Steven Skiena
      Pages 12-23

  3. Session 1. Data Structures

    1. Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

      • Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
      Pages 24-35

    2. Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE

      • Johannes Fischer, Volker Heun
      Pages 36-48

  4. Session 2. Indexing Data Structures

    1. A Linear Size Index for Approximate Pattern Matching

      • Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong
      Pages 49-59

    2. On-Line Linear-Time Construction of Word Suffix Trees

      • Shunsuke Inenaga, Masayuki Takeda
      Pages 60-71

    3. Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

      • Pang Ko, Srinivas Aluru
      Pages 72-83

    4. Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures

      • Tetsuo Shibuya
      Pages 84-93

  5. Session 3. Probabilistic and Algebraic Techniques

    1. New Bounds for Motif Finding in Strong Instances

      • Broňa Brejová, Daniel G. Brown, Ian M. Harrower, Tomáš VinaÅ™
      Pages 94-105

    2. Fingerprint Clustering with Bounded Number of Missing Values

      • Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri
      Pages 106-116

    3. Tiling an Interval of the Discrete Line

      • Olivier Bodini, Eric Rivals
      Pages 117-128

    4. Common Substrings in Random Strings

      • Eric Blais, Mathieu Blanchette
      Pages 129-140

  6. Session 4. Applications in Molecular Biology I

    1. On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem

      • Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter
      Pages 141-152

    2. Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms

      • Sven Rahmann
      Pages 153-164

    3. Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees

      • Sylvain Guillemot, François Nicolas
      Pages 165-176

    4. An Improved Algorithm for the Macro-evolutionary Phylogeny Problem

      • Behshad Behzadi, Martin Vingron
      Pages 177-187

  7. Session 5. String Matching I

    1. Property Matching and Weighted Matching

      • Amihood Amir, Eran Chencinski, Costas Iliopoulos, Tsvi Kopelowitz, Hui Zhang
      Pages 188-199

    2. Faster Two Dimensional Scaled Matching

      • Amihood Amir, Eran Chencinski
      Pages 200-210
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Keywords

Editors and Affiliations

  • Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    Moshe Lewenstein

  • Department of Software, Technical University of Catalonia, Barcelona, Spain

    Gabriel Valiente

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation