| Description |
1 online resource (x, 258 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 7922 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7922.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Forty Years of Text Indexing / Alberto Apostolico, Maxime Crochemore -- LCP Magic / Moshe Lewenstein -- Discrete Methods for Image Analysis Applied to Molecular Biology / Gene Myers -- Locating All Maximal Approximate Runs in a String / Mika Amit, Maxime Crochemore, Gad M. Landau -- On Minimal and Maximal Suffixes of a Substring / Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya -- Converting SLP to LZ78 in almost Linear Time / Hideo Bannai, Paweł Gawrychowski, Shunsuke Inenaga -- A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm / Gary Benson, Yozen Hernandez, Joshua Loving -- Compact q-Gram Profiling of Compressed Strings / Philip Bille, Patrick Hagge Cording, Inge Li Gørtz -- A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform / Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen |
|
Pattern Matching with Variables: A Multivariate Complexity Analysis / Henning Fernau, Markus L. Schmid -- New Algorithms for Position Heaps / Travis Gagie, Wing-Kai Hon, Tsung-Han Ku -- Document Listing on Repetitive Collections / Travis Gagie, Kalle Karhu, Gonzalo Navarro -- Approximating Shortest Superstring Problem Using de Bruijn Graphs / Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin -- Local Search for String Problems: Brute Force Is Essentially Optimal / Jiong Guo, Danny Hermelin, Christian Komusiewicz -- Space-Efficient Construction Algorithm for the Circular Suffix Tree / Wing-Kai Hon, Tsung-Han Ku, Rahul Shah -- Efficient Lyndon Factorization of Grammar Compressed Text / Tomohiro I, Yuto Nakashima, Shunsuke Inenaga |
|
Approximation of Grammar-Based Compression via Recompression / Artur Jeż -- Fast Algorithm for Partial Covers in Words / Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski -- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small / Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi -- External Memory Generalized Suffix and LCP Arrays Construction / Felipe A. Louza, Guilherme P. Telles -- Efficient All Path Score Computations on Grid Graphs / Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson -- Time-Space Trade-Offs for the Longest Common Substring Problem / Tatiana Starikovskaya, Hjalte Wedel Vildhøj -- A Succinct Grammar Compression / Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto -- Data Structure Lower Bounds on Random 7Access to Grammar-Compressed Strings / Elad Verbin, Wei Yu |
| Summary |
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 |
| Analysis |
Computer science |
|
Data structures (Computer science) |
|
Computer software |
|
Electronic data processing |
|
Computational complexity |
|
Pattern Recognition |
|
Numeric Computing |
|
Discrete Mathematics in Computer Science |
|
Computational Biology/Bioinformatics |
|
computerwetenschappen |
|
computer sciences |
|
numerieke methoden |
|
numerical methods |
|
computertechnieken |
|
computer techniques |
|
bioinformatics |
|
computational science |
|
wiskunde |
|
mathematics |
|
patroonherkenning |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
gegevensstructuren |
|
data structures |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Notes |
International conference proceedings |
|
Includes author index |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Print version record |
| Subject |
Computer algorithms -- Congresses
|
|
Combinatorial analysis -- Congresses
|
|
Pattern recognition systems.
|
|
Algorithms
|
|
Software
|
|
Pattern Recognition, Automated
|
|
algorithms.
|
|
software.
|
|
Pattern recognition systems
|
|
Combinatorial analysis
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Software.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Fischer, Johannes (Computer scientist), editior.
|
|
Sanders, Peter, 1967- editor.
|
| ISBN |
9783642389054 |
|
3642389058 |
|
364238904X |
|
9783642389047 |
|
