20. CPM 2009: Lille, France
Gregory Kucherov, Esko Ukkonen (Eds.): Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings. Springer 2009 Lecture Notes in Computer Science ISBN 978-3-642-02440-5- Elena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi: CPM's 20th Anniversary: A Statistical Retrospective. 1-11
- Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko: Quasi-distinct Parsing and Optimal Compression Methods. 12-25
- Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein: Generalized Substring Compression. 26-38
- Roberto Grossi: Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. 39-40
- Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo: Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. 41-53
- Ge Nong, Sen Zhang, Wai Hong Chan: Linear Time Suffix Array Construction Using D-Critical Substrings. 54-67
- Travis Gagie: On the Value of Multiple Read/Write Streams for Data Compression. 68-77
- Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. 78-91
- Gad M. Landau, Avivit Levy, Ilan Newman: LCS Approximation via Embedding into Local Non-repetitive Strings. 92-105
- Simone Faro, Thierry Lecroq: An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. 106-115
- Philip Bille: Fast Searching in Packed Strings. 116-126
- Christian Hundt, Maciej Liskiewicz: New Complexity Bounds for Image Matching under Rotation and Scaling. 127-141
- Djamal Belazzougui: Faster and Space-Optimal Edit Distance "1" Dictionary. 154-167
- Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. 168-179
- Ravi Kumar: Modeling and Algorithmic Challenges in Online Social Networks. 180
- Alexander Tiskin: Periodic String Comparison. 193-206
- Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing Intractability: A Case Study for Interval Constrained Coloring. 207-220
- Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Maximum Motif Problem in Vertex-Colored Graphs. 221-235
- Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA Structure Alignment for Crossing Input Structures. 236-248
- Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA Folding: Time and Space Efficient Algorithms. 249-262
- Yves-Pol Deniélou, Frédéric Boyer, Alain Viari, Marie-France Sagot: Multiple Alignment of Biological Networks: A Flexible Approach. 263-273
- Christos Faloutsos: Graph Mining: Patterns, Generators and Tools. 274
- Thu-Hien To, Michel Habib: Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. 275-288
- Philippe Gambette, Vincent Berry, Christophe Paul: The Structure of Level-k Phylogenetic Networks. 289-300
- Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding All Sorting Tandem Duplication Random Loss Operations. 301-313
- Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin: Average-Case Analysis of Perfect Sorting by Reversals. 314-325
- Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. 339-352
- Wei-Bung Wang, Tao Jiang: Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). 353-367
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team