Skip to main content
  • Conference proceedings
  • © 2005

Combinatorial Pattern Matching

16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings

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

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

Conference series link(s): CPM: Annual Symposium on Combinatorial Pattern Matching

Conference proceedings info: CPM 2005.

Buy it now

Buying options

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

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

Table of contents (37 papers)

  1. Incremental Inference of Relational Motifs with a Degenerate Alphabet

    • Nadia Pisanti, Henry Soldano, Mathilde Carpentier
    Pages 229-240
  2. Speeding up Parsing of Biological Context-Free Grammars

    • Daniel Fredouille, Christopher H. Bryant
    Pages 241-256
  3. A New Periodicity Lemma

    • Kangmin Fan, William F. Smyth, R. J. Simpson
    Pages 257-265
  4. Two Dimensional Parameterized Matching

    • Carmit Hazay, Moshe Lewenstein, Dekel Tsur
    Pages 266-279
  5. An Optimal Algorithm for Online Square Detection

    • Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
    Pages 280-287
  6. A Simple Fast Hybrid Pattern-Matching Algorithm

    • Frantisek Franek, Christopher G. Jennings, William F. Smyth
    Pages 288-297
  7. Prefix-Free Regular-Expression Matching

    • Yo-Sub Han, Yajun Wang, Derick Wood
    Pages 298-309
  8. Reducing the Size of NFAs by Using Equivalences and Preorders

    • Lucian Ilie, Roberto Solis-Oba, Sheng Yu
    Pages 310-321
  9. Regular Expression Constrained Sequence Alignment

    • Abdullah N. Arslan
    Pages 322-333
  10. A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables

    • Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara
    Pages 346-357
  11. Assessing the Significance of Sets of Words

    • Valentina Boeva, Julien Clément, Mireille Régnier, Mathias Vandenbogaert
    Pages 358-370
  12. Inferring a Graph from Path Frequency

    • Tatsuya Akutsu, Daiji Fukagawa
    Pages 371-382
  13. Exact and Approximation Algorithms for DNA Tag Set Design

    • Ion I. Măndoiu, Dragoş Trincă
    Pages 383-393
  14. Parametric Analysis for Ungapped Markov Models of Evolution

    • David Fernández-Baca, Balaji Venkatachalam
    Pages 394-405
  15. Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation

    • Mary Ellen Bock, Guido M. Cortelazzo, Carlo Ferrari, Concettina Guerra
    Pages 417-428
  16. Mass Spectra Alignments and Their Significance

    • Sebastian Böcker, Hans-Michael Kaltenbach
    Pages 429-441
  17. Back Matter

Other Volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  • Université Paris-Est, France

    Maxime Crochemore

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

Bibliographic Information

Buy it now

Buying options

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