Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings: Lecture Notes in Computer Science, cartea 5577
Editat de Gregory Kucherov, Esko Ukkonenen Limba Engleză Paperback – 8 iun 2009
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 325.94 lei
Preț vechi: 407.42 lei
-20% Nou
Puncte Express: 489
Preț estimativ în valută:
62.38€ • 65.81$ • 51.99£
62.38€ • 65.81$ • 51.99£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642024405
ISBN-10: 3642024408
Pagini: 383
Ilustrații: XIII, 370 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.59 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
ISBN-10: 3642024408
Pagini: 383
Ilustrații: XIII, 370 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.59 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ă
ResearchCuprins
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 HaplotypeData.- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).