Skip to main content
SpringerLink
Log in

Combinatorial Pattern Matching

Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Alberto Apostolico
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Maxime Crochemore
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Zvi Galil
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Udi Manber
    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 644)

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

  1. Front Matter

    Download chapter PDF

  2. Probabilistic analysis of generalized suffix trees

    • Wojciech Szpankowski
    Pages 1-14

  3. A language approach to string searching evaluation

    • Mireille Régnier
    Pages 15-26

  4. Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm

    • Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski
    Pages 27-40

  5. Fast multiple keyword searching

    • Jong Yong Kim, John Shawe-Taylor
    Pages 41-51

  6. Heaviest increasing/common subsequence problems

    • Guy Jacobson, Kiem-Phong Vo
    Pages 52-66

  7. Approximate regular expression pattern matching with concave gap penalties

    • James R. Knight, Eugene W. Myers
    Pages 67-78

  8. Matrix longest common subsequence problem, duality and hilbert bases

    • Pavel A. Pevzner, Michael S. Waterman
    Pages 79-89

  9. From regular expressions to DFA's using compressed NFA's

    • Chia-Hsiang Chang, Robert Paige
    Pages 90-110

  10. Identifying periodic occurrences of a template with applications to protein structure

    • Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
    Pages 111-120

  11. Edit distance for genome comparison based on non-local operations

    • David Sankoff
    Pages 121-135

  12. 3-D substructure matching in protein Molecules

    • Daniel Fischer, Ruth Nussinov, Haim J. Wolfson
    Pages 136-150

  13. Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract)

    • Kaizhong Zhang, Dennis Shasha, Jason Tsong-Li Wang
    Pages 151-161

  14. Grammatical tree matching

    • Pekka Kilpeläinen, Heikki Mannila
    Pages 162-174

  15. Theoretical and empirical comparisons of approximate string matching algorithms

    • William I. Chang, Jordan Lampe
    Pages 175-184

  16. Fast and practical approximate string matching

    • Ricardo A. Baeza-Yates, Chris H. Perleberg
    Pages 185-192

  17. DZ A text compression algorithm for natural languages

    • Dominique Revuz, Marc Zipstein
    Pages 193-204

  18. Multiple alignment with guaranteed error bounds and communication cost

    • Pavel A. Pevzner
    Pages 205-213

  19. Two algorithms for the longest common subsequence of three (or more) strings

    • Robert W. Irving, Campbell B. Fraser
    Pages 214-229

  20. Color Set Size problem with applications to string matching

    • Lucas Chi, Kwong Hui
    Pages 230-243
Back to top

Keywords

About this book

This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissues of searching and matching of strings and other more complicated patterns such as trees, regular expressions, extended expressions, etc. in order to derive combinatorial properties for such structures. As an interdisciplinary field of growing interest, CPM is related to research in information retrieval, pattern recognition, compilers, data compression, and program analysis as well as to results, problems and methods from combinatorial mathematics and molecular biology.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation