Artículos relacionados a Combinatorial Pattern Matching: 20th Annual Symposium,...

Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues): 5577 - Tapa blanda

 
9783642024405: Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues): 5577
Tapa blanda
ISBN 10: 3642024408 ISBN 13: 9783642024405
Editorial: Springer, 2009

Sinopsis

It is our great pleasure to introduce the proceedings of the 20th anniversary edition of the Annual Symposium on Combinatorial Pattern Matching (CPM). The meeting was held in Lille, France,hosted by the Laboratoired’Informatique Fondamentale de Lille (LIFL) a?liated with the Universit´ e de Lille 1 and the French Centre National de Recherche Scienti?que (CNRS), as well as by INRIA Lille - Nord Europe. Started in 1990as a summer school with about 30 invited participants, CPM quicklyevolvedintoarepresentativeannualinternationalconference.Principally motivated by combinatorial algorithms for search problems in strings (texts, sequences), the scope of CPM extended to more complex data structures such astrees,graphs,two-dimensionalarrays,or setsof points.Thosestudiesresulted inarichcollectionofalgorithmictechniquesanddatastructures,makingbridges to other parts of the theory of discrete algorithms and algorithm engineering. Today, the area of combinatorial pattern matching is a well-identi?ed active sub?eld of algorithmic research. Importantly, this development has been fertilized by a number of major - plication areas providing direct motivations and fruitful feedback to the CPM problematics. Those applications include data compression, computational bi- ogy,Internetsearch,datamining,informationretrieval,coding,naturallanguage processing,pattern recognition,music analysis, and others. On the one hand, all these areas make use of combinatorial pattern matching techniques and, on the otherhand,raisenewpatternmatchingproblems.Forexample,the fastprogress in computational molecular biology, triggered in the 1990s by the availability of mass genomic data, considerably in?uenced the combinatorial pattern matching ?eld: as an illustration, about one-third of the papers presented in this volume deal with problems related to bioinformatics applications.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

It is our great pleasure to introduce the proceedings of the 20th anniversary edition of the Annual Symposium on Combinatorial Pattern Matching (CPM). The meeting was held in Lille, France,hosted by the Laboratoired'Informatique Fondamentale de Lille (LIFL) a?liated with the Universit´ e de Lille 1 and the French Centre National de Recherche Scienti?que (CNRS), as well as by INRIA Lille - Nord Europe. Started in 1990as a summer school with about 30 invited participants, CPM quicklyevolvedintoarepresentativeannualinternationalconference.Principally motivated by combinatorial algorithms for search problems in strings (texts, sequences), the scope of CPM extended to more complex data structures such astrees,graphs,two-dimensionalarrays,or setsof points.Thosestudiesresulted inarichcollectionofalgorithmictechniquesanddatastructures,makingbridges to other parts of the theory of discrete algorithms and algorithm engineering. Today, the area of combinatorial pattern matching is a well-identi?ed active sub?eld of algorithmic research. Importantly, this development has been fertilized by a number of major - plication areas providing direct motivations and fruitful feedback to the CPM problematics. Those applications include data compression, computational bi- ogy,Internetsearch,datamining,informationretrieval,coding,naturallanguage processing,pattern recognition,music analysis, and others. On the one hand, all these areas make use of combinatorial pattern matching techniques and, on the otherhand,raisenewpatternmatchingproblems.Forexample,the fastprogress in computational molecular biology, triggered in the 1990s by the availability of mass genomic data, considerably in?uenced the combinatorial pattern matching ?eld: as an illustration, about one-third of the papers presented in this volume deal with problems related to bioinformatics applications.

Reseña del editor

This book constitutes the refereed proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009, held in Lille, France in June 2009. The 27 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 63 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2009
Idioma
Inglés
ISBN 10 
3642024408
ISBN 13 
9783642024405
Encuadernación
Tapa blanda
Número de páginas
388
Editor
Kucherov Gregory
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania