Foreword

Paolo Ferragina; Gad M. Landau

doi:10.1016/j.tcs.2009.09.007

Foreword

Paolo Ferragina, Gad M. Landau

Department of Computer Science

Research output: Contribution to journal › Editorial

Abstract

The annual CPM meeting which provides an international forum for research in combinatorial pattern matching and related applications is discussed. It addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The meeting also deals with problems in computational biology, data compression, data mining, coding, information retrieval, and natural language processing and pattern recognition. The first twenty one meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus and Piscataway. Twenty five extended abstracts were chosen after a refereeing process, and three presentations were invited to the conference.

Original language	English
Pages (from-to)	5299
Number of pages	1
Journal	Theoretical Computer Science
Volume	410
Issue number	51
DOIs	https://doi.org/10.1016/j.tcs.2009.09.007
State	Published - 28 Nov 2009

Bibliographical note

Funding Information:
The papers contained in this issue were chosen from the abstracts presented at the 19th Annual Symposium on Combinatorial Pattern Matching, held July 18–20, 2009, at the Department of Computer Science of the University of Pisa, Italy. The conference was supported by the University of Pisa and Yahoo! Research.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2009.09.007

Cite this

@article{4fcfea1f9cb449b197e6b9b1b5f6eb23,

title = "Foreword",

abstract = "The annual CPM meeting which provides an international forum for research in combinatorial pattern matching and related applications is discussed. It addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The meeting also deals with problems in computational biology, data compression, data mining, coding, information retrieval, and natural language processing and pattern recognition. The first twenty one meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus and Piscataway. Twenty five extended abstracts were chosen after a refereeing process, and three presentations were invited to the conference.",

author = "Paolo Ferragina and Landau, {Gad M.}",

note = "Funding Information: The papers contained in this issue were chosen from the abstracts presented at the 19th Annual Symposium on Combinatorial Pattern Matching, held July 18–20, 2009, at the Department of Computer Science of the University of Pisa, Italy. The conference was supported by the University of Pisa and Yahoo! Research.",

year = "2009",

month = nov,

day = "28",

doi = "10.1016/j.tcs.2009.09.007",

language = "English",

volume = "410",

pages = "5299",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "51",

}

TY - JOUR

T1 - Foreword

AU - Ferragina, Paolo

AU - Landau, Gad M.

N1 - Funding Information: The papers contained in this issue were chosen from the abstracts presented at the 19th Annual Symposium on Combinatorial Pattern Matching, held July 18–20, 2009, at the Department of Computer Science of the University of Pisa, Italy. The conference was supported by the University of Pisa and Yahoo! Research.

PY - 2009/11/28

Y1 - 2009/11/28

N2 - The annual CPM meeting which provides an international forum for research in combinatorial pattern matching and related applications is discussed. It addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The meeting also deals with problems in computational biology, data compression, data mining, coding, information retrieval, and natural language processing and pattern recognition. The first twenty one meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus and Piscataway. Twenty five extended abstracts were chosen after a refereeing process, and three presentations were invited to the conference.

AB - The annual CPM meeting which provides an international forum for research in combinatorial pattern matching and related applications is discussed. It addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The meeting also deals with problems in computational biology, data compression, data mining, coding, information retrieval, and natural language processing and pattern recognition. The first twenty one meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus and Piscataway. Twenty five extended abstracts were chosen after a refereeing process, and three presentations were invited to the conference.

UR - http://www.scopus.com/inward/record.url?scp=70350230106&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.09.007

DO - 10.1016/j.tcs.2009.09.007

M3 - Editorial

AN - SCOPUS:70350230106

SN - 0304-3975

VL - 410

SP - 5299

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 51

ER -

Foreword

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this