Custom cover image
Custom cover image

Combinatorial Pattern Matching : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / edited by David Hutchison, Takeo Kanade, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, John C. Mitchell, Moni Naor, Oscar Nierstrasz, C. Pandu Rangan, Bernhard Steffen, Madhu Sudan, Demetri Terzopoulos, Doug Tygar, Moshe Y. Vardi, Gerhard Weikum, Gregory Kucherov, Esko Ukkonen

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 5577Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009Description: Online-Ressource (digital)ISBN:
  • 9783642024412
Subject(s): Genre/Form: Additional physical formats: 9783642024405 | Buchausg. u.d.T.: Combinatorial pattern matching. Berlin : Springer, 2009. XIII, 370 S.DDC classification:
  • 005.1
  • 004.0151 23
  • 006.4015116
MSC: MSC: *68-06 | 68R05 | 68W32 | 00B25LOC classification:
  • QA76.9.A43
DOI: DOI: 10.1007/978-3-642-02441-2Online resources: Summary: 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 -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).PPN: PPN: 1648259421Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT