Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Pattern Matching

11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Raffaele Giancarlo

    1. Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Palermo, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David Sankoff

    1. Centre de recherches mathématiques, Université de Montréal, Montréal, Canada

    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 1848)

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 (34 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Summer School Lectures

    1. Algorithmic Aspects of Speech Recognition: A Synopsis

      • Adam L. Buchsbaum, Raffaele Giancarlo
      Pages 27-32

    2. Some Results on Flexible-Pattern Discovery

      • Laxmi Parida
      Pages 33-45

  4. Contributed Papers

    1. Explaining and Controlling Ambiguity in Dynamic Programming

      • Robert Giegerich
      Pages 46-59

    2. A Dynamic Edit Distance Table

      • Sung -Ryul Kim, Kunsoo Park
      Pages 60-68

    3. Parametric Multiple Sequence Alignment and Phylogeny Construction

      • David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
      Pages 69-83

    4. Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment

      • Paul Horton
      Pages 84-98

    5. A Polynomial Time Approximation Scheme for the Closest Substring Problem

      • Bin Ma
      Pages 99-107

    6. Approximation Algorithms for Hamming Clustering Problems

      • Leszek Gąasieniec, Jesper Jansson, Andrzej Lingas
      Pages 108-118

    7. Approximating the Maximum Isomorphic Agreement Subtree Is Hard

      • Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
      Pages 119-128

    8. A Faster and Unifying Algorithm for Comparing Trees

      • Ming -Yang Kao, Tak -Wah Lam, Wing -Kin Sung, Hing -Fung Ting
      Pages 129-142

    9. Incomplete Directed Perfect Phylogeny

      • Itsik Pe’er, Ron Shamir, Roded Sharan
      Pages 143-153

    10. The Longest Common Subsequence Problem for Arc-Annotated Sequences

      • Tao Jiang, Guo-Hui Lin, Bin Ma, Kaizhong Zhang
      Pages 154-165

    11. Boyer—Moore String Matching over Ziv-Lempel Compressed Text

      • Gonzalo Navarro, Jorma Tarhio
      Pages 166-180

    12. A Boyer—Moore Type Algorithm for Compressed Pattern Matching

      • Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
      Pages 181-194

    13. Approximate String Matching over Ziv—Lempel Compressed Text

      • Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
      Pages 195-209

    14. Improving Static Compression Schemes by Alphabet Extension

      • Shmuel T. Klein
      Pages 210-221
Back to top

Keywords

Editors and Affiliations

  • Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Palermo, Italy

    Raffaele Giancarlo

  • Centre de recherches mathématiques, Université de Montréal, Montréal, Canada

    David Sankoff

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation