Research Catalog

Combinatorial pattern matching : third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : proceedings

Title
Combinatorial pattern matching : third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : proceedings / A. Apostolico [and others].
Publication
Berlin ; New York : Springer-Verlag, ©1992.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library QA76.9.A43 C65 1992Off-site

Details

Additional Authors
Apostolico, Alberto, 1948-
Description
x, 287 pages : illustrations; 24 cm.
Summary
"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."--PUBLISHER'S WEBSITE
Series Statement
Lecture notes in computer science ; 644
Uniform Title
Lecture notes in computer science ; 644.
Subject
  • Deutsche Arbeitsgemeinschaft für Mustererkennung Symposium
  • Computer algorithms > Congresses
  • Combinatorial analysis > Congresses
  • Combinatorial analysis
  • Computer algorithms
  • Kombinatorik
  • Matching
  • Mustervergleich
  • Mustererkennung
  • Algoritmen
  • Combinatieleer
  • Patroonherkenning
  • Bioinformatics > Congresses
  • Perception des structures > Congrès
  • Reconnaissance des formes (informatique) > Congrès
  • Analyse combinatoire > Congrès
  • Tucson <Ariz., 1992>
Genre/Form
Conference papers and proceedings.
Bibliography (note)
  • Includes bibliographical references.
Contents
  • Probabilistic Analysis of Generalized Suffix Trees / Wojciech Szpankowski -- A Language Approach to String Searching Evaluation / Mireille Regnier -- Pattern Matching with Mismatches: A Probabilistic Analysis and a Randomized Algorithm / Mikhail J. Atallah, Philippe Jacquet and Wojciech Szpankowski -- Fast Multiple Keyword Searching / Jong Yong Kim and John Shawe-Taylor -- Heaviest Increasing/Common Subsequence Problems / Guy Jacobson and Kiem-Phong Vo -- Approximate Regular Expression Pattern Matching with Concave Gap Penalties / James R. Knight and Eugene W. Meyers -- Matrix Longest Common Subsequence Problem, Duality and Hilbert Bases / Pavel A. Pevzner and Michael S. Waterman -- From Regular Expressions to DFA's Using Compressed NFA's / Chia-Hsiang Chang and Robert Paige -- Identifying Periodic Occurrences of a Template with Applications to Protein Structure / Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt and Peter H. Sellers -- Edit Distance for Genome Comparison Based on Non-Local Operations / David Sankoff -- 3-D Substructure Matching in Protein Molecules / Daniel Fischer, Ruth Nussinov and Haim J. Wolfson -- Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's / Kaizhong Zhang, Dennis Shasha and Jason T.L. Wang -- Grammatical Tree Matching / Pekka Kilpelainen and Heikki Mannila -- Theoretical and Empirical Comparison of Approximate String Matching Algorithms / William I. Chang and Jordan Lampe
  • Fast and Practical Approximate String Matching / Ricardo A. Baeza-Yates and Chris H. Perleberg -- DZ: A Text Compression Algorithm for Natural Languages / Dominique Revuz and Marc Zipstein -- Multiple Alignment with Guaranteed Error Bounds and Communication Cost / Pavel A. Pevzner -- Two Algorithms for the Longest Common Subsequence of Three (or More) Strings / Robert W. Irving and Campbell B. Fraser -- Color Set Size Problem with Applications to String Matding / Lucas C.K. Hui -- Computing Display Conflicts in String and Circular String Visualization / Dinesh P. Mehta and Sartaj Sahni -- Efficient Randomized Dictionary Matching Algorithms / Amihood Amir, Martin Farach and Yossi Matias -- Dynamic Dictionary Matching with Failure Functions / Ramana M. Idury and Alejandro A. Schaffer.
ISBN
  • 3540560246
  • 9783540560241
  • 0387560246
  • 9780387560243
LCCN
92031070
OCLC
  • ocm26590794
  • 26590794
  • SCSB-1969521
Owning Institutions
Princeton University Library