Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1848)
Buy it now
Buying options
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 (34 papers)
-
Front Matter
-
Summer School Lectures
-
Contributed Papers
Keywords
- Algorithmics
- Approximation Algorithms
- Combinatorial Mathematics
- Combinatorial Pattern Matching
- Complexity
- Computational Biology
- Computational Discrete Mathematics
- Searching
- Speech Recognition
- String Matching
- algorithms
- data compression
- multimedia
- pattern recognition
- sets
- algorithm analysis and problem complexity
- combinatorics
Editors and Affiliations
-
Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Palermo, Italy
Raffaele Giancarlo
-
Centre de recherches mathématiques, Université de Montréal, Montréal, Canada
David Sankoff
Bibliographic Information
Book Title: Combinatorial Pattern Matching
Book Subtitle: 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings
Editors: Raffaele Giancarlo, David Sankoff
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45123-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2000
Softcover ISBN: 978-3-540-67633-1Published: 07 June 2000
eBook ISBN: 978-3-540-45123-5Published: 29 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 426
Topics: Pattern Recognition, Theory of Computation, Algorithm Analysis and Problem Complexity, Natural Language Processing (NLP), Information Storage and Retrieval, Combinatorics