|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483950803321 |
|
|
Titolo |
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings / / Gregory Kucherov, Esko Ukkonen (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; New York, : Springer, c2009 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2009.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIII, 370 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science ; ; 5577 |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
KucherovGregory |
UkkonenE <1950-> (Esko) |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer algorithms |
Combinatorial analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms |
|
|
|
|