Skip to main content
SpringerLink
Log in

Combinatorial Pattern Matching

6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Zvi Galil
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Esko Ukkonen
    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 937)

Included in the following conference series:

Conference proceedings info: CPM 1995.

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

  1. Front Matter

    Download chapter PDF

  2. Computing similarity between RNA strings

    • Vineet Bafna, S. Muthukrishnan, R. Ravi
    Pages 1-16

  3. Of chicken teeth and mouse eyes, or generalized character compatibility

    • Craig Benham, Sampath Kannan, Tandy Warnow
    Pages 17-26

  4. Efficient string matching on coded texts

    • Dany Breslauer, Leszek Gasieniec
    Pages 27-40

  5. Fast approximate matching using suffix trees

    • Archie L. Cobbs
    Pages 41-54

  6. Common subsequences and supersequences and their expected length

    • Vlado Dančík
    Pages 55-63

  7. Pattern matching in directed graphs

    • Jianghai Fu
    Pages 64-77

  8. Constant-space string matching with smaller number of comparisons: sequential sampling

    • Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
    Pages 78-89

  9. Multi-dimensional pattern matching with dimensional wildcards

    • Raffaele Giancarlo, Roberto Grossi
    Pages 90-101

  10. Minimizing phylogenetic number to find good evolutionary trees

    • Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow
    Pages 102-127

  11. Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice

    • Sandeep K. Gupta, John D. Kececioglu, Alejandro A. Schäffer
    Pages 128-143

  12. An efficient algorithm for developing topologically valid matchings

    • Liz Hanks, Ron K. Cytron, Will Gillett
    Pages 144-161

  13. Polynomial-time algorithm for computing translocation distance between genomes

    • Sridhar Hannenhalli
    Pages 162-176

  14. On the complexity of comparing evolutionary trees

    • Jotun Hein, Tao Jiang, Lusheng Wang, Kaizhong Zhang
    Pages 177-190

  15. Suffix cactus: A cross between suffix tree and suffix array

    • Juha Kärkkäinen
    Pages 191-204

  16. Pattern-matching for strings with short descriptions

    • Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Pages 205-214

  17. Pairwise alignment with scoring on tuples

    • Lukas Knecht
    Pages 215-229

  18. Matching a set of strings with variable length don't cares

    • Gregory Kucherov, MichaËl Rusinowitch
    Pages 230-247

  19. Three-dimensional pattern matching in protein structure analysis

    • Arthur M. Lesk
    Pages 248-260

  20. Genome analysis: Pattern search in biological macromolecules

    • H. W. Mewes, K. Heumann
    Pages 261-285
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Keywords

About this book

This volume presents the proceedings of the 6th International Symposium on Combinatorial Pattern Matching, CPM '95, held in Espoo, Finland in July 1995.
CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. This volume presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation