Papers in all areas related to combinatorial pattern matching and its applications are sought. Both papers reporting on original research unpublished elsewhere and surveys of important results are welcome.

The proceedings will be published in the Springer-Verlag series, Lecture Notes in Computer Science.

Topics of Interest

Papers are solicited on, but not limited to, the following topics:

    Bioinformatics and computational biology
    Coding and data compression
    Combinatorics on words
    Data mining
    Information retrieval
    Natural language processing
    Pattern discovery
    String algorithms
    String processing in databases
    Symbolic computing
    Text searching

Submission

Submission will be through the EasyChair conference system. The submission process requires registration to create an EasyChair account prior to submission.

Submission format

The authors should submit an extended abstract not exceeding 10 single-spaced pages on A4 (or US letter) paper, including figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract. References will not be counted in the page limit. Use reasonable margins and at least 11-point font. The authors are strongly advised to use the LaTeX style file supplied by Springer Verlag for Lecture Notes in Computer Science. Final proceedings papers must be camera-ready in this format.

Papers must be submitted as a single file in PDF format.

Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit.

Papers submitted for review should represent original, previously unpublished work and surveys of important results. At the time the extended abstract is submitted to CPM, and for the entire review period, the paper (or essentially the same paper) should not be under review by any other conference with published proceedings or by a scientific journal.