Limit search to available items
Book Cover
E-book
Author CPM (Symposium) (20th : 2009 : Lille, France)

Title Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings / Gregory Kucherov, Esko Ukkonen (eds.)
Published Berlin ; New York : Springer, ©2009

Copies

Description 1 online resource (xiii, 370 pages) : illustrations
Series Lecture notes in computer science ; 5577
LNCS sublibrary: SL 1 Theoretical computer science and general issues
Lecture notes in computer science ; 5577.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Contents 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)
Analysis informatieontsluiting
information retrieval
informatieopslag
information storage
bioinformatics
algoritmen
algorithms
computeranalyse
computer analysis
patroonherkenning
pattern recognition
gegevensstructuren
data structures
computational science
computerwetenschappen
computer sciences
Information and Communication Technology (General)
Informatie- en communicatietechnologie (algemeen)
Notes Title from PDF title page (SpringerLink, viewed September 16, 2009)
Bibliography Includes bibliographical references and index
Notes English
Subject Computer algorithms -- Congresses
Combinatorial analysis -- Congresses
Algorithms
Computing Methodologies
algorithms.
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 Kucherov, Gregory.
Ukkonen, E. (Esko), 1950-
ISBN 9783642024412
3642024416
Other Titles CPM 2009