CPM’s 20th Anniversary: A Statistical Retrospective

  • Elena Yavorska Harris
  • Thierry Lecroq
  • Gregory Kucherov
  • Stefano Lonardi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5577)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apostolico, A., Galil, Z. (eds.): Combinatorial Algorithms on Words. NATO ASI Series, Advanced Science Institutes Series, Series F, vol. 12. Springer, Heidelberg (1985)MATHGoogle Scholar
  2. 2.
    Crochemore, M. (ed.): Proceedings of the 1st Annual Symposium on Combinatorial Pattern Matching. Theoret. Comput. Sci., 92(1) (1992)Google Scholar
  3. 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. 4.
    Baeza-Yates, R., Crochemore, M. (eds.): Indexing and Matching Strings. Special issue of J. Discrete Algorithms 3(2–4) (2005)Google Scholar
  5. 5.
    Crochemore, M., Ga̧sieniec, L. (eds.): Matching Patterns. Hermès (2000); Special issue of J. Discrete AlgorithmsGoogle Scholar
  6. 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. 7.
    Sahinalp, S.C., Dogrusoz, U., Muthukrishnan, S. (eds.): Combinatorial Pattern Matching. Special issue of Theoretical Computer Science 368(3) (2006)Google Scholar
  8. 8.
    Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.): CPM 1992. LNCS, vol. 644. Springer, Heidelberg (1992)Google Scholar
  9. 9.
    Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.): CPM 1993. LNCS, vol. 684. Springer, Heidelberg (1993)Google Scholar
  10. 10.
    Crochemore, M., Gusfield, D. (eds.): CPM 1994. LNCS, vol. 807. Springer, Heidelberg (1994)MATHGoogle Scholar
  11. 11.
    Galil, Z., Ukkonen, E. (eds.): CPM 1995. LNCS, vol. 937. Springer, Heidelberg (1995)Google Scholar
  12. 12.
    Hirschberg, D.S., Myers, E.W.: CPM 1996. LNCS, vol. 1075. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  13. 13.
    Apostolico, A., Hein, J.: CPM 1997. LNCS, vol. 1264. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Farach-Colton, M. (ed.): CPM 1998. LNCS, vol. 1448. Springer, Heidelberg (1998)Google Scholar
  15. 15.
    Crochemore, M., Paterson, M. (eds.): CPM 1999. LNCS, vol. 1645. Springer, Heidelberg (1999)MATHGoogle Scholar
  16. 16.
    Giancarlo, R., Sankoff, D. (eds.): CPM 2000. LNCS, vol. 1848. Springer, Heidelberg (2000)Google Scholar
  17. 17.
    Amir, A., Landau, G.M. (eds.): CPM 2001. LNCS, vol. 2089. Springer, Heidelberg (2001)Google Scholar
  18. 18.
    Apostolico, A., Takeda, M. (eds.): CPM 2002. LNCS, vol. 2373. Springer, Heidelberg (2002)MATHGoogle Scholar
  19. 19.
    Baeza-Yates, R. A., Chávez, E., Crochemore, M. (eds.): CPM 2003. LNCS, vol. 2676. Springer, Heidelberg (2003)MATHGoogle Scholar
  20. 20.
    Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds.): CPM 2004. LNCS, vol. 3109. Springer, Heidelberg (2004)MATHGoogle Scholar
  21. 21.
    Apostolico, A., Crochemore, M., Park, K. (eds.): CPM 2005. LNCS, vol. 3537. Springer, Heidelberg (2005)Google Scholar
  22. 22.
    Lewenstein, M., Valiente, G. (eds.): CPM 2006. LNCS, vol. 4009. Springer, Heidelberg (2006)MATHGoogle Scholar
  23. 23.
    Ma, B., Zhang, K. (eds.): CPM 2007. LNCS, vol. 4580. Springer, Heidelberg (2007)Google Scholar
  24. 24.
    Ferragina, P., Landau, G.M. (eds.): CPM 2008. LNCS, vol. 5029. Springer, Heidelberg (2008)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Elena Yavorska Harris
    • 1
  • Thierry Lecroq
    • 2
  • Gregory Kucherov
    • 3
  • Stefano Lonardi
    • 1
  1. 1.Dept. of Computer ScienceUniversity of CaliforniaRiversideUSA
  2. 2.University of RouenMont-Saint-Aignan CedexFrance
  3. 3.CNRS (LIFL, Lille and J.-V.Poncelet Lab, Moscow) and INRIA Lille – Nord EuropeFrance

Personalised recommendations