| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465698103316 |
|
|
Titolo |
Combinatorial Pattern Matching [[electronic resource] ] : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings / / edited by Johannes Fischer, Peter Sanders |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2013.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 259 p. 58 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7922 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Pattern recognition systems |
Algorithms |
Numerical analysis |
Computer science—Mathematics |
Discrete mathematics |
Artificial intelligence—Data processing |
Bioinformatics |
Automated Pattern Recognition |
Numerical Analysis |
Discrete Mathematics in Computer Science |
Data Science |
Computational and Systems Biology |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Searching and matching strings and more complicated patterns.- Trees, regular expressions, graphs, point sets, and arrays.- Non-trivial combinatorial properties of such structures.- Problems in computational biology -- Data compression and data mining -- Coding -- Information retrieval -- Natural language processing -- Pattern recognition. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full |
|
|
|
|
|
|
|
|
|
|
papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition. |
|
|
|
|
|
| |