| Description |
1 online resource (xv, 480 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6661 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6661. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Invited Talks -- Algorithms on Grammar-Compressed Strings / Gad M. Landau -- Automatic Discovery of Patterns in Media Content / Nello Cristianini -- Computational Regulatory Genomics / Martin Vingron -- Contributed Papers -- Lempel-Ziv Factorization Revisited / Simon Gog -- Succincter Text Indexing with Wildcards / Chris Thachuk -- Self-indexing Based on LZ77 / Gonzalo Navarro -- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies / Binhai Zhu -- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time / W.F. Smyth -- d-Step Approach for Distinct Squares in Strings / Mei Jiang -- Tractability Results for the Consecutive-Ones Property with Multiplicity / Roland Wittler -- Forest Alignment with Affine Gaps and Anchors / Robert Giegerich -- Phylogenetic Footprinting and Consistent Sets of Local Aligments / Sonja J. Prohaska -- Unique Perfect Phylogeny Is NP-Hard / Juraj Stacho -- Fast Error-Tolerant Quartet Phylogeny Algorithms / Jakub Truszkowski -- Real-Time Streaming String-Matching / Zvi Galil -- Simple Real-Time Constant-Space String Matching / Filippo Mignosi -- Space Lower Bounds for Online Pattern Matching / Benjamin Sach -- Counting Colours in Compressed Strings / Juha Karkkainen -- On Wavelet Tree Construction / German Tischler -- Lightweight BWT Construction for Very Large String Collections / Giovanna Rosone -- Palindrome Pattern Matching / Masayuki Takeda -- Sparse and Truncated Suffix Trees on Variable-Length Codes / Hiroki Arimura -- On the Weak Prefix-Search Problem / Paolo Ferragina -- Quick Greedy Computation for Minimum Common String Partitions / Moshe Lewenstein -- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations / Gonzalo Navarro -- Substring Range Reporting / Inge Li Gørtz |
| Summary |
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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 problems 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 |
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
bioinformatics |
|
computerwetenschappen |
|
computer sciences |
|
gegevensstructuren |
|
data structures |
|
datamining |
|
data mining |
|
patroonherkenning |
|
pattern recognition |
|
computational science |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| In |
Springer eBooks |
| Subject |
Computer algorithms -- Congresses
|
|
Combinatorial analysis -- Congresses
|
|
Data mining.
|
|
Software
|
|
Data Mining
|
|
Computational Biology
|
|
software.
|
|
Informatique.
|
|
Combinatorial analysis
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Giancarlo, Raffaele.
|
|
Manzini, Giovanni.
|
| ISBN |
9783642214585 |
|
3642214584 |
|
