Skip to main content

CPM’s 20th Anniversary: A Statistical Retrospective

  • Conference paper
Combinatorial Pattern Matching (CPM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5577))

Included in the following conference series:

  • 640 Accesses

Abstract

This year the Annual Symposiumon Combinatorial Pattern Matching (CPM) celebrates its 20th anniversary. Over the last two decades the Symposium has established itself as the most recognized international forum for research in combinatorial pattern matching and related applications. Contributions to the conference typically address issues of searching and matching strings and more complex patterns such as trees, regular expressions, graphs, point sets, and arrays. Advances in this field rely on the ability to expose combinatorial properties of the computational problem at hand and to exploit these properties in order to either achieve superior performance or identify conditions underwhich searches cannot be performed efficiently. The meeting also dealswith combinatorial problems in computational biology, data compression, data mining, coding, information retrieval, natural language processing and pattern recognition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apostolico, A., Galil, Z. (eds.): Combinatorial Algorithms on Words. NATO ASI Series, Advanced Science Institutes Series, Series F, vol. 12. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  2. Crochemore, M. (ed.): Proceedings of the 1st Annual Symposium on Combinatorial Pattern Matching. Theoret. Comput. Sci., 92(1) (1992)

    Google Scholar 

  3. Amir, A., Landau, G.M. (eds.): 12th Annual Symposium on Combinatorial Pattern Matching. Special issue of Discrete Applied Mathematics, vol. 146(2). Elsevier, Amsterdam (2005)

    Google Scholar 

  4. Baeza-Yates, R., Crochemore, M. (eds.): Indexing and Matching Strings. Special issue of J. Discrete Algorithms 3(2–4) (2005)

    Google Scholar 

  5. Crochemore, M., Ga̧sieniec, L. (eds.): Matching Patterns. Hermès (2000); Special issue of J. Discrete Algorithms

    Google Scholar 

  6. Park, K., Mouchard, L. (eds.): Selected papers from Combinatorial Pattern Matching, 2005. Special issue of J. Discrete Algorithms 5(4) (2005)

    Google Scholar 

  7. Sahinalp, S.C., Dogrusoz, U., Muthukrishnan, S. (eds.): Combinatorial Pattern Matching. Special issue of Theoretical Computer Science 368(3) (2006)

    Google Scholar 

  8. Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.): CPM 1992. LNCS, vol. 644. Springer, Heidelberg (1992)

    Google Scholar 

  9. Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.): CPM 1993. LNCS, vol. 684. Springer, Heidelberg (1993)

    Google Scholar 

  10. Crochemore, M., Gusfield, D. (eds.): CPM 1994. LNCS, vol. 807. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  11. Galil, Z., Ukkonen, E. (eds.): CPM 1995. LNCS, vol. 937. Springer, Heidelberg (1995)

    Google Scholar 

  12. Hirschberg, D.S., Myers, E.W.: CPM 1996. LNCS, vol. 1075. Springer, Heidelberg (1996)

    Book  Google Scholar 

  13. Apostolico, A., Hein, J.: CPM 1997. LNCS, vol. 1264. Springer, Heidelberg (1997)

    Book  Google Scholar 

  14. Farach-Colton, M. (ed.): CPM 1998. LNCS, vol. 1448. Springer, Heidelberg (1998)

    Google Scholar 

  15. Crochemore, M., Paterson, M. (eds.): CPM 1999. LNCS, vol. 1645. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  16. Giancarlo, R., Sankoff, D. (eds.): CPM 2000. LNCS, vol. 1848. Springer, Heidelberg (2000)

    Google Scholar 

  17. Amir, A., Landau, G.M. (eds.): CPM 2001. LNCS, vol. 2089. Springer, Heidelberg (2001)

    Google Scholar 

  18. Apostolico, A., Takeda, M. (eds.): CPM 2002. LNCS, vol. 2373. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  19. Baeza-Yates, R. A., Chávez, E., Crochemore, M. (eds.): CPM 2003. LNCS, vol. 2676. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  20. Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds.): CPM 2004. LNCS, vol. 3109. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  21. Apostolico, A., Crochemore, M., Park, K. (eds.): CPM 2005. LNCS, vol. 3537. Springer, Heidelberg (2005)

    Google Scholar 

  22. Lewenstein, M., Valiente, G. (eds.): CPM 2006. LNCS, vol. 4009. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  23. Ma, B., Zhang, K. (eds.): CPM 2007. LNCS, vol. 4580. Springer, Heidelberg (2007)

    Google Scholar 

  24. Ferragina, P., Landau, G.M. (eds.): CPM 2008. LNCS, vol. 5029. Springer, Heidelberg (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harris, E.Y., Lecroq, T., Kucherov, G., Lonardi, S. (2009). CPM’s 20th Anniversary: A Statistical Retrospective. In: Kucherov, G., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 2009. Lecture Notes in Computer Science, vol 5577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02441-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02441-2_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02440-5

  • Online ISBN: 978-3-642-02441-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics