Advertisement

Table of contents

  1. Front Matter
  2. Hans Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    Pages 15-30
  3. Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
    Pages 43-53
  4. Tao Jiang, Lusheng Wang, Kaizhong Zhang
    Pages 75-86
  5. Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller
    Pages 87-101
  6. S. Rao Kosaraju
    Pages 146-150
  7. Mehryar Mohri
    Pages 151-163
  8. Robert W. Irving, Campbell B. Fraser
    Pages 173-183
  9. Ricardo Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
    Pages 198-212
  10. Pekka Kilpeläinen, Heikki Mannila
    Pages 213-225
  11. Ramana M. Idury, Alejandro A. Schäffer
    Pages 226-239
  12. Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
    Pages 250-258
  13. William I. Chang, Thomas G. Marr
    Pages 259-273
  14. Minoru Ito, Kuniyasu Shimizu, Michio Nakanishi, Akihiro Hashimoto
    Pages 274-288
  15. Yasubumi Sakakibara, Michael Brown, Richard Hughey, Saira Mian, Kimmen Sjölander, Rebecca C. Underwood et al.
    Pages 289-306
  16. John Kececioglu, David Sankoff
    Pages 307-325
  17. Back Matter

About these proceedings

Introduction

This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.

Keywords

Data Compression Datenkompression Folgenanalyse Information Retrieval Informationsabfrage Matching Pattern Matching Performance Sequence Analysis String Algorithms String-Algorithmen algorithmics algorithms

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-58094-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58094-2
  • Online ISBN 978-3-540-48450-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Aerospace
Engineering