[Next-Generation Sequencing Book]
  • [Photo] Asif Javed • April 3, 2010
    EVENT: 21st Annual Symposium on Combinatorial Pattern Matching
    LOCALE: NYU-POLY Brooklyn, New York, USA
    DATE: June 21-23, 2010
    URL: http://cs.nyu.edu/parida/CPM2010/
    PROGRAM: http://cs.nyu.edu/parida/CPM2010/program.html
    CONTACT: cpm2010[at]catt.poly.edu

    Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays, in various formats. The goal is deriving non-trivial combinatorial properties of such structures and exploiting these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is analyzing and pinpointing the properties and conditions under which searches can not be performed efficiently.

Discussion forums: Events: CfP: CPM 2010

Expanded view | Monitor forum | Save place

Start a new thread:

You have to be logged in to post a reply.

© 1998-2025 Scilico, LLC. All rights reserved.