Skip to main content
SpringerLink
Log in

Combinatorial Pattern Matching

9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Martin Farach-Colton
    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 1448)

Included in the following conference series:

Conference proceedings info: CPM 1998.

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

Access this book

Log in via an institution
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 (17 papers)

  1. Front Matter

    Download chapter PDF

  2. A fast bit-vector algorithm for approximate string matching based on dynamic programming

    • Gene Myers
    Pages 1-13

  3. A bit-parallel approach to suffix automata: Fast extended string matching

    • Gonzalo Navarro, Mathieu Raffinot
    Pages 14-33

  4. A dictionary matching algorithm fast on the average for terms of varying length

    • Michal Ziv-Ukelson, Aaron Kershenbaum
    Pages 34-54

  5. A very fast string matching algorithm for small alphabets and long patterns

    • Christian Charras, Thierry Lecrog, Joseph Daniel Pehoushek
    Pages 55-64

  6. Approximate word sequence matching over Sparse Suffix Trees

    • Knut Magne Risvik
    Pages 65-79

  7. Efficient parallel algorithm for the editing distance between ordered trees

    • Kaizhong Zhang
    Pages 80-90

  8. Reporting exact and approximate regular expression matches

    • Eugene W. Myers, Paulo Oliva, Katia Guimarães
    Pages 91-103

  9. An approximate oracle for distance in metric spaces

    • Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason T. L. Wang, Dennis Shasha
    Pages 104-117

  10. A rotation invariant filter for two-dimensional string matching

    • Kimmo Fredriksson, Esko Ukkonen
    Pages 118-125

  11. Constructing suffix arrays for multi-dimensional matrices

    • Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park
    Pages 126-139

  12. Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version

    • Jens Stoye, Dan Gusfield
    Pages 140-152

  13. Comparison of coding DNA

    • Christian N. S. Pedersen, Rune Lyngsø, Jotun Hein
    Pages 153-173

  14. Fixed topology alignment with recombination

    • Bin Mal, Lusheng Wange, Ming Lia
    Pages 174-188

  15. Aligning alignments

    • John D. Kececioglu, Weiqing Zhang
    Pages 189-208

  16. Efficient special cases of pattern matching with swaps

    • Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewensteint
    Pages 209-220

  17. Aligning DNA sequences to minimize the change in protein

    • Yufang Hua, Tao Jiang, Bin Wu
    Pages 221-234

  18. Genome halving

    • Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
    Pages 235-250

  19. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Keywords

About this book

This book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects to be matched as well as with DNA coding.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation