Update 23 martie - COVID-19 - Informații privind activitatea Books Express

Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings (Lecture Notes in Computer Science, nr. 5577)

Editat de Gregory Kucherov, Esko Ukkonen
Notă GoodReads:
en Limba Engleză Paperback – 08 Jun 2009

Din seria Lecture Notes in Computer Science

Preț: 34136 lei

Preț vechi: 42670 lei

Puncte Express: 512

Preț estimativ în valută:
6720 7546$ 6066£

Carte tipărită la comandă

Livrare economică 10-24 august
Livrare express 10-17 iulie pentru 14882 lei

Preluare comenzi: 021 569.72.76


ISBN-13: 9783642024405
ISBN-10: 3642024408
Pagini: 383
Ilustrații: Illustrations
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.58 kg
Ediția: 2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science , Theoretical Computer Science and General Issues

Locul publicării: Berlin, Heidelberg, Germany

Public țintă



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).